/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:53:39,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:53:39,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:53:39,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:53:39,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:53:39,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:53:39,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:53:39,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:53:39,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:53:39,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:53:39,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:53:39,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:53:39,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:53:39,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:53:39,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:53:39,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:53:39,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:53:39,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:53:39,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:53:39,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:53:39,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:53:39,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:53:39,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:53:39,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:53:39,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:53:39,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:53:39,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:53:39,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:53:39,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:53:39,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:53:39,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:53:39,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:53:39,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:53:39,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:53:39,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:53:39,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:53:39,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:53:39,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:53:39,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:53:39,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:53:39,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:53:39,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:53:39,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:53:39,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:53:39,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:53:39,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:53:39,203 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:53:39,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:53:39,204 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:53:39,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:53:39,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:53:39,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:53:39,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:53:39,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:53:39,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:53:39,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:53:39,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:53:39,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:53:39,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:53:39,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:53:39,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:53:39,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:53:39,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:53:39,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:53:39,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:53:39,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:53:39,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:53:39,476 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:53:39,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 07:53:40,477 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:53:40,656 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:53:40,657 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 07:53:40,662 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a9bbbf1/89fd61d4953b4b5fa4a9cb400b0c8f04/FLAG0656493f7 [2022-12-06 07:53:40,676 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a9bbbf1/89fd61d4953b4b5fa4a9cb400b0c8f04 [2022-12-06 07:53:40,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:53:40,679 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:53:40,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:53:40,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:53:40,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:53:40,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68861edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40, skipping insertion in model container [2022-12-06 07:53:40,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:53:40,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:53:40,816 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-06 07:53:40,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:53:40,829 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:53:40,859 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-06 07:53:40,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:53:40,872 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:53:40,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40 WrapperNode [2022-12-06 07:53:40,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:53:40,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:53:40,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:53:40,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:53:40,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,916 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-06 07:53:40,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:53:40,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:53:40,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:53:40,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:53:40,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,948 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:53:40,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:53:40,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:53:40,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:53:40,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (1/1) ... [2022-12-06 07:53:40,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:53:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:40,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:53:40,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:53:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:53:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:53:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:53:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:53:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:53:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:53:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:53:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:53:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:53:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:53:41,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:53:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:53:41,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:53:41,017 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:53:41,135 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:53:41,136 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:53:41,365 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:53:41,372 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:53:41,372 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:53:41,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:53:41 BoogieIcfgContainer [2022-12-06 07:53:41,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:53:41,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:53:41,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:53:41,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:53:41,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:53:40" (1/3) ... [2022-12-06 07:53:41,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c5668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:53:41, skipping insertion in model container [2022-12-06 07:53:41,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:40" (2/3) ... [2022-12-06 07:53:41,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c5668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:53:41, skipping insertion in model container [2022-12-06 07:53:41,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:53:41" (3/3) ... [2022-12-06 07:53:41,379 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-06 07:53:41,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:53:41,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:53:41,392 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:53:41,447 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:53:41,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 07:53:41,529 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-06 07:53:41,529 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:41,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 14/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:53:41,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 07:53:41,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-06 07:53:41,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:41,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 07:53:41,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-06 07:53:41,579 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-06 07:53:41,579 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:41,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 14/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:53:41,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 07:53:41,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-06 07:53:45,302 INFO L203 LiptonReduction]: Total number of compositions: 127 [2022-12-06 07:53:45,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:53:45,317 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;@105e6703, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:53:45,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:53:45,321 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 07:53:45,321 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:45,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:45,322 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:45,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-06 07:53:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:45,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043298211] [2022-12-06 07:53:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:45,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043298211] [2022-12-06 07:53:45,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043298211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:45,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:45,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:53:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112995164] [2022-12-06 07:53:45,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:45,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:53:45,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:53:45,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:45,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:45,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:53:45,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:45,722 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 07:53:45,722 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:53:45,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 07:53:45,723 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 07:53:45,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 07:53:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 07:53:45,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 07:53:45,733 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 07:53:45,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 07:53:45,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:53:45,736 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:45,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 07:53:45,739 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:53:45,739 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:45,740 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:45,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:45,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:45,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:45,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:45,747 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 07:53:45,747 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:53:45,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 07:53:45,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:45,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 07:53:46,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:46,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 758 [2022-12-06 07:53:46,497 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 07:53:46,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:46,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:46,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:46,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:53:46,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-06 07:53:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:46,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179137708] [2022-12-06 07:53:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:46,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179137708] [2022-12-06 07:53:46,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179137708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:46,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:46,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:53:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820009625] [2022-12-06 07:53:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:46,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:46,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:53:46,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:46,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:46,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:53:46,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:46,736 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 07:53:46,737 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:53:46,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 07:53:46,738 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 07:53:46,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 07:53:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 07:53:46,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 07:53:46,739 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 07:53:46,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 07:53:46,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:46,740 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:46,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-06 07:53:46,740 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:53:46,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:46,740 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:46,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:46,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:46,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:46,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:46,745 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 07:53:46,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:53:46,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 07:53:46,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:46,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 07:53:46,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:46,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:53:46,747 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:46,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:46,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:46,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:46,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:53:46,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash 166108600, now seen corresponding path program 1 times [2022-12-06 07:53:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:46,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398389802] [2022-12-06 07:53:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:46,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398389802] [2022-12-06 07:53:46,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398389802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:46,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:46,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:53:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698094489] [2022-12-06 07:53:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:53:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:46,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:53:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:53:46,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:53:46,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:46,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:46,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:53:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:46,958 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 07:53:46,958 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 07:53:46,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 169 events. 87/169 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 517 event pairs, 30 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 132. Up to 98 conditions per place. [2022-12-06 07:53:46,962 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 6/40 dead transitions. [2022-12-06 07:53:46,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 40 transitions, 193 flow [2022-12-06 07:53:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:53:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:53:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 07:53:46,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-06 07:53:46,963 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 39 transitions. [2022-12-06 07:53:46,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 40 transitions, 193 flow [2022-12-06 07:53:46,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 40 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:53:46,964 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 07:53:46,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 07:53:46,965 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:53:46,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:46,965 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 07:53:46,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:46,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:46,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 07:53:46,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 07:53:46,972 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-06 07:53:46,972 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 07:53:46,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 34 events. 7/34 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 46. Up to 11 conditions per place. [2022-12-06 07:53:46,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 07:53:46,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 07:53:47,141 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:47,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 07:53:47,142 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 07:53:47,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:47,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:47,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:47,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:53:47,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:47,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1536303008, now seen corresponding path program 1 times [2022-12-06 07:53:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:47,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284716171] [2022-12-06 07:53:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284716171] [2022-12-06 07:53:47,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284716171] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997126322] [2022-12-06 07:53:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:47,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:47,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:47,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:47,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:53:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:47,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:53:47,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:47,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:47,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997126322] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:47,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:53:47,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-06 07:53:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437535600] [2022-12-06 07:53:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:47,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:47,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:47,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:47,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 07:53:47,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:47,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:47,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 07:53:47,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:47,456 INFO L130 PetriNetUnfolder]: 59/109 cut-off events. [2022-12-06 07:53:47,457 INFO L131 PetriNetUnfolder]: For 168/174 co-relation queries the response was YES. [2022-12-06 07:53:47,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 109 events. 59/109 cut-off events. For 168/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 299 event pairs, 10 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 203. Up to 76 conditions per place. [2022-12-06 07:53:47,460 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-12-06 07:53:47,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-06 07:53:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 07:53:47,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 07:53:47,461 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-06 07:53:47,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-06 07:53:47,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 27 transitions, 135 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 07:53:47,464 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-06 07:53:47,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-06 07:53:47,465 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 07:53:47,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:47,465 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-06 07:53:47,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:47,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:47,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-06 07:53:47,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-06 07:53:47,471 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-06 07:53:47,471 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 07:53:47,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 27 events. 7/27 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-06 07:53:47,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-06 07:53:47,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 07:53:47,472 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:47,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 07:53:47,476 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-06 07:53:47,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:47,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:47,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:47,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:53:47,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:47,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -774279310, now seen corresponding path program 1 times [2022-12-06 07:53:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:47,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803190848] [2022-12-06 07:53:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:47,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:47,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803190848] [2022-12-06 07:53:47,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803190848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:47,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:47,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591882351] [2022-12-06 07:53:47,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:47,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:47,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:47,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:47,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:53:47,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:47,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:47,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:53:47,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:47,833 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-06 07:53:47,833 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 07:53:47,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 119 events. 61/119 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 308 event pairs, 20 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 125. Up to 76 conditions per place. [2022-12-06 07:53:47,834 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-06 07:53:47,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 184 flow [2022-12-06 07:53:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:53:47,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:53:47,836 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:53:47,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 35 transitions, 184 flow [2022-12-06 07:53:47,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 35 transitions, 169 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:47,840 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:47,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-06 07:53:47,842 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 07:53:47,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:47,842 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:47,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:47,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:47,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:47,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:47,848 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-06 07:53:47,848 INFO L131 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2022-12-06 07:53:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 31 events. 6/31 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 39. Up to 9 conditions per place. [2022-12-06 07:53:47,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:47,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 07:53:48,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:48,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 07:53:48,014 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-06 07:53:48,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:48,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:48,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:48,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:53:48,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1396315567, now seen corresponding path program 1 times [2022-12-06 07:53:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:48,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395248564] [2022-12-06 07:53:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:48,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395248564] [2022-12-06 07:53:48,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395248564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:48,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:48,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:53:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160339136] [2022-12-06 07:53:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:53:48,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:53:48,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:48,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:48,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:53:48,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:48,090 INFO L130 PetriNetUnfolder]: 44/84 cut-off events. [2022-12-06 07:53:48,091 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 07:53:48,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 84 events. 44/84 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 179 event pairs, 11 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 165. Up to 68 conditions per place. [2022-12-06 07:53:48,100 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 3/25 dead transitions. [2022-12-06 07:53:48,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 143 flow [2022-12-06 07:53:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 07:53:48,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 07:53:48,101 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 26 transitions. [2022-12-06 07:53:48,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 143 flow [2022-12-06 07:53:48,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 126 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:48,103 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-06 07:53:48,103 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2022-12-06 07:53:48,105 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 07:53:48,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:48,105 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-06 07:53:48,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:48,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:48,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-06 07:53:48,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-06 07:53:48,108 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-06 07:53:48,108 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:53:48,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 6/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 9 conditions per place. [2022-12-06 07:53:48,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-06 07:53:48,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 07:53:48,109 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:48,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 07:53:48,111 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-06 07:53:48,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:48,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:48,112 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:48,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:53:48,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1385749717, now seen corresponding path program 1 times [2022-12-06 07:53:48,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:48,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248700551] [2022-12-06 07:53:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:48,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248700551] [2022-12-06 07:53:48,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248700551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:48,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:48,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540872727] [2022-12-06 07:53:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:48,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:48,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:48,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:53:48,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:48,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:48,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:53:48,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:48,256 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-06 07:53:48,256 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 07:53:48,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 119 events. 61/119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 316 event pairs, 16 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 265. Up to 76 conditions per place. [2022-12-06 07:53:48,257 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-06 07:53:48,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 176 flow [2022-12-06 07:53:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 07:53:48,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-06 07:53:48,259 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-06 07:53:48,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 176 flow [2022-12-06 07:53:48,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:48,260 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 87 flow [2022-12-06 07:53:48,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 07:53:48,261 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:53:48,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:48,261 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 87 flow [2022-12-06 07:53:48,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:48,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:48,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-06 07:53:48,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 87 flow [2022-12-06 07:53:48,265 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-06 07:53:48,265 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 07:53:48,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 37 events. 8/37 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 53. Up to 13 conditions per place. [2022-12-06 07:53:48,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-06 07:53:48,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 07:53:48,266 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:48,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 07:53:48,266 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 87 flow [2022-12-06 07:53:48,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:48,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:48,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:48,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:53:48,267 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1328554519, now seen corresponding path program 2 times [2022-12-06 07:53:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:48,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599156835] [2022-12-06 07:53:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:48,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599156835] [2022-12-06 07:53:48,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599156835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:48,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:48,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559730967] [2022-12-06 07:53:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:48,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:48,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:48,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:48,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:53:48,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:48,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:48,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:53:48,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:48,401 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-06 07:53:48,401 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-06 07:53:48,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 94 events. 52/94 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 148. Up to 76 conditions per place. [2022-12-06 07:53:48,402 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2022-12-06 07:53:48,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 154 flow [2022-12-06 07:53:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 07:53:48,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 07:53:48,403 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 87 flow. Second operand 3 states and 27 transitions. [2022-12-06 07:53:48,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 154 flow [2022-12-06 07:53:48,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 141 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:48,405 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2022-12-06 07:53:48,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-06 07:53:48,408 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 07:53:48,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:48,408 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 07:53:48,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:48,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:48,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 07:53:48,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 07:53:48,412 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-06 07:53:48,412 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:53:48,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 8/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-06 07:53:48,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 07:53:48,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 07:53:48,419 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:48,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 07:53:48,421 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-06 07:53:48,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:48,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:48,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:48,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:53:48,421 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2064777642, now seen corresponding path program 1 times [2022-12-06 07:53:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:48,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869426990] [2022-12-06 07:53:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869426990] [2022-12-06 07:53:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869426990] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359384637] [2022-12-06 07:53:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:48,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:48,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:53:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:48,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:53:48,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:48,846 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 11 treesize of output 7 [2022-12-06 07:53:48,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:53:48,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:53:48,935 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-06 07:53:48,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 35 [2022-12-06 07:53:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:48,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:49,050 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (< .cse0 0) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (= (select .cse1 (+ c_~f~0.offset (* .cse0 4))) (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset))))))) is different from false [2022-12-06 07:53:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359384637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:49,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:49,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:53:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083794988] [2022-12-06 07:53:49,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:49,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:53:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:53:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=141, Unknown=2, NotChecked=24, Total=210 [2022-12-06 07:53:49,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:53:49,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:49,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:49,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:53:49,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:49,911 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2022-12-06 07:53:49,911 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 07:53:49,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 218 events. 121/218 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 682 event pairs, 14 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 110. Up to 105 conditions per place. [2022-12-06 07:53:49,912 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 20 selfloop transitions, 4 changer transitions 37/61 dead transitions. [2022-12-06 07:53:49,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 61 transitions, 343 flow [2022-12-06 07:53:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:53:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:53:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-06 07:53:49,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-06 07:53:49,914 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 9 states and 60 transitions. [2022-12-06 07:53:49,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 61 transitions, 343 flow [2022-12-06 07:53:49,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 61 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:49,916 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 100 flow [2022-12-06 07:53:49,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-06 07:53:49,917 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 07:53:49,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:49,917 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 100 flow [2022-12-06 07:53:49,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:49,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:49,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 100 flow [2022-12-06 07:53:49,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 100 flow [2022-12-06 07:53:49,922 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-06 07:53:49,922 INFO L131 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2022-12-06 07:53:49,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 30 events. 8/30 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 71. Up to 13 conditions per place. [2022-12-06 07:53:49,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 100 flow [2022-12-06 07:53:49,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 07:53:50,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:50,752 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 835 [2022-12-06 07:53:50,752 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 96 flow [2022-12-06 07:53:50,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:50,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:50,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:50,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:50,953 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-06 07:53:50,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -380380717, now seen corresponding path program 1 times [2022-12-06 07:53:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:50,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854578059] [2022-12-06 07:53:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:51,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854578059] [2022-12-06 07:53:51,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854578059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:51,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427259825] [2022-12-06 07:53:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:51,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:51,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:51,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:51,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:53:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:51,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:53:51,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:51,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:53:51,890 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 07:53:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:51,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:51,963 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-06 07:53:51,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-06 07:53:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:52,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427259825] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:52,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:52,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-06 07:53:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349099317] [2022-12-06 07:53:52,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:52,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:53:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:52,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:53:52,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:53:52,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:53:52,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 96 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 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-06 07:53:52,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:52,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:53:52,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:52,380 INFO L130 PetriNetUnfolder]: 139/255 cut-off events. [2022-12-06 07:53:52,380 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-06 07:53:52,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 255 events. 139/255 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 788 event pairs, 10 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 845. Up to 118 conditions per place. [2022-12-06 07:53:52,382 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 57 selfloop transitions, 25 changer transitions 1/83 dead transitions. [2022-12-06 07:53:52,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 507 flow [2022-12-06 07:53:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:53:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:53:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2022-12-06 07:53:52,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36403508771929827 [2022-12-06 07:53:52,384 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 96 flow. Second operand 12 states and 83 transitions. [2022-12-06 07:53:52,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 507 flow [2022-12-06 07:53:52,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 83 transitions, 437 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 07:53:52,386 INFO L231 Difference]: Finished difference. Result has 36 places, 44 transitions, 246 flow [2022-12-06 07:53:52,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=246, PETRI_PLACES=36, PETRI_TRANSITIONS=44} [2022-12-06 07:53:52,386 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 07:53:52,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:52,386 INFO L89 Accepts]: Start accepts. Operand has 36 places, 44 transitions, 246 flow [2022-12-06 07:53:52,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:52,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:52,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-06 07:53:52,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 44 transitions, 246 flow [2022-12-06 07:53:52,395 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-06 07:53:52,395 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-06 07:53:52,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 85 events. 24/85 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 167. Up to 36 conditions per place. [2022-12-06 07:53:52,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-06 07:53:52,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 07:53:52,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:53:52,786 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:53:53,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:53:53,465 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:53:53,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (<= 0 v_~x1~0_147) (< v_~x1~0_147 v_~size~0_116)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (store |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47| (store (select |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre12#1_54|)) |v_#memory_int_171|) (= (select (select |v_#memory_int_172| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~x1~0_147 4))) v_~x1~0_146) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_128| 1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_128| 4294967295) 4294967296) (* (mod v_~n~0_115 2147483648) 2)) (= |v_ULTIMATE.start_main_#t~pre12#1_54| |v_#pthreadsForks_68|) (= |v_#pthreadsForks_67| (+ |v_#pthreadsForks_68| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_68|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_172|, ~n~0=v_~n~0_115, ~x1~0=v_~x1~0_147, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ~f~0.offset=v_~f~0.offset_104} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, ~x1~0=v_~x1~0_146, ~f~0.offset=v_~f~0.offset_104, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_54|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_43|, #pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_57|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_128|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, ~n~0=v_~n~0_115, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:53:53,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_175| v_~f~0.base_106))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_106 (* v_~x2~0_116 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (ite (and (< .cse0 v_~size~0_118) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= v_~x1~0_150 (select .cse1 (+ v_~f~0.offset_106 (* v_~x1~0_151 4)))) (= v_~x2~0_115 (select .cse1 (+ v_~f~0.offset_106 (* .cse0 4)))) (= (ite (and (< v_~x1~0_151 v_~size~0_118) (<= 0 v_~x1~0_151)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_116) (< v_~x2~0_116 v_~size~0_118)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_130| 1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_95|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) (* 2 (mod v_~n~0_117 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0))))) InVars {~x2~0=v_~x2~0_116, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_117, ~x1~0=v_~x1~0_151, ~f~0.offset=v_~f~0.offset_106} OutVars{~x2~0=v_~x2~0_115, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_82|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_95|, ~x1~0=v_~x1~0_150, ~f~0.offset=v_~f~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_36|, ~n~0=v_~n~0_117, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_36|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_90|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:53:54,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_155| v_~f~0.base_90))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_90 (* v_~x2~0_112 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_100| 1) (= (ite (and (<= 0 v_~x1~0_109) (< v_~x1~0_109 v_~size~0_102)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 2 (mod v_~n~0_101 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_102)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= (ite (and (<= 0 v_~x2~0_112) (< v_~x2~0_112 v_~size~0_102)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (select .cse1 (+ v_~f~0.offset_90 (* .cse0 4))) v_~x2~0_111) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|) (= (select .cse1 (+ v_~f~0.offset_90 (* v_~x1~0_109 4))) v_~x1~0_108)))) InVars {~x2~0=v_~x2~0_112, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_101, ~x1~0=v_~x1~0_109, ~f~0.offset=v_~f~0.offset_90} OutVars{~x2~0=v_~x2~0_111, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_56|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_44|, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~x1~0=v_~x1~0_108, ~f~0.offset=v_~f~0.offset_90, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_100|, #memory_int=|v_#memory_int_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_34|, ~n~0=v_~n~0_101, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_34|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_64|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:53:56,536 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:53:56,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4151 [2022-12-06 07:53:56,537 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-06 07:53:56,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 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-06 07:53:56,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:56,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:56,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:53:56,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:56,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1202382836, now seen corresponding path program 1 times [2022-12-06 07:53:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:56,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752179851] [2022-12-06 07:53:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:57,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752179851] [2022-12-06 07:53:57,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752179851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:57,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:57,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:53:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43776700] [2022-12-06 07:53:57,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:57,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:53:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:53:57,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:53:57,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:53:57,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 42 transitions, 276 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:57,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:53:57,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:57,288 INFO L130 PetriNetUnfolder]: 151/272 cut-off events. [2022-12-06 07:53:57,288 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-06 07:53:57,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 272 events. 151/272 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 885 event pairs, 42 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 634. Up to 237 conditions per place. [2022-12-06 07:53:57,290 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2022-12-06 07:53:57,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 425 flow [2022-12-06 07:53:57,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 07:53:57,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-06 07:53:57,291 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 4 states and 46 transitions. [2022-12-06 07:53:57,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 425 flow [2022-12-06 07:53:57,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 349 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:57,293 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 249 flow [2022-12-06 07:53:57,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2022-12-06 07:53:57,294 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 07:53:57,294 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:57,294 INFO L89 Accepts]: Start accepts. Operand has 36 places, 43 transitions, 249 flow [2022-12-06 07:53:57,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:57,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:57,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 43 transitions, 249 flow [2022-12-06 07:53:57,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 43 transitions, 249 flow [2022-12-06 07:53:57,302 INFO L130 PetriNetUnfolder]: 25/88 cut-off events. [2022-12-06 07:53:57,302 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-06 07:53:57,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 88 events. 25/88 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 184. Up to 30 conditions per place. [2022-12-06 07:53:57,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 43 transitions, 249 flow [2022-12-06 07:53:57,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 07:53:57,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:57,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 07:53:57,306 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 43 transitions, 249 flow [2022-12-06 07:53:57,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:57,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:57,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:53:57,306 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1205008728, now seen corresponding path program 1 times [2022-12-06 07:53:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:57,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368320249] [2022-12-06 07:53:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:57,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368320249] [2022-12-06 07:53:57,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368320249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:57,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:57,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367857217] [2022-12-06 07:53:57,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:57,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:53:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:53:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:53:57,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:53:57,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 43 transitions, 249 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:57,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:53:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:57,670 INFO L130 PetriNetUnfolder]: 201/355 cut-off events. [2022-12-06 07:53:57,670 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-12-06 07:53:57,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 355 events. 201/355 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1296 event pairs, 24 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 863. Up to 227 conditions per place. [2022-12-06 07:53:57,672 INFO L137 encePairwiseOnDemand]: 11/29 looper letters, 37 selfloop transitions, 26 changer transitions 1/64 dead transitions. [2022-12-06 07:53:57,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 64 transitions, 464 flow [2022-12-06 07:53:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:53:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:53:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 07:53:57,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35172413793103446 [2022-12-06 07:53:57,673 INFO L175 Difference]: Start difference. First operand has 35 places, 43 transitions, 249 flow. Second operand 5 states and 51 transitions. [2022-12-06 07:53:57,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 64 transitions, 464 flow [2022-12-06 07:53:57,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 442 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 07:53:57,676 INFO L231 Difference]: Finished difference. Result has 38 places, 51 transitions, 369 flow [2022-12-06 07:53:57,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=38, PETRI_TRANSITIONS=51} [2022-12-06 07:53:57,676 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 07:53:57,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:57,676 INFO L89 Accepts]: Start accepts. Operand has 38 places, 51 transitions, 369 flow [2022-12-06 07:53:57,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:57,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:57,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 51 transitions, 369 flow [2022-12-06 07:53:57,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 51 transitions, 369 flow [2022-12-06 07:53:57,685 INFO L130 PetriNetUnfolder]: 30/103 cut-off events. [2022-12-06 07:53:57,685 INFO L131 PetriNetUnfolder]: For 99/104 co-relation queries the response was YES. [2022-12-06 07:53:57,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 103 events. 30/103 cut-off events. For 99/104 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 0 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 226. Up to 36 conditions per place. [2022-12-06 07:53:57,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 51 transitions, 369 flow [2022-12-06 07:53:57,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 07:53:57,687 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:57,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:53:57,687 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 51 transitions, 369 flow [2022-12-06 07:53:57,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:57,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:57,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:53:57,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -7334795, now seen corresponding path program 1 times [2022-12-06 07:53:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:57,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808696760] [2022-12-06 07:53:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:57,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:57,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808696760] [2022-12-06 07:53:57,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808696760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:57,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:57,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:53:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948061775] [2022-12-06 07:53:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:57,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:57,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:53:57,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:53:57,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 51 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:57,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:53:57,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:57,816 INFO L130 PetriNetUnfolder]: 212/374 cut-off events. [2022-12-06 07:53:57,816 INFO L131 PetriNetUnfolder]: For 629/629 co-relation queries the response was YES. [2022-12-06 07:53:57,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 374 events. 212/374 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1381 event pairs, 91 based on Foata normal form. 8/365 useless extension candidates. Maximal degree in co-relation 909. Up to 345 conditions per place. [2022-12-06 07:53:57,818 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 53 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-06 07:53:57,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 520 flow [2022-12-06 07:53:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 07:53:57,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2022-12-06 07:53:57,819 INFO L175 Difference]: Start difference. First operand has 38 places, 51 transitions, 369 flow. Second operand 3 states and 37 transitions. [2022-12-06 07:53:57,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 520 flow [2022-12-06 07:53:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 07:53:57,821 INFO L231 Difference]: Finished difference. Result has 40 places, 52 transitions, 384 flow [2022-12-06 07:53:57,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=40, PETRI_TRANSITIONS=52} [2022-12-06 07:53:57,822 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 07:53:57,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:57,822 INFO L89 Accepts]: Start accepts. Operand has 40 places, 52 transitions, 384 flow [2022-12-06 07:53:57,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:57,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:57,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 52 transitions, 384 flow [2022-12-06 07:53:57,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 52 transitions, 384 flow [2022-12-06 07:53:57,831 INFO L130 PetriNetUnfolder]: 33/113 cut-off events. [2022-12-06 07:53:57,831 INFO L131 PetriNetUnfolder]: For 106/110 co-relation queries the response was YES. [2022-12-06 07:53:57,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 113 events. 33/113 cut-off events. For 106/110 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 278. Up to 42 conditions per place. [2022-12-06 07:53:57,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 52 transitions, 384 flow [2022-12-06 07:53:57,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 07:53:57,832 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:57,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:53:57,833 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 52 transitions, 384 flow [2022-12-06 07:53:57,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:57,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:57,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:53:57,833 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1927888959, now seen corresponding path program 1 times [2022-12-06 07:53:57,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:57,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510937035] [2022-12-06 07:53:57,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:57,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:57,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:57,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510937035] [2022-12-06 07:53:57,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510937035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:57,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:57,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597722474] [2022-12-06 07:53:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:57,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:57,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:57,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:57,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:53:57,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 52 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:57,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:53:57,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:58,029 INFO L130 PetriNetUnfolder]: 206/368 cut-off events. [2022-12-06 07:53:58,029 INFO L131 PetriNetUnfolder]: For 755/755 co-relation queries the response was YES. [2022-12-06 07:53:58,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 368 events. 206/368 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1366 event pairs, 87 based on Foata normal form. 6/357 useless extension candidates. Maximal degree in co-relation 1207. Up to 346 conditions per place. [2022-12-06 07:53:58,031 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 49 selfloop transitions, 4 changer transitions 8/61 dead transitions. [2022-12-06 07:53:58,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 534 flow [2022-12-06 07:53:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 07:53:58,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 07:53:58,032 INFO L175 Difference]: Start difference. First operand has 40 places, 52 transitions, 384 flow. Second operand 4 states and 42 transitions. [2022-12-06 07:53:58,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 534 flow [2022-12-06 07:53:58,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 525 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:53:58,035 INFO L231 Difference]: Finished difference. Result has 43 places, 52 transitions, 391 flow [2022-12-06 07:53:58,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=43, PETRI_TRANSITIONS=52} [2022-12-06 07:53:58,036 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 07:53:58,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:58,036 INFO L89 Accepts]: Start accepts. Operand has 43 places, 52 transitions, 391 flow [2022-12-06 07:53:58,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:58,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:58,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 52 transitions, 391 flow [2022-12-06 07:53:58,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 52 transitions, 391 flow [2022-12-06 07:53:58,048 INFO L130 PetriNetUnfolder]: 39/126 cut-off events. [2022-12-06 07:53:58,048 INFO L131 PetriNetUnfolder]: For 141/145 co-relation queries the response was YES. [2022-12-06 07:53:58,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 126 events. 39/126 cut-off events. For 141/145 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 512 event pairs, 6 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 375. Up to 42 conditions per place. [2022-12-06 07:53:58,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 52 transitions, 391 flow [2022-12-06 07:53:58,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 07:53:58,050 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:58,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:53:58,050 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 52 transitions, 391 flow [2022-12-06 07:53:58,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:58,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:58,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:58,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 07:53:58,051 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1573840658, now seen corresponding path program 1 times [2022-12-06 07:53:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325606511] [2022-12-06 07:53:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325606511] [2022-12-06 07:53:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325606511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:58,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:58,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14600131] [2022-12-06 07:53:58,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:58,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:53:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:58,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:53:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:53:58,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:53:58,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 52 transitions, 391 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:58,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:58,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:53:58,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:58,590 INFO L130 PetriNetUnfolder]: 221/389 cut-off events. [2022-12-06 07:53:58,590 INFO L131 PetriNetUnfolder]: For 759/759 co-relation queries the response was YES. [2022-12-06 07:53:58,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 389 events. 221/389 cut-off events. For 759/759 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1452 event pairs, 53 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1432. Up to 344 conditions per place. [2022-12-06 07:53:58,592 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 50 selfloop transitions, 17 changer transitions 1/68 dead transitions. [2022-12-06 07:53:58,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 598 flow [2022-12-06 07:53:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:53:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:53:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 07:53:58,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33793103448275863 [2022-12-06 07:53:58,593 INFO L175 Difference]: Start difference. First operand has 42 places, 52 transitions, 391 flow. Second operand 5 states and 49 transitions. [2022-12-06 07:53:58,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 598 flow [2022-12-06 07:53:58,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 574 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:58,599 INFO L231 Difference]: Finished difference. Result has 46 places, 56 transitions, 455 flow [2022-12-06 07:53:58,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=46, PETRI_TRANSITIONS=56} [2022-12-06 07:53:58,599 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 07:53:58,599 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:58,599 INFO L89 Accepts]: Start accepts. Operand has 46 places, 56 transitions, 455 flow [2022-12-06 07:53:58,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:58,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:58,600 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 56 transitions, 455 flow [2022-12-06 07:53:58,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 56 transitions, 455 flow [2022-12-06 07:53:58,613 INFO L130 PetriNetUnfolder]: 42/138 cut-off events. [2022-12-06 07:53:58,614 INFO L131 PetriNetUnfolder]: For 181/185 co-relation queries the response was YES. [2022-12-06 07:53:58,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 138 events. 42/138 cut-off events. For 181/185 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 603 event pairs, 7 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 415. Up to 44 conditions per place. [2022-12-06 07:53:58,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 56 transitions, 455 flow [2022-12-06 07:53:58,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 07:53:58,631 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_120| v_~f~0.base_70))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_70 (* v_~x2~0_98 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_79|) (not (= (ite (and (< v_~x2~0_98 v_~size~0_84) (<= 0 v_~x2~0_98)) 1 0) 0)) (< 0 (* 2 (mod v_~n~0_80 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_84)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse1 (+ v_~f~0.offset_70 (* .cse0 4))) v_~x2~0_97)))) InVars {~x2~0=v_~x2~0_98, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, #memory_int=|v_#memory_int_120|, ~n~0=v_~n~0_80, ~f~0.offset=v_~f~0.offset_70} OutVars{~x2~0=v_~x2~0_97, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_35|, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_79|, ~f~0.offset=v_~f~0.offset_70, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|, #memory_int=|v_#memory_int_120|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_25|, ~n~0=v_~n~0_80, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:53:58,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:58,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 386 [2022-12-06 07:53:58,985 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 56 transitions, 465 flow [2022-12-06 07:53:58,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:58,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:58,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:58,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:53:58,985 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash -110380839, now seen corresponding path program 2 times [2022-12-06 07:53:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:58,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564795265] [2022-12-06 07:53:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:59,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:59,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564795265] [2022-12-06 07:53:59,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564795265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:59,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737468661] [2022-12-06 07:53:59,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:53:59,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:59,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:53:59,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:53:59,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:53:59,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:53:59,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:53:59,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:59,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:59,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737468661] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:59,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:59,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 07:53:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035721802] [2022-12-06 07:53:59,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:59,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:53:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:53:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:53:59,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:53:59,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 56 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:59,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:59,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:53:59,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:59,297 INFO L130 PetriNetUnfolder]: 229/411 cut-off events. [2022-12-06 07:53:59,297 INFO L131 PetriNetUnfolder]: For 1062/1062 co-relation queries the response was YES. [2022-12-06 07:53:59,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 411 events. 229/411 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1599 event pairs, 91 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 1346. Up to 362 conditions per place. [2022-12-06 07:53:59,300 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 60 selfloop transitions, 8 changer transitions 2/70 dead transitions. [2022-12-06 07:53:59,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 677 flow [2022-12-06 07:53:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:53:59,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 07:53:59,300 INFO L175 Difference]: Start difference. First operand has 46 places, 56 transitions, 465 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:53:59,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 677 flow [2022-12-06 07:53:59,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 661 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:53:59,304 INFO L231 Difference]: Finished difference. Result has 49 places, 56 transitions, 473 flow [2022-12-06 07:53:59,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=49, PETRI_TRANSITIONS=56} [2022-12-06 07:53:59,304 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 07:53:59,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:59,304 INFO L89 Accepts]: Start accepts. Operand has 49 places, 56 transitions, 473 flow [2022-12-06 07:53:59,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:59,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:59,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 56 transitions, 473 flow [2022-12-06 07:53:59,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 56 transitions, 473 flow [2022-12-06 07:53:59,316 INFO L130 PetriNetUnfolder]: 44/148 cut-off events. [2022-12-06 07:53:59,316 INFO L131 PetriNetUnfolder]: For 227/233 co-relation queries the response was YES. [2022-12-06 07:53:59,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 148 events. 44/148 cut-off events. For 227/233 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 675 event pairs, 7 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 532. Up to 47 conditions per place. [2022-12-06 07:53:59,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 56 transitions, 473 flow [2022-12-06 07:53:59,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 07:53:59,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:53:59,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:59,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-06 07:53:59,465 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 56 transitions, 478 flow [2022-12-06 07:53:59,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:59,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:59,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:59,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:53:59,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 07:53:59,673 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:53:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2131638270, now seen corresponding path program 1 times [2022-12-06 07:53:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:59,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352156153] [2022-12-06 07:53:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:53:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:59,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352156153] [2022-12-06 07:53:59,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352156153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:59,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:59,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236873698] [2022-12-06 07:53:59,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:59,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:59,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:59,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:59,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:53:59,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 56 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:59,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:59,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:53:59,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:59,889 INFO L130 PetriNetUnfolder]: 239/431 cut-off events. [2022-12-06 07:53:59,889 INFO L131 PetriNetUnfolder]: For 1331/1331 co-relation queries the response was YES. [2022-12-06 07:53:59,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 431 events. 239/431 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1716 event pairs, 95 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 1849. Up to 376 conditions per place. [2022-12-06 07:53:59,891 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 61 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2022-12-06 07:53:59,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 692 flow [2022-12-06 07:53:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 07:53:59,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2022-12-06 07:53:59,892 INFO L175 Difference]: Start difference. First operand has 48 places, 56 transitions, 478 flow. Second operand 4 states and 49 transitions. [2022-12-06 07:53:59,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 692 flow [2022-12-06 07:53:59,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 660 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 07:53:59,896 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 483 flow [2022-12-06 07:53:59,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2022-12-06 07:53:59,896 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 07:53:59,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:59,897 INFO L89 Accepts]: Start accepts. Operand has 49 places, 57 transitions, 483 flow [2022-12-06 07:53:59,898 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:59,898 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:59,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 57 transitions, 483 flow [2022-12-06 07:53:59,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 57 transitions, 483 flow [2022-12-06 07:53:59,910 INFO L130 PetriNetUnfolder]: 46/156 cut-off events. [2022-12-06 07:53:59,910 INFO L131 PetriNetUnfolder]: For 315/319 co-relation queries the response was YES. [2022-12-06 07:53:59,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 156 events. 46/156 cut-off events. For 315/319 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 731 event pairs, 7 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 460. Up to 47 conditions per place. [2022-12-06 07:53:59,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 57 transitions, 483 flow [2022-12-06 07:53:59,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 07:53:59,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:00,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:00,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 07:54:00,056 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 492 flow [2022-12-06 07:54:00,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:00,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:00,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:54:00,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2077275410, now seen corresponding path program 1 times [2022-12-06 07:54:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:00,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354281095] [2022-12-06 07:54:00,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:00,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:00,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:00,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354281095] [2022-12-06 07:54:00,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354281095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:00,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:00,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:00,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699915832] [2022-12-06 07:54:00,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:00,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:00,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:00,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:00,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:00,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:54:00,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:00,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:54:00,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:00,258 INFO L130 PetriNetUnfolder]: 267/481 cut-off events. [2022-12-06 07:54:00,258 INFO L131 PetriNetUnfolder]: For 1680/1680 co-relation queries the response was YES. [2022-12-06 07:54:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 481 events. 267/481 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1986 event pairs, 112 based on Foata normal form. 4/468 useless extension candidates. Maximal degree in co-relation 1693. Up to 440 conditions per place. [2022-12-06 07:54:00,261 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 66 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-06 07:54:00,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 736 flow [2022-12-06 07:54:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:54:00,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 07:54:00,262 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 492 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:54:00,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 736 flow [2022-12-06 07:54:00,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 706 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:00,267 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 531 flow [2022-12-06 07:54:00,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2022-12-06 07:54:00,268 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2022-12-06 07:54:00,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:00,268 INFO L89 Accepts]: Start accepts. Operand has 52 places, 61 transitions, 531 flow [2022-12-06 07:54:00,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:00,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:00,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 61 transitions, 531 flow [2022-12-06 07:54:00,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 61 transitions, 531 flow [2022-12-06 07:54:00,282 INFO L130 PetriNetUnfolder]: 50/171 cut-off events. [2022-12-06 07:54:00,282 INFO L131 PetriNetUnfolder]: For 414/420 co-relation queries the response was YES. [2022-12-06 07:54:00,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 171 events. 50/171 cut-off events. For 414/420 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 844 event pairs, 8 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 598. Up to 53 conditions per place. [2022-12-06 07:54:00,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 61 transitions, 531 flow [2022-12-06 07:54:00,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 07:54:00,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:00,602 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:00,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-06 07:54:00,603 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 527 flow [2022-12-06 07:54:00,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:00,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:54:00,603 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:00,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1277806634, now seen corresponding path program 1 times [2022-12-06 07:54:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:00,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584136196] [2022-12-06 07:54:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:00,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584136196] [2022-12-06 07:54:00,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584136196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:00,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:00,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:00,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74839709] [2022-12-06 07:54:00,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:00,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:00,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:00,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:54:00,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:00,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:54:00,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:00,807 INFO L130 PetriNetUnfolder]: 311/562 cut-off events. [2022-12-06 07:54:00,808 INFO L131 PetriNetUnfolder]: For 2704/2704 co-relation queries the response was YES. [2022-12-06 07:54:00,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2889 conditions, 562 events. 311/562 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2419 event pairs, 101 based on Foata normal form. 19/562 useless extension candidates. Maximal degree in co-relation 2313. Up to 258 conditions per place. [2022-12-06 07:54:00,811 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 56 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2022-12-06 07:54:00,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 848 flow [2022-12-06 07:54:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 07:54:00,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 07:54:00,812 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 527 flow. Second operand 4 states and 57 transitions. [2022-12-06 07:54:00,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 848 flow [2022-12-06 07:54:00,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 822 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:00,820 INFO L231 Difference]: Finished difference. Result has 54 places, 62 transitions, 611 flow [2022-12-06 07:54:00,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=611, PETRI_PLACES=54, PETRI_TRANSITIONS=62} [2022-12-06 07:54:00,821 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 07:54:00,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:00,821 INFO L89 Accepts]: Start accepts. Operand has 54 places, 62 transitions, 611 flow [2022-12-06 07:54:00,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:00,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:00,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 62 transitions, 611 flow [2022-12-06 07:54:00,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 62 transitions, 611 flow [2022-12-06 07:54:00,852 INFO L130 PetriNetUnfolder]: 57/195 cut-off events. [2022-12-06 07:54:00,853 INFO L131 PetriNetUnfolder]: For 575/588 co-relation queries the response was YES. [2022-12-06 07:54:00,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 195 events. 57/195 cut-off events. For 575/588 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1009 event pairs, 10 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 708. Up to 66 conditions per place. [2022-12-06 07:54:00,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 62 transitions, 611 flow [2022-12-06 07:54:00,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 07:54:00,855 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:00,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 07:54:00,856 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 62 transitions, 611 flow [2022-12-06 07:54:00,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:00,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:00,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:54:00,856 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash -157582306, now seen corresponding path program 1 times [2022-12-06 07:54:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:00,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606335200] [2022-12-06 07:54:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:00,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:00,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606335200] [2022-12-06 07:54:00,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606335200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:00,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:00,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932293198] [2022-12-06 07:54:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:00,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:54:00,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 62 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:00,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:54:00,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:01,055 INFO L130 PetriNetUnfolder]: 317/572 cut-off events. [2022-12-06 07:54:01,055 INFO L131 PetriNetUnfolder]: For 2937/2937 co-relation queries the response was YES. [2022-12-06 07:54:01,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 572 events. 317/572 cut-off events. For 2937/2937 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2452 event pairs, 148 based on Foata normal form. 4/561 useless extension candidates. Maximal degree in co-relation 2572. Up to 523 conditions per place. [2022-12-06 07:54:01,058 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 71 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2022-12-06 07:54:01,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 875 flow [2022-12-06 07:54:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 07:54:01,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 07:54:01,060 INFO L175 Difference]: Start difference. First operand has 54 places, 62 transitions, 611 flow. Second operand 4 states and 49 transitions. [2022-12-06 07:54:01,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 875 flow [2022-12-06 07:54:01,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 859 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-06 07:54:01,070 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 636 flow [2022-12-06 07:54:01,070 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=636, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2022-12-06 07:54:01,070 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 07:54:01,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,070 INFO L89 Accepts]: Start accepts. Operand has 58 places, 63 transitions, 636 flow [2022-12-06 07:54:01,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,071 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 63 transitions, 636 flow [2022-12-06 07:54:01,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 63 transitions, 636 flow [2022-12-06 07:54:01,087 INFO L130 PetriNetUnfolder]: 58/197 cut-off events. [2022-12-06 07:54:01,088 INFO L131 PetriNetUnfolder]: For 760/774 co-relation queries the response was YES. [2022-12-06 07:54:01,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 197 events. 58/197 cut-off events. For 760/774 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1023 event pairs, 10 based on Foata normal form. 2/186 useless extension candidates. Maximal degree in co-relation 750. Up to 68 conditions per place. [2022-12-06 07:54:01,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 63 transitions, 636 flow [2022-12-06 07:54:01,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 07:54:01,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_203| v_~f~0.base_126))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_126 (* v_~x2~0_137 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_126 (* 4 .cse3))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_126 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= (select .cse0 (+ v_~f~0.offset_126 (* .cse1 4))) v_~x2~0_135) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_135 2147483648) 2)) (not (= 0 (ite (and (< v_~x2~0_137 v_~size~0_136) (<= 0 v_~x2~0_137)) 1 0))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (< .cse2 v_~size~0_136) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_136)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_135, ~f~0.offset=v_~f~0.offset_126} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_126, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_203|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_135, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [631] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_209| v_~f~0.base_132))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_132 (* v_~x2~0_151 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_132 (* v_~x1~0_203 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (not (= (ite (and (< v_~x1~0_203 v_~size~0_142) (<= 0 v_~x1~0_203)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_142) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= |v_thread2Thread1of1ForFork1_~i~1#1_116| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_117|)) (= v_~x2~0_150 (select .cse1 (+ (* .cse0 4) v_~f~0.offset_132))) (= |v_thread1Thread1of1ForFork0_~i~0#1_164| 2) (not (= (ite (and (<= 0 v_~x2~0_151) (< v_~x2~0_151 v_~size~0_142)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_142)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= v_~x1~0_202 (select .cse1 (+ v_~f~0.offset_132 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_117| 4294967296) (* 2 (mod v_~n~0_141 2147483648)))))) InVars {~x2~0=v_~x2~0_151, ~size~0=v_~size~0_142, ~f~0.base=v_~f~0.base_132, #memory_int=|v_#memory_int_209|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_117|, ~n~0=v_~n~0_141, ~x1~0=v_~x1~0_203, ~f~0.offset=v_~f~0.offset_132} OutVars{~x2~0=v_~x2~0_150, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_112|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_142, ~f~0.base=v_~f~0.base_132, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_116|, ~x1~0=v_~x1~0_202, ~f~0.offset=v_~f~0.offset_132, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_164|, #memory_int=|v_#memory_int_209|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ~n~0=v_~n~0_141, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_53|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_120|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:01,519 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:01,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 450 [2022-12-06 07:54:01,520 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 641 flow [2022-12-06 07:54:01,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:01,520 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:01,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:54:01,520 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -616105078, now seen corresponding path program 2 times [2022-12-06 07:54:01,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:01,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213638622] [2022-12-06 07:54:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:01,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213638622] [2022-12-06 07:54:01,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213638622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:01,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:01,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707655308] [2022-12-06 07:54:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:01,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:01,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:01,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:54:01,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 641 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:01,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:54:01,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:01,722 INFO L130 PetriNetUnfolder]: 302/537 cut-off events. [2022-12-06 07:54:01,722 INFO L131 PetriNetUnfolder]: For 3290/3290 co-relation queries the response was YES. [2022-12-06 07:54:01,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 537 events. 302/537 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2218 event pairs, 142 based on Foata normal form. 6/528 useless extension candidates. Maximal degree in co-relation 2351. Up to 512 conditions per place. [2022-12-06 07:54:01,725 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 57 selfloop transitions, 7 changer transitions 8/72 dead transitions. [2022-12-06 07:54:01,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 837 flow [2022-12-06 07:54:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:54:01,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-06 07:54:01,726 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 641 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:54:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 837 flow [2022-12-06 07:54:01,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 801 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:01,732 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 630 flow [2022-12-06 07:54:01,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=630, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2022-12-06 07:54:01,732 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 39 predicate places. [2022-12-06 07:54:01,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,733 INFO L89 Accepts]: Start accepts. Operand has 60 places, 63 transitions, 630 flow [2022-12-06 07:54:01,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 630 flow [2022-12-06 07:54:01,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 630 flow [2022-12-06 07:54:01,754 INFO L130 PetriNetUnfolder]: 55/176 cut-off events. [2022-12-06 07:54:01,755 INFO L131 PetriNetUnfolder]: For 786/815 co-relation queries the response was YES. [2022-12-06 07:54:01,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 176 events. 55/176 cut-off events. For 786/815 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 850 event pairs, 9 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 726. Up to 65 conditions per place. [2022-12-06 07:54:01,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 630 flow [2022-12-06 07:54:01,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 07:54:01,756 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:01,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 07:54:01,758 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 630 flow [2022-12-06 07:54:01,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:01,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:01,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:01,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:54:01,758 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:01,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:01,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1235189396, now seen corresponding path program 1 times [2022-12-06 07:54:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:01,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441197712] [2022-12-06 07:54:01,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:01,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441197712] [2022-12-06 07:54:01,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441197712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:01,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195774311] [2022-12-06 07:54:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:01,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:01,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:01,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:54:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 07:54:02,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:02,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:02,027 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 14 treesize of output 16 [2022-12-06 07:54:02,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:02,050 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 07:54:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:02,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:02,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-06 07:54:02,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:02,122 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-06 07:54:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:02,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195774311] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:02,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:02,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 07:54:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382198299] [2022-12-06 07:54:02,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:02,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:54:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:54:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:54:02,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:54:02,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 630 flow. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:02,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:54:02,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:02,494 INFO L130 PetriNetUnfolder]: 364/645 cut-off events. [2022-12-06 07:54:02,494 INFO L131 PetriNetUnfolder]: For 3708/3708 co-relation queries the response was YES. [2022-12-06 07:54:02,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 645 events. 364/645 cut-off events. For 3708/3708 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2814 event pairs, 43 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 3236. Up to 370 conditions per place. [2022-12-06 07:54:02,501 INFO L137 encePairwiseOnDemand]: 12/35 looper letters, 63 selfloop transitions, 47 changer transitions 1/111 dead transitions. [2022-12-06 07:54:02,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 1205 flow [2022-12-06 07:54:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2022-12-06 07:54:02,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27936507936507937 [2022-12-06 07:54:02,502 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 630 flow. Second operand 9 states and 88 transitions. [2022-12-06 07:54:02,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 1205 flow [2022-12-06 07:54:02,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 1149 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:02,513 INFO L231 Difference]: Finished difference. Result has 67 places, 78 transitions, 923 flow [2022-12-06 07:54:02,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=923, PETRI_PLACES=67, PETRI_TRANSITIONS=78} [2022-12-06 07:54:02,513 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-06 07:54:02,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:02,513 INFO L89 Accepts]: Start accepts. Operand has 67 places, 78 transitions, 923 flow [2022-12-06 07:54:02,514 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:02,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:02,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 78 transitions, 923 flow [2022-12-06 07:54:02,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 78 transitions, 923 flow [2022-12-06 07:54:02,532 INFO L130 PetriNetUnfolder]: 64/214 cut-off events. [2022-12-06 07:54:02,532 INFO L131 PetriNetUnfolder]: For 935/964 co-relation queries the response was YES. [2022-12-06 07:54:02,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 214 events. 64/214 cut-off events. For 935/964 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1132 event pairs, 11 based on Foata normal form. 3/204 useless extension candidates. Maximal degree in co-relation 945. Up to 75 conditions per place. [2022-12-06 07:54:02,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 78 transitions, 923 flow [2022-12-06 07:54:02,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 07:54:02,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_106| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (= (ite (and (<= 0 v_~x1~0_119) (< v_~x1~0_119 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_52| |v_#pthreadsForks_64|) (= (store |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_52|)) |v_#memory_int_159|) (= v_~x1~0_118 (select (select |v_#memory_int_160| v_~f~0.base_94) (+ v_~f~0.offset_94 (* v_~x1~0_119 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_106| 4294967295) 4294967296) (* 2 (mod v_~n~0_105 2147483648))) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|)) InVars {#pthreadsForks=|v_#pthreadsForks_64|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, #memory_int=|v_#memory_int_160|, ~n~0=v_~n~0_105, ~x1~0=v_~x1~0_119, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ~f~0.offset=v_~f~0.offset_94} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, ~x1~0=v_~x1~0_118, ~f~0.offset=v_~f~0.offset_94, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_52|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_41|, #pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_55|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_159|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, ~n~0=v_~n~0_105, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:02,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:02,821 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:02,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 309 [2022-12-06 07:54:02,822 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 78 transitions, 943 flow [2022-12-06 07:54:02,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:02,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:02,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:02,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 07:54:03,022 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,SelfDestructingSolverStorable21 [2022-12-06 07:54:03,023 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash -49574454, now seen corresponding path program 2 times [2022-12-06 07:54:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:03,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559559809] [2022-12-06 07:54:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:03,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:03,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559559809] [2022-12-06 07:54:03,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559559809] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:03,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412175597] [2022-12-06 07:54:03,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:54:03,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:03,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:03,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:54:03,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:54:03,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:54:03,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 07:54:03,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:03,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:03,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:54:03,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:03,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:03,617 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 14 treesize of output 16 [2022-12-06 07:54:03,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:03,680 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 26 [2022-12-06 07:54:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:03,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:03,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412175597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:03,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:03,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:54:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721752352] [2022-12-06 07:54:03,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:03,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:54:03,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:03,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:54:03,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:54:03,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:54:03,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 78 transitions, 943 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:03,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:03,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:54:03,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:04,197 INFO L130 PetriNetUnfolder]: 446/793 cut-off events. [2022-12-06 07:54:04,197 INFO L131 PetriNetUnfolder]: For 5201/5201 co-relation queries the response was YES. [2022-12-06 07:54:04,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4631 conditions, 793 events. 446/793 cut-off events. For 5201/5201 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3695 event pairs, 120 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 4248. Up to 641 conditions per place. [2022-12-06 07:54:04,203 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 90 selfloop transitions, 37 changer transitions 1/128 dead transitions. [2022-12-06 07:54:04,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 1582 flow [2022-12-06 07:54:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:54:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:54:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-12-06 07:54:04,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23783783783783785 [2022-12-06 07:54:04,204 INFO L175 Difference]: Start difference. First operand has 67 places, 78 transitions, 943 flow. Second operand 10 states and 88 transitions. [2022-12-06 07:54:04,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 1582 flow [2022-12-06 07:54:04,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 128 transitions, 1479 flow, removed 35 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:04,218 INFO L231 Difference]: Finished difference. Result has 78 places, 97 transitions, 1215 flow [2022-12-06 07:54:04,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1215, PETRI_PLACES=78, PETRI_TRANSITIONS=97} [2022-12-06 07:54:04,219 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 57 predicate places. [2022-12-06 07:54:04,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:04,219 INFO L89 Accepts]: Start accepts. Operand has 78 places, 97 transitions, 1215 flow [2022-12-06 07:54:04,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:04,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:04,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 97 transitions, 1215 flow [2022-12-06 07:54:04,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 97 transitions, 1215 flow [2022-12-06 07:54:04,241 INFO L130 PetriNetUnfolder]: 78/264 cut-off events. [2022-12-06 07:54:04,241 INFO L131 PetriNetUnfolder]: For 1178/1217 co-relation queries the response was YES. [2022-12-06 07:54:04,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 264 events. 78/264 cut-off events. For 1178/1217 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1520 event pairs, 14 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 1209. Up to 93 conditions per place. [2022-12-06 07:54:04,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 97 transitions, 1215 flow [2022-12-06 07:54:04,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 07:54:04,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_203| v_~f~0.base_126))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_126 (* v_~x2~0_137 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_126 (* 4 .cse3))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_126 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= (select .cse0 (+ v_~f~0.offset_126 (* .cse1 4))) v_~x2~0_135) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_135 2147483648) 2)) (not (= 0 (ite (and (< v_~x2~0_137 v_~size~0_136) (<= 0 v_~x2~0_137)) 1 0))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (< .cse2 v_~size~0_136) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_136)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_135, ~f~0.offset=v_~f~0.offset_126} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_126, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_203|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_135, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [633] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_211| v_~f~0.base_134))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_134 (* v_~x1~0_208 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_134 (* .cse2 4))))) (and (= v_~x1~0_206 (select .cse0 (+ v_~f~0.offset_134 (* 4 .cse1)))) (not (= (ite (and (<= 0 v_~x1~0_208) (< v_~x1~0_208 v_~size~0_144)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_166| 3) (< 2 (* (mod v_~n~0_143 2147483648) 2)) (= (ite (and (< .cse1 v_~size~0_144) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_144)) 1 0) 0)))))) InVars {~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_134, #memory_int=|v_#memory_int_211|, ~n~0=v_~n~0_143, ~x1~0=v_~x1~0_208, ~f~0.offset=v_~f~0.offset_134} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|, ~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_134, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112|, #memory_int=|v_#memory_int_211|, ~n~0=v_~n~0_143, ~x1~0=v_~x1~0_206, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_122|, ~f~0.offset=v_~f~0.offset_134} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:04,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_213| v_~f~0.base_136))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_136 (* v_~x2~0_156 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_136 (* 4 .cse6))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_136 (* .cse2 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_136 (* 4 .cse5))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_136 (* v_~x1~0_213 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_136 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (not (= (ite (and (<= 0 v_~x2~0_156) (< v_~x2~0_156 v_~size~0_146)) 1 0) 0)) (= v_~x1~0_212 (select .cse0 (+ v_~f~0.offset_136 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x1~0_213) (< v_~x1~0_213 v_~size~0_146)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_146)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_170| 2) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_120|) 4294967296) (* 2 (mod v_~n~0_145 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_146) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_146)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_136 (* .cse4 4))) v_~x2~0_154) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_146)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= 0 (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_146)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_146)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116| 0))))))))) InVars {~x2~0=v_~x2~0_156, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_136, #memory_int=|v_#memory_int_213|, ~n~0=v_~n~0_145, ~x1~0=v_~x1~0_213, ~f~0.offset=v_~f~0.offset_136} OutVars{~x2~0=v_~x2~0_154, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_118|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_136, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_136, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_170|, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_145, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_126|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:05,282 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:05,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1064 [2022-12-06 07:54:05,283 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 97 transitions, 1239 flow [2022-12-06 07:54:05,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:05,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:05,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:05,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:05,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:05,487 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -712213236, now seen corresponding path program 1 times [2022-12-06 07:54:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:05,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545242654] [2022-12-06 07:54:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:05,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:05,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545242654] [2022-12-06 07:54:05,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545242654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:05,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:05,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786805987] [2022-12-06 07:54:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:54:05,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:54:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:54:05,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:54:05,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 97 transitions, 1239 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:05,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:05,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:54:05,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:06,145 INFO L130 PetriNetUnfolder]: 508/902 cut-off events. [2022-12-06 07:54:06,145 INFO L131 PetriNetUnfolder]: For 6414/6414 co-relation queries the response was YES. [2022-12-06 07:54:06,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5382 conditions, 902 events. 508/902 cut-off events. For 6414/6414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4362 event pairs, 129 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 4721. Up to 770 conditions per place. [2022-12-06 07:54:06,152 INFO L137 encePairwiseOnDemand]: 13/39 looper letters, 84 selfloop transitions, 36 changer transitions 2/122 dead transitions. [2022-12-06 07:54:06,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 1708 flow [2022-12-06 07:54:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 07:54:06,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3282051282051282 [2022-12-06 07:54:06,154 INFO L175 Difference]: Start difference. First operand has 78 places, 97 transitions, 1239 flow. Second operand 5 states and 64 transitions. [2022-12-06 07:54:06,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 1708 flow [2022-12-06 07:54:06,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 1576 flow, removed 60 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:06,170 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1377 flow [2022-12-06 07:54:06,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1377, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2022-12-06 07:54:06,170 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 07:54:06,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:06,170 INFO L89 Accepts]: Start accepts. Operand has 83 places, 106 transitions, 1377 flow [2022-12-06 07:54:06,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:06,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:06,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 106 transitions, 1377 flow [2022-12-06 07:54:06,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 106 transitions, 1377 flow [2022-12-06 07:54:06,201 INFO L130 PetriNetUnfolder]: 87/297 cut-off events. [2022-12-06 07:54:06,201 INFO L131 PetriNetUnfolder]: For 1543/1592 co-relation queries the response was YES. [2022-12-06 07:54:06,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 297 events. 87/297 cut-off events. For 1543/1592 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1803 event pairs, 17 based on Foata normal form. 4/281 useless extension candidates. Maximal degree in co-relation 1454. Up to 81 conditions per place. [2022-12-06 07:54:06,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 106 transitions, 1377 flow [2022-12-06 07:54:06,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 07:54:06,204 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:06,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:54:06,204 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 1377 flow [2022-12-06 07:54:06,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:06,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:06,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:06,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:54:06,206 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2049019939, now seen corresponding path program 1 times [2022-12-06 07:54:06,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:06,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779029251] [2022-12-06 07:54:06,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:06,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:07,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:07,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779029251] [2022-12-06 07:54:07,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779029251] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:07,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745880052] [2022-12-06 07:54:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:07,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:07,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:07,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:54:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:07,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:54:07,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:07,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:07,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 07:54:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:07,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:08,103 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 07:54:08,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 07:54:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:09,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745880052] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:09,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:09,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 07:54:09,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717530096] [2022-12-06 07:54:09,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:09,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:54:09,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:09,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:54:09,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:54:09,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:54:09,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 1377 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:09,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:09,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:54:09,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:09,358 INFO L130 PetriNetUnfolder]: 566/1003 cut-off events. [2022-12-06 07:54:09,358 INFO L131 PetriNetUnfolder]: For 7741/7741 co-relation queries the response was YES. [2022-12-06 07:54:09,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 1003 events. 566/1003 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4974 event pairs, 193 based on Foata normal form. 2/997 useless extension candidates. Maximal degree in co-relation 5769. Up to 872 conditions per place. [2022-12-06 07:54:09,365 INFO L137 encePairwiseOnDemand]: 15/38 looper letters, 92 selfloop transitions, 39 changer transitions 1/132 dead transitions. [2022-12-06 07:54:09,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 132 transitions, 1862 flow [2022-12-06 07:54:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:54:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:54:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-06 07:54:09,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22932330827067668 [2022-12-06 07:54:09,366 INFO L175 Difference]: Start difference. First operand has 82 places, 106 transitions, 1377 flow. Second operand 7 states and 61 transitions. [2022-12-06 07:54:09,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 132 transitions, 1862 flow [2022-12-06 07:54:09,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 132 transitions, 1831 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:09,384 INFO L231 Difference]: Finished difference. Result has 88 places, 118 transitions, 1649 flow [2022-12-06 07:54:09,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1649, PETRI_PLACES=88, PETRI_TRANSITIONS=118} [2022-12-06 07:54:09,385 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 67 predicate places. [2022-12-06 07:54:09,385 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:09,385 INFO L89 Accepts]: Start accepts. Operand has 88 places, 118 transitions, 1649 flow [2022-12-06 07:54:09,386 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:09,386 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:09,386 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 118 transitions, 1649 flow [2022-12-06 07:54:09,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 118 transitions, 1649 flow [2022-12-06 07:54:09,413 INFO L130 PetriNetUnfolder]: 95/327 cut-off events. [2022-12-06 07:54:09,413 INFO L131 PetriNetUnfolder]: For 1882/1944 co-relation queries the response was YES. [2022-12-06 07:54:09,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 327 events. 95/327 cut-off events. For 1882/1944 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2076 event pairs, 20 based on Foata normal form. 4/308 useless extension candidates. Maximal degree in co-relation 1561. Up to 92 conditions per place. [2022-12-06 07:54:09,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 118 transitions, 1649 flow [2022-12-06 07:54:09,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 07:54:09,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_228| v_~f~0.base_144))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_175 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_235 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_144 (* .cse5 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_144 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|) (= |v_thread2Thread1of1ForFork1_~i~1#1_136| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x1~0_235 v_~size~0_154) (<= 0 v_~x1~0_235)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_175 v_~size~0_154) (<= 0 v_~x2~0_175)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x2~0_174) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130| 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_154) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< .cse3 v_~size~0_154) (<= 0 .cse3)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse4 4))) v_~x1~0_234) (= |v_thread1Thread1of1ForFork0_~i~0#1_186| 3) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_154)) 1 0) 0)) (= (ite (and (< .cse4 v_~size~0_154) (<= 0 .cse4)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_154)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (< 2 (* (mod v_~n~0_153 2147483648) 2))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_154, ~f~0.base=v_~f~0.base_144, #memory_int=|v_#memory_int_228|, ~n~0=v_~n~0_153, ~x1~0=v_~x1~0_235, ~f~0.offset=v_~f~0.offset_144} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_132|, ~x2~0=v_~x2~0_174, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_79|, ~size~0=v_~size~0_154, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_136|, ~x1~0=v_~x1~0_234, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_186|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|, #memory_int=|v_#memory_int_228|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_69|, ~n~0=v_~n~0_153, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_140|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_69|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:11,203 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:11,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1819 [2022-12-06 07:54:11,204 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 118 transitions, 1673 flow [2022-12-06 07:54:11,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:11,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:11,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:11,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:11,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:11,409 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1451375644, now seen corresponding path program 1 times [2022-12-06 07:54:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:11,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378397768] [2022-12-06 07:54:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:11,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378397768] [2022-12-06 07:54:11,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378397768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:11,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:11,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157892483] [2022-12-06 07:54:11,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:11,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:11,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:11,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:11,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:54:11,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 118 transitions, 1673 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:11,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:11,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:54:11,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:11,721 INFO L130 PetriNetUnfolder]: 698/1241 cut-off events. [2022-12-06 07:54:11,722 INFO L131 PetriNetUnfolder]: For 10311/10311 co-relation queries the response was YES. [2022-12-06 07:54:11,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 1241 events. 698/1241 cut-off events. For 10311/10311 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6466 event pairs, 310 based on Foata normal form. 8/1241 useless extension candidates. Maximal degree in co-relation 7072. Up to 960 conditions per place. [2022-12-06 07:54:11,742 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 142 selfloop transitions, 14 changer transitions 0/156 dead transitions. [2022-12-06 07:54:11,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 156 transitions, 2422 flow [2022-12-06 07:54:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:54:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:54:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 07:54:11,743 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 07:54:11,743 INFO L175 Difference]: Start difference. First operand has 88 places, 118 transitions, 1673 flow. Second operand 6 states and 70 transitions. [2022-12-06 07:54:11,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 156 transitions, 2422 flow [2022-12-06 07:54:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 156 transitions, 2346 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:11,768 INFO L231 Difference]: Finished difference. Result has 94 places, 125 transitions, 1776 flow [2022-12-06 07:54:11,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1776, PETRI_PLACES=94, PETRI_TRANSITIONS=125} [2022-12-06 07:54:11,769 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 07:54:11,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:11,769 INFO L89 Accepts]: Start accepts. Operand has 94 places, 125 transitions, 1776 flow [2022-12-06 07:54:11,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:11,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:11,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 125 transitions, 1776 flow [2022-12-06 07:54:11,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 125 transitions, 1776 flow [2022-12-06 07:54:11,803 INFO L130 PetriNetUnfolder]: 119/404 cut-off events. [2022-12-06 07:54:11,803 INFO L131 PetriNetUnfolder]: For 3327/3412 co-relation queries the response was YES. [2022-12-06 07:54:11,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2323 conditions, 404 events. 119/404 cut-off events. For 3327/3412 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2698 event pairs, 27 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 2115. Up to 117 conditions per place. [2022-12-06 07:54:11,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 125 transitions, 1776 flow [2022-12-06 07:54:11,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 07:54:11,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:12,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:12,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:12,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-06 07:54:12,151 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 125 transitions, 1772 flow [2022-12-06 07:54:12,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:12,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:12,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:12,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:54:12,152 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1288017019, now seen corresponding path program 1 times [2022-12-06 07:54:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:12,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916796791] [2022-12-06 07:54:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:12,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916796791] [2022-12-06 07:54:12,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916796791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:12,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370780132] [2022-12-06 07:54:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:12,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:12,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:12,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:54:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:12,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 07:54:12,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:12,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:12,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:54:12,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:12,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:12,480 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 07:54:12,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 64 [2022-12-06 07:54:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:12,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:14,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370780132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:14,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:14,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 07:54:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779797563] [2022-12-06 07:54:14,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:14,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:54:14,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:54:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=115, Unknown=4, NotChecked=0, Total=156 [2022-12-06 07:54:14,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:54:14,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 125 transitions, 1772 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:14,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:14,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:54:14,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:27,457 WARN L233 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:54:35,810 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:54:36,727 INFO L130 PetriNetUnfolder]: 774/1381 cut-off events. [2022-12-06 07:54:36,727 INFO L131 PetriNetUnfolder]: For 14306/14306 co-relation queries the response was YES. [2022-12-06 07:54:36,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9042 conditions, 1381 events. 774/1381 cut-off events. For 14306/14306 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7424 event pairs, 154 based on Foata normal form. 14/1387 useless extension candidates. Maximal degree in co-relation 8386. Up to 1068 conditions per place. [2022-12-06 07:54:36,737 INFO L137 encePairwiseOnDemand]: 13/42 looper letters, 113 selfloop transitions, 60 changer transitions 9/182 dead transitions. [2022-12-06 07:54:36,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 182 transitions, 2630 flow [2022-12-06 07:54:36,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:54:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:54:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 116 transitions. [2022-12-06 07:54:36,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17261904761904762 [2022-12-06 07:54:36,739 INFO L175 Difference]: Start difference. First operand has 95 places, 125 transitions, 1772 flow. Second operand 16 states and 116 transitions. [2022-12-06 07:54:36,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 182 transitions, 2630 flow [2022-12-06 07:54:36,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 182 transitions, 2582 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-06 07:54:36,773 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 2036 flow [2022-12-06 07:54:36,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2036, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2022-12-06 07:54:36,774 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 07:54:36,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:36,774 INFO L89 Accepts]: Start accepts. Operand has 113 places, 131 transitions, 2036 flow [2022-12-06 07:54:36,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:36,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:36,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 131 transitions, 2036 flow [2022-12-06 07:54:36,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 131 transitions, 2036 flow [2022-12-06 07:54:36,813 INFO L130 PetriNetUnfolder]: 128/434 cut-off events. [2022-12-06 07:54:36,814 INFO L131 PetriNetUnfolder]: For 4963/5053 co-relation queries the response was YES. [2022-12-06 07:54:36,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 434 events. 128/434 cut-off events. For 4963/5053 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2948 event pairs, 29 based on Foata normal form. 4/405 useless extension candidates. Maximal degree in co-relation 2533. Up to 126 conditions per place. [2022-12-06 07:54:36,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 131 transitions, 2036 flow [2022-12-06 07:54:36,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 07:54:36,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:38,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_230| v_~f~0.base_146))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_146 (* v_~x2~0_179 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_146 (* 4 .cse6))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_146 (* .cse7 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_146 (* .cse0 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_146 (* v_~x1~0_240 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_146 (* .cse5 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_146 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_156)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_146 (* .cse2 4))) v_~x2~0_178) (not (= (ite (and (< v_~x1~0_240 v_~size~0_156) (<= 0 v_~x1~0_240)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_156)) 1 0) 0)) (= v_~x1~0_238 (select .cse1 (+ v_~f~0.offset_146 (* .cse4 4)))) (not (= (ite (and (< .cse5 v_~size~0_156) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_156)) 1 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_138|) (= |v_thread1Thread1of1ForFork0_~i~0#1_188| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_156)) 1 0))) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_156)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_138|) 4294967296) (* (mod v_~n~0_155 2147483648) 2)) (not (= (ite (and (<= 0 v_~x2~0_179) (< v_~x2~0_179 v_~size~0_156)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_156)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_179, ~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_146, #memory_int=|v_#memory_int_230|, ~n~0=v_~n~0_155, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_146} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_134|, ~x2~0=v_~x2~0_178, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_146, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_85|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_138|, ~x1~0=v_~x1~0_238, ~f~0.offset=v_~f~0.offset_146, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_188|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|, #memory_int=|v_#memory_int_230|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_71|, ~n~0=v_~n~0_155, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_142|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:38,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_250| v_~f~0.base_160))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_160 (* v_~x2~0_203 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_160 (* v_~x1~0_274 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_160 (* .cse4 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_160 (* .cse5 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_160 (* .cse2 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_168)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_168)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread2Thread1of1ForFork1_~i~1#1_156| 4) (not (= (ite (and (< .cse2 v_~size~0_168) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_202 (select .cse3 (+ v_~f~0.offset_160 (* .cse1 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_212| 4294967295) 4294967296) (* (mod v_~n~0_167 2147483648) 2)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_168)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_274 v_~size~0_168) (<= 0 v_~x1~0_274)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_212| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152| 0)) (not (= (ite (and (< .cse5 v_~size~0_168) (<= 0 .cse5)) 1 0) 0)) (= v_~x1~0_272 (select .cse3 (+ v_~f~0.offset_160 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_203) (< v_~x2~0_203 v_~size~0_168)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_168)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_203, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_160, #memory_int=|v_#memory_int_250|, ~n~0=v_~n~0_167, ~x1~0=v_~x1~0_274, ~f~0.offset=v_~f~0.offset_160} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_154|, ~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_99|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_156|, ~x1~0=v_~x1~0_272, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_212|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|, #memory_int=|v_#memory_int_250|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_85|, ~n~0=v_~n~0_167, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_162|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_85|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:39,284 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:54:39,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2510 [2022-12-06 07:54:39,284 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 129 transitions, 2081 flow [2022-12-06 07:54:39,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:39,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:39,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:39,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:54:39,489 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,SelfDestructingSolverStorable26 [2022-12-06 07:54:39,489 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:39,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash 149813494, now seen corresponding path program 1 times [2022-12-06 07:54:39,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:39,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847673093] [2022-12-06 07:54:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847673093] [2022-12-06 07:54:39,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847673093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:39,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:39,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589582139] [2022-12-06 07:54:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:39,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:39,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:39,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:39,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:54:39,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 129 transitions, 2081 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:39,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:39,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:54:39,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:39,849 INFO L130 PetriNetUnfolder]: 770/1422 cut-off events. [2022-12-06 07:54:39,850 INFO L131 PetriNetUnfolder]: For 19065/19065 co-relation queries the response was YES. [2022-12-06 07:54:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9797 conditions, 1422 events. 770/1422 cut-off events. For 19065/19065 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8165 event pairs, 292 based on Foata normal form. 24/1438 useless extension candidates. Maximal degree in co-relation 9098. Up to 1052 conditions per place. [2022-12-06 07:54:39,858 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 125 selfloop transitions, 31 changer transitions 7/163 dead transitions. [2022-12-06 07:54:39,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 163 transitions, 2763 flow [2022-12-06 07:54:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 07:54:39,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32272727272727275 [2022-12-06 07:54:39,859 INFO L175 Difference]: Start difference. First operand has 108 places, 129 transitions, 2081 flow. Second operand 5 states and 71 transitions. [2022-12-06 07:54:39,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 163 transitions, 2763 flow [2022-12-06 07:54:39,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 163 transitions, 2498 flow, removed 114 selfloop flow, removed 6 redundant places. [2022-12-06 07:54:39,897 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1977 flow [2022-12-06 07:54:39,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1977, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 07:54:39,901 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 07:54:39,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:39,901 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1977 flow [2022-12-06 07:54:39,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:39,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:39,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1977 flow [2022-12-06 07:54:39,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1977 flow [2022-12-06 07:54:39,940 INFO L130 PetriNetUnfolder]: 130/451 cut-off events. [2022-12-06 07:54:39,940 INFO L131 PetriNetUnfolder]: For 5204/5258 co-relation queries the response was YES. [2022-12-06 07:54:39,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 451 events. 130/451 cut-off events. For 5204/5258 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3155 event pairs, 30 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2662. Up to 137 conditions per place. [2022-12-06 07:54:39,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1977 flow [2022-12-06 07:54:39,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 07:54:40,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_233| v_~f~0.base_148))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_148 (* v_~x2~0_186 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_148 (* 4 .cse4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_148 (* .cse6 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_148 (* .cse5 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_148 (* v_~x1~0_249 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_148 (* .cse7 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_148 (* .cse2 4))))) (and (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_142|) 4294967296) (* (mod v_~n~0_157 2147483648) 2)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_142|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (= (select .cse0 (+ v_~f~0.offset_148 (* 4 .cse1))) v_~x2~0_184) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_158)) 1 0) 0)) (= v_~x1~0_248 (select .cse0 (+ v_~f~0.offset_148 (* .cse3 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| (ite (and (< .cse3 v_~size~0_158) (<= 0 .cse3)) 1 0)) (not (= (ite (and (< .cse4 v_~size~0_158) (<= 0 .cse4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| 3) (not (= (ite (and (< .cse5 v_~size~0_158) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= (ite (and (< v_~x1~0_249 v_~size~0_158) (<= 0 v_~x1~0_249)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_158)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_158)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_186) (< v_~x2~0_186 v_~size~0_158)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_186, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_148, #memory_int=|v_#memory_int_233|, ~n~0=v_~n~0_157, ~x1~0=v_~x1~0_249, ~f~0.offset=v_~f~0.offset_148} OutVars{~x2~0=v_~x2~0_184, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_141|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_148, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_89|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_142|, ~x1~0=v_~x1~0_248, ~f~0.offset=v_~f~0.offset_148, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_75|, ~n~0=v_~n~0_157, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_75|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_149|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:41,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:41,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_169| v_~f~0.base_102))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_102 (* v_~x1~0_142 4))))) (and (not (= (ite (and (< v_~x1~0_142 v_~size~0_114) (<= 0 v_~x1~0_142)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_124| 4294967295) 4294967296) (* (mod v_~n~0_113 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= v_~x1~0_140 (select .cse0 (+ v_~f~0.offset_102 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= |v_thread1Thread1of1ForFork0_~i~0#1_124| 2)))) InVars {~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_102, #memory_int=|v_#memory_int_169|, ~n~0=v_~n~0_113, ~x1~0=v_~x1~0_142, ~f~0.offset=v_~f~0.offset_102} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_76|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_102, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_124|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74|, #memory_int=|v_#memory_int_169|, ~n~0=v_~n~0_113, ~x1~0=v_~x1~0_140, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_84|, ~f~0.offset=v_~f~0.offset_102} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:41,492 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:54:41,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1592 [2022-12-06 07:54:41,493 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 2027 flow [2022-12-06 07:54:41,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:41,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:41,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:41,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:54:41,493 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1625893549, now seen corresponding path program 1 times [2022-12-06 07:54:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:41,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86760544] [2022-12-06 07:54:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:41,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:41,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86760544] [2022-12-06 07:54:41,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86760544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:41,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:41,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698220760] [2022-12-06 07:54:41,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:41,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:41,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:41,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:41,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:41,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:54:41,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 2027 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:41,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:41,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:54:41,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:41,865 INFO L130 PetriNetUnfolder]: 742/1349 cut-off events. [2022-12-06 07:54:41,865 INFO L131 PetriNetUnfolder]: For 17202/17202 co-relation queries the response was YES. [2022-12-06 07:54:41,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9359 conditions, 1349 events. 742/1349 cut-off events. For 17202/17202 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7412 event pairs, 368 based on Foata normal form. 4/1345 useless extension candidates. Maximal degree in co-relation 8751. Up to 1322 conditions per place. [2022-12-06 07:54:41,873 INFO L137 encePairwiseOnDemand]: 41/47 looper letters, 126 selfloop transitions, 8 changer transitions 1/135 dead transitions. [2022-12-06 07:54:41,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 2361 flow [2022-12-06 07:54:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:54:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:54:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 07:54:41,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36879432624113473 [2022-12-06 07:54:41,875 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 2027 flow. Second operand 3 states and 52 transitions. [2022-12-06 07:54:41,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 2361 flow [2022-12-06 07:54:41,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 2220 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:41,909 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1921 flow [2022-12-06 07:54:41,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1921, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 07:54:41,910 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 07:54:41,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:41,911 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1921 flow [2022-12-06 07:54:41,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:41,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:41,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1921 flow [2022-12-06 07:54:41,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1921 flow [2022-12-06 07:54:41,950 INFO L130 PetriNetUnfolder]: 132/452 cut-off events. [2022-12-06 07:54:41,950 INFO L131 PetriNetUnfolder]: For 4715/4765 co-relation queries the response was YES. [2022-12-06 07:54:41,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 452 events. 132/452 cut-off events. For 4715/4765 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3184 event pairs, 30 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 2558. Up to 136 conditions per place. [2022-12-06 07:54:41,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1921 flow [2022-12-06 07:54:41,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 07:54:41,954 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:41,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 07:54:41,955 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 1921 flow [2022-12-06 07:54:41,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:41,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:41,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:41,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 07:54:41,955 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1995524838, now seen corresponding path program 1 times [2022-12-06 07:54:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:41,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443081636] [2022-12-06 07:54:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:42,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443081636] [2022-12-06 07:54:42,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443081636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:42,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:42,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:42,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723119834] [2022-12-06 07:54:42,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:42,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:42,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:42,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:42,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:42,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:54:42,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 1921 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:42,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:42,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:54:42,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:42,305 INFO L130 PetriNetUnfolder]: 720/1323 cut-off events. [2022-12-06 07:54:42,305 INFO L131 PetriNetUnfolder]: For 15842/15842 co-relation queries the response was YES. [2022-12-06 07:54:42,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8790 conditions, 1323 events. 720/1323 cut-off events. For 15842/15842 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7302 event pairs, 357 based on Foata normal form. 20/1333 useless extension candidates. Maximal degree in co-relation 8093. Up to 1273 conditions per place. [2022-12-06 07:54:42,313 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 112 selfloop transitions, 20 changer transitions 8/140 dead transitions. [2022-12-06 07:54:42,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 140 transitions, 2249 flow [2022-12-06 07:54:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 07:54:42,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3423913043478261 [2022-12-06 07:54:42,314 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 1921 flow. Second operand 4 states and 63 transitions. [2022-12-06 07:54:42,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 140 transitions, 2249 flow [2022-12-06 07:54:42,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 140 transitions, 2213 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:42,347 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1949 flow [2022-12-06 07:54:42,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1949, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 07:54:42,348 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 07:54:42,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:42,348 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1949 flow [2022-12-06 07:54:42,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:42,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:42,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1949 flow [2022-12-06 07:54:42,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1949 flow [2022-12-06 07:54:42,387 INFO L130 PetriNetUnfolder]: 129/440 cut-off events. [2022-12-06 07:54:42,387 INFO L131 PetriNetUnfolder]: For 4265/4309 co-relation queries the response was YES. [2022-12-06 07:54:42,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 440 events. 129/440 cut-off events. For 4265/4309 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3033 event pairs, 28 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 2522. Up to 131 conditions per place. [2022-12-06 07:54:42,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1949 flow [2022-12-06 07:54:42,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 07:54:42,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:42,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:42,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:42,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:43,045 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:43,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 698 [2022-12-06 07:54:43,046 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 132 transitions, 1975 flow [2022-12-06 07:54:43,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:43,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:43,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:43,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:54:43,046 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:43,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1487787042, now seen corresponding path program 2 times [2022-12-06 07:54:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:43,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447729040] [2022-12-06 07:54:43,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:43,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:43,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447729040] [2022-12-06 07:54:43,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447729040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:43,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:43,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544357569] [2022-12-06 07:54:43,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:43,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:43,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:54:43,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 132 transitions, 1975 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:43,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:43,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:54:43,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:43,366 INFO L130 PetriNetUnfolder]: 718/1313 cut-off events. [2022-12-06 07:54:43,366 INFO L131 PetriNetUnfolder]: For 14620/14620 co-relation queries the response was YES. [2022-12-06 07:54:43,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8893 conditions, 1313 events. 718/1313 cut-off events. For 14620/14620 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7195 event pairs, 363 based on Foata normal form. 4/1307 useless extension candidates. Maximal degree in co-relation 8199. Up to 1281 conditions per place. [2022-12-06 07:54:43,373 INFO L137 encePairwiseOnDemand]: 33/50 looper letters, 114 selfloop transitions, 23 changer transitions 0/137 dead transitions. [2022-12-06 07:54:43,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 2306 flow [2022-12-06 07:54:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 07:54:43,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 07:54:43,374 INFO L175 Difference]: Start difference. First operand has 109 places, 132 transitions, 1975 flow. Second operand 4 states and 60 transitions. [2022-12-06 07:54:43,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 2306 flow [2022-12-06 07:54:43,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 2265 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:43,406 INFO L231 Difference]: Finished difference. Result has 112 places, 133 transitions, 2006 flow [2022-12-06 07:54:43,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2006, PETRI_PLACES=112, PETRI_TRANSITIONS=133} [2022-12-06 07:54:43,407 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-06 07:54:43,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:43,407 INFO L89 Accepts]: Start accepts. Operand has 112 places, 133 transitions, 2006 flow [2022-12-06 07:54:43,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:43,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:43,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 133 transitions, 2006 flow [2022-12-06 07:54:43,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 133 transitions, 2006 flow [2022-12-06 07:54:43,445 INFO L130 PetriNetUnfolder]: 132/451 cut-off events. [2022-12-06 07:54:43,446 INFO L131 PetriNetUnfolder]: For 4537/4592 co-relation queries the response was YES. [2022-12-06 07:54:43,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 451 events. 132/451 cut-off events. For 4537/4592 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3138 event pairs, 29 based on Foata normal form. 4/424 useless extension candidates. Maximal degree in co-relation 2622. Up to 135 conditions per place. [2022-12-06 07:54:43,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 133 transitions, 2006 flow [2022-12-06 07:54:43,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-06 07:54:43,450 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:43,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 07:54:43,451 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 133 transitions, 2006 flow [2022-12-06 07:54:43,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:43,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:43,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:43,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:54:43,451 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash 507632386, now seen corresponding path program 1 times [2022-12-06 07:54:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:43,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239432004] [2022-12-06 07:54:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:43,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239432004] [2022-12-06 07:54:43,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239432004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:43,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809861709] [2022-12-06 07:54:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:43,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:43,530 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:43,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:54:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:43,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:54:43,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:43,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:43,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809861709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:43,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:43,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 07:54:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113930085] [2022-12-06 07:54:43,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:43,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:54:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:54:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:54:43,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:54:43,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 133 transitions, 2006 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:43,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:43,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:54:43,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:44,521 INFO L130 PetriNetUnfolder]: 755/1399 cut-off events. [2022-12-06 07:54:44,521 INFO L131 PetriNetUnfolder]: For 16300/16300 co-relation queries the response was YES. [2022-12-06 07:54:44,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9517 conditions, 1399 events. 755/1399 cut-off events. For 16300/16300 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7865 event pairs, 340 based on Foata normal form. 32/1413 useless extension candidates. Maximal degree in co-relation 8822. Up to 1225 conditions per place. [2022-12-06 07:54:44,528 INFO L137 encePairwiseOnDemand]: 34/50 looper letters, 139 selfloop transitions, 30 changer transitions 6/175 dead transitions. [2022-12-06 07:54:44,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 175 transitions, 2764 flow [2022-12-06 07:54:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:54:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:54:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 07:54:44,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26857142857142857 [2022-12-06 07:54:44,536 INFO L175 Difference]: Start difference. First operand has 112 places, 133 transitions, 2006 flow. Second operand 7 states and 94 transitions. [2022-12-06 07:54:44,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 175 transitions, 2764 flow [2022-12-06 07:54:44,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 175 transitions, 2717 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:44,573 INFO L231 Difference]: Finished difference. Result has 120 places, 139 transitions, 2142 flow [2022-12-06 07:54:44,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2142, PETRI_PLACES=120, PETRI_TRANSITIONS=139} [2022-12-06 07:54:44,574 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 07:54:44,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:44,574 INFO L89 Accepts]: Start accepts. Operand has 120 places, 139 transitions, 2142 flow [2022-12-06 07:54:44,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:44,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:44,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 139 transitions, 2142 flow [2022-12-06 07:54:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 139 transitions, 2142 flow [2022-12-06 07:54:44,619 INFO L130 PetriNetUnfolder]: 139/490 cut-off events. [2022-12-06 07:54:44,619 INFO L131 PetriNetUnfolder]: For 6027/6082 co-relation queries the response was YES. [2022-12-06 07:54:44,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 490 events. 139/490 cut-off events. For 6027/6082 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3494 event pairs, 28 based on Foata normal form. 4/465 useless extension candidates. Maximal degree in co-relation 3082. Up to 139 conditions per place. [2022-12-06 07:54:44,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 139 transitions, 2142 flow [2022-12-06 07:54:44,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-06 07:54:44,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:44,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:45,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:45,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 472 [2022-12-06 07:54:45,047 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 140 transitions, 2201 flow [2022-12-06 07:54:45,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:45,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:45,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:45,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:45,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:45,258 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:45,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash -254902856, now seen corresponding path program 2 times [2022-12-06 07:54:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:45,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222928387] [2022-12-06 07:54:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:45,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222928387] [2022-12-06 07:54:45,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222928387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:45,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:45,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797944276] [2022-12-06 07:54:45,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:45,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:45,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:45,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:54:45,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 140 transitions, 2201 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:45,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:45,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:54:45,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:45,651 INFO L130 PetriNetUnfolder]: 763/1393 cut-off events. [2022-12-06 07:54:45,651 INFO L131 PetriNetUnfolder]: For 21030/21030 co-relation queries the response was YES. [2022-12-06 07:54:45,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10461 conditions, 1393 events. 763/1393 cut-off events. For 21030/21030 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7769 event pairs, 144 based on Foata normal form. 12/1395 useless extension candidates. Maximal degree in co-relation 9694. Up to 618 conditions per place. [2022-12-06 07:54:45,660 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 149 selfloop transitions, 36 changer transitions 2/187 dead transitions. [2022-12-06 07:54:45,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 187 transitions, 3206 flow [2022-12-06 07:54:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 07:54:45,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2923076923076923 [2022-12-06 07:54:45,668 INFO L175 Difference]: Start difference. First operand has 120 places, 140 transitions, 2201 flow. Second operand 5 states and 76 transitions. [2022-12-06 07:54:45,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 187 transitions, 3206 flow [2022-12-06 07:54:45,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 187 transitions, 3077 flow, removed 47 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:45,714 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 2394 flow [2022-12-06 07:54:45,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2394, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2022-12-06 07:54:45,714 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-06 07:54:45,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:45,714 INFO L89 Accepts]: Start accepts. Operand has 124 places, 151 transitions, 2394 flow [2022-12-06 07:54:45,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:45,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:45,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 151 transitions, 2394 flow [2022-12-06 07:54:45,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 151 transitions, 2394 flow [2022-12-06 07:54:45,767 INFO L130 PetriNetUnfolder]: 149/484 cut-off events. [2022-12-06 07:54:45,767 INFO L131 PetriNetUnfolder]: For 7486/7536 co-relation queries the response was YES. [2022-12-06 07:54:45,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 484 events. 149/484 cut-off events. For 7486/7536 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3341 event pairs, 24 based on Foata normal form. 4/461 useless extension candidates. Maximal degree in co-relation 3331. Up to 142 conditions per place. [2022-12-06 07:54:45,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 151 transitions, 2394 flow [2022-12-06 07:54:45,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-06 07:54:46,218 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:46,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 505 [2022-12-06 07:54:46,219 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 150 transitions, 2386 flow [2022-12-06 07:54:46,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:46,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:46,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:54:46,219 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1211623447, now seen corresponding path program 1 times [2022-12-06 07:54:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:46,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459664229] [2022-12-06 07:54:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:46,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459664229] [2022-12-06 07:54:46,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459664229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:46,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004957431] [2022-12-06 07:54:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:46,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:46,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:46,292 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:46,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:54:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:46,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:54:46,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:46,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:46,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004957431] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:46,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:46,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 07:54:46,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330091582] [2022-12-06 07:54:46,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:46,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:54:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:54:46,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:54:46,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 07:54:46,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 150 transitions, 2386 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:46,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:46,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 07:54:46,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:47,177 INFO L130 PetriNetUnfolder]: 832/1481 cut-off events. [2022-12-06 07:54:47,177 INFO L131 PetriNetUnfolder]: For 30317/30317 co-relation queries the response was YES. [2022-12-06 07:54:47,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12374 conditions, 1481 events. 832/1481 cut-off events. For 30317/30317 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8102 event pairs, 147 based on Foata normal form. 55/1526 useless extension candidates. Maximal degree in co-relation 11567. Up to 767 conditions per place. [2022-12-06 07:54:47,188 INFO L137 encePairwiseOnDemand]: 19/52 looper letters, 137 selfloop transitions, 72 changer transitions 0/209 dead transitions. [2022-12-06 07:54:47,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 209 transitions, 3745 flow [2022-12-06 07:54:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-12-06 07:54:47,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1987179487179487 [2022-12-06 07:54:47,189 INFO L175 Difference]: Start difference. First operand has 122 places, 150 transitions, 2386 flow. Second operand 9 states and 93 transitions. [2022-12-06 07:54:47,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 209 transitions, 3745 flow [2022-12-06 07:54:47,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 209 transitions, 3661 flow, removed 42 selfloop flow, removed 0 redundant places. [2022-12-06 07:54:47,248 INFO L231 Difference]: Finished difference. Result has 135 places, 161 transitions, 2842 flow [2022-12-06 07:54:47,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2842, PETRI_PLACES=135, PETRI_TRANSITIONS=161} [2022-12-06 07:54:47,248 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 114 predicate places. [2022-12-06 07:54:47,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:47,249 INFO L89 Accepts]: Start accepts. Operand has 135 places, 161 transitions, 2842 flow [2022-12-06 07:54:47,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:47,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:47,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 161 transitions, 2842 flow [2022-12-06 07:54:47,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 161 transitions, 2842 flow [2022-12-06 07:54:47,301 INFO L130 PetriNetUnfolder]: 166/508 cut-off events. [2022-12-06 07:54:47,301 INFO L131 PetriNetUnfolder]: For 10088/10169 co-relation queries the response was YES. [2022-12-06 07:54:47,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4307 conditions, 508 events. 166/508 cut-off events. For 10088/10169 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3420 event pairs, 24 based on Foata normal form. 8/491 useless extension candidates. Maximal degree in co-relation 4023. Up to 166 conditions per place. [2022-12-06 07:54:47,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 161 transitions, 2842 flow [2022-12-06 07:54:47,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-06 07:54:47,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:47,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 551 [2022-12-06 07:54:47,799 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 161 transitions, 2928 flow [2022-12-06 07:54:47,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:47,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:47,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:47,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:48,004 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,SelfDestructingSolverStorable33 [2022-12-06 07:54:48,004 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1908327070, now seen corresponding path program 2 times [2022-12-06 07:54:48,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:48,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568865169] [2022-12-06 07:54:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:48,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568865169] [2022-12-06 07:54:48,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568865169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:48,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:48,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132676016] [2022-12-06 07:54:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:48,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:48,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:48,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:48,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:54:48,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 161 transitions, 2928 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:48,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:48,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:54:48,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:48,450 INFO L130 PetriNetUnfolder]: 824/1487 cut-off events. [2022-12-06 07:54:48,450 INFO L131 PetriNetUnfolder]: For 34412/34412 co-relation queries the response was YES. [2022-12-06 07:54:48,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13176 conditions, 1487 events. 824/1487 cut-off events. For 34412/34412 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8193 event pairs, 330 based on Foata normal form. 24/1501 useless extension candidates. Maximal degree in co-relation 12322. Up to 1220 conditions per place. [2022-12-06 07:54:48,459 INFO L137 encePairwiseOnDemand]: 32/56 looper letters, 137 selfloop transitions, 47 changer transitions 0/184 dead transitions. [2022-12-06 07:54:48,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 184 transitions, 3542 flow [2022-12-06 07:54:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 07:54:48,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-06 07:54:48,460 INFO L175 Difference]: Start difference. First operand has 135 places, 161 transitions, 2928 flow. Second operand 5 states and 85 transitions. [2022-12-06 07:54:48,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 184 transitions, 3542 flow [2022-12-06 07:54:48,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 3327 flow, removed 101 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:48,531 INFO L231 Difference]: Finished difference. Result has 140 places, 166 transitions, 2984 flow [2022-12-06 07:54:48,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2713, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2984, PETRI_PLACES=140, PETRI_TRANSITIONS=166} [2022-12-06 07:54:48,532 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 119 predicate places. [2022-12-06 07:54:48,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:48,532 INFO L89 Accepts]: Start accepts. Operand has 140 places, 166 transitions, 2984 flow [2022-12-06 07:54:48,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:48,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:48,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 166 transitions, 2984 flow [2022-12-06 07:54:48,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 166 transitions, 2984 flow [2022-12-06 07:54:48,585 INFO L130 PetriNetUnfolder]: 166/516 cut-off events. [2022-12-06 07:54:48,585 INFO L131 PetriNetUnfolder]: For 11776/11857 co-relation queries the response was YES. [2022-12-06 07:54:48,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 516 events. 166/516 cut-off events. For 11776/11857 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3503 event pairs, 20 based on Foata normal form. 5/497 useless extension candidates. Maximal degree in co-relation 4068. Up to 164 conditions per place. [2022-12-06 07:54:48,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 166 transitions, 2984 flow [2022-12-06 07:54:48,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 07:54:48,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:48,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:48,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 07:54:48,705 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 3020 flow [2022-12-06 07:54:48,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:48,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:48,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:48,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 07:54:48,705 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2041371074, now seen corresponding path program 1 times [2022-12-06 07:54:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:48,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101898993] [2022-12-06 07:54:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:50,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101898993] [2022-12-06 07:54:50,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101898993] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:50,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037743631] [2022-12-06 07:54:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:50,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:50,014 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:50,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:54:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:50,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 07:54:50,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:50,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:50,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:54:50,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:50,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:50,358 INFO L321 Elim1Store]: treesize reduction 16, result has 86.8 percent of original size [2022-12-06 07:54:50,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 148 [2022-12-06 07:54:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:50,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:52,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037743631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:52,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:52,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:54:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302847666] [2022-12-06 07:54:52,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:52,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:54:52,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:54:52,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=89, Unknown=1, NotChecked=0, Total=132 [2022-12-06 07:54:52,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:54:52,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 167 transitions, 3020 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:52,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:52,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:54:52,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:52,929 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* c_~x1~0 4) c_~f~0.offset)) (.cse4 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (let ((.cse2 (select |c_#memory_int| c_~f~0.base))) (let ((.cse0 (select .cse2 (+ c_~f~0.offset (* 4 (select .cse2 (+ (* (select .cse2 .cse4) 4) c_~f~0.offset))))))) (let ((.cse1 (select .cse2 (+ c_~f~0.offset (* 4 (select .cse2 (+ c_~f~0.offset (* .cse0 4)))))))) (or (not (<= 0 .cse0)) (<= c_~size~0 .cse1) (< .cse1 0) (not (< .cse0 c_~size~0)) (= (select .cse2 (+ (* (select .cse2 (+ c_~f~0.offset (* (select .cse2 (+ c_~f~0.offset (* (select .cse2 (+ c_~f~0.offset (* (select .cse2 (+ c_~f~0.offset (* (select .cse2 .cse3) 4))) 4))) 4))) 4))) 4) c_~f~0.offset)) (select .cse2 (+ (* 4 .cse1) c_~f~0.offset))))))) (forall ((v_ArrVal_862 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_862) c_~f~0.base))) (let ((.cse5 (select .cse7 (+ c_~f~0.offset (* (select .cse7 (+ c_~f~0.offset (* (select .cse7 .cse4) 4))) 4))))) (let ((.cse6 (select .cse7 (+ c_~f~0.offset (* 4 (select .cse7 (+ c_~f~0.offset (* 4 .cse5)))))))) (or (not (<= 0 .cse5)) (< .cse6 0) (= (select .cse7 (+ c_~f~0.offset (* .cse6 4))) (select .cse7 (+ c_~f~0.offset (* (select .cse7 (+ (* (select .cse7 (+ c_~f~0.offset (* 4 (select .cse7 (+ c_~f~0.offset (* (select .cse7 (+ c_~f~0.offset (* (select .cse7 .cse3) 4))) 4)))))) 4) c_~f~0.offset)) 4)))) (not (< .cse5 c_~size~0)) (<= c_~size~0 .cse6)))))))) is different from false [2022-12-06 07:54:56,404 INFO L130 PetriNetUnfolder]: 941/1730 cut-off events. [2022-12-06 07:54:56,404 INFO L131 PetriNetUnfolder]: For 42403/42403 co-relation queries the response was YES. [2022-12-06 07:54:56,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15382 conditions, 1730 events. 941/1730 cut-off events. For 42403/42403 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10194 event pairs, 222 based on Foata normal form. 4/1724 useless extension candidates. Maximal degree in co-relation 14522. Up to 1437 conditions per place. [2022-12-06 07:54:56,415 INFO L137 encePairwiseOnDemand]: 16/57 looper letters, 143 selfloop transitions, 62 changer transitions 7/212 dead transitions. [2022-12-06 07:54:56,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 212 transitions, 4083 flow [2022-12-06 07:54:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-12-06 07:54:56,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1949317738791423 [2022-12-06 07:54:56,417 INFO L175 Difference]: Start difference. First operand has 141 places, 167 transitions, 3020 flow. Second operand 9 states and 100 transitions. [2022-12-06 07:54:56,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 212 transitions, 4083 flow [2022-12-06 07:54:56,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 212 transitions, 3980 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:56,508 INFO L231 Difference]: Finished difference. Result has 153 places, 181 transitions, 3470 flow [2022-12-06 07:54:56,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3470, PETRI_PLACES=153, PETRI_TRANSITIONS=181} [2022-12-06 07:54:56,508 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2022-12-06 07:54:56,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:56,508 INFO L89 Accepts]: Start accepts. Operand has 153 places, 181 transitions, 3470 flow [2022-12-06 07:54:56,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:56,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:56,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 181 transitions, 3470 flow [2022-12-06 07:54:56,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 181 transitions, 3470 flow [2022-12-06 07:54:56,574 INFO L130 PetriNetUnfolder]: 203/638 cut-off events. [2022-12-06 07:54:56,575 INFO L131 PetriNetUnfolder]: For 17852/17969 co-relation queries the response was YES. [2022-12-06 07:54:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 638 events. 203/638 cut-off events. For 17852/17969 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4679 event pairs, 41 based on Foata normal form. 6/602 useless extension candidates. Maximal degree in co-relation 5353. Up to 193 conditions per place. [2022-12-06 07:54:56,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 181 transitions, 3470 flow [2022-12-06 07:54:56,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 07:54:56,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:56,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:54:56,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_226| v_~f~0.base_142))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_142 (* v_~x2~0_170 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_142 (* .cse1 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_142 (* 4 .cse0))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_142 (* .cse4 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_142 (* .cse2 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_152) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_152) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_132|) 4294967296) (* 2 (mod v_~n~0_151 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_152) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_170) (< v_~x2~0_170 v_~size~0_152)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_132|) (= (ite (and (< .cse3 v_~size~0_152) (<= 0 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (< .cse4 v_~size~0_152) (<= 0 .cse4)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_142 (* .cse3 4))) v_~x2~0_168)))))))) InVars {~x2~0=v_~x2~0_170, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_142, #memory_int=|v_#memory_int_226|, ~n~0=v_~n~0_151, ~f~0.offset=v_~f~0.offset_142} OutVars{~x2~0=v_~x2~0_168, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_75|, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_142, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_79|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_132|, ~f~0.offset=v_~f~0.offset_142, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|, #memory_int=|v_#memory_int_226|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_65|, ~n~0=v_~n~0_151, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_65|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [654] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~f~0.base_162))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_162 (* v_~x1~0_280 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_162 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_216| 3) (= v_~x1~0_278 (select .cse0 (+ v_~f~0.offset_162 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_216| 4294967295) 4294967296) (* (mod v_~n~0_169 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (and (< .cse2 v_~size~0_170) (<= 0 .cse2)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_170)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|) (not (= (ite (and (< v_~x1~0_280 v_~size~0_170) (<= 0 v_~x1~0_280)) 1 0) 0)))))) InVars {~size~0=v_~size~0_170, ~f~0.base=v_~f~0.base_162, #memory_int=|v_#memory_int_252|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_280, ~f~0.offset=v_~f~0.offset_162} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|, ~size~0=v_~size~0_170, ~f~0.base=v_~f~0.base_162, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_216|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|, #memory_int=|v_#memory_int_252|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_278, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_166|, ~f~0.offset=v_~f~0.offset_162} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:57,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:57,530 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:54:57,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1024 [2022-12-06 07:54:57,532 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 179 transitions, 3502 flow [2022-12-06 07:54:57,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:57,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:57,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:57,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:57,732 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,SelfDestructingSolverStorable35 [2022-12-06 07:54:57,735 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:57,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:57,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1563444456, now seen corresponding path program 3 times [2022-12-06 07:54:57,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:57,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307442180] [2022-12-06 07:54:57,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:57,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307442180] [2022-12-06 07:54:57,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307442180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:57,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:57,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227065326] [2022-12-06 07:54:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:57,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:57,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:57,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:54:57,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 179 transitions, 3502 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:57,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:57,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:54:57,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:58,182 INFO L130 PetriNetUnfolder]: 917/1673 cut-off events. [2022-12-06 07:54:58,182 INFO L131 PetriNetUnfolder]: For 46414/46414 co-relation queries the response was YES. [2022-12-06 07:54:58,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15796 conditions, 1673 events. 917/1673 cut-off events. For 46414/46414 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9670 event pairs, 384 based on Foata normal form. 8/1671 useless extension candidates. Maximal degree in co-relation 14894. Up to 1369 conditions per place. [2022-12-06 07:54:58,193 INFO L137 encePairwiseOnDemand]: 34/58 looper letters, 149 selfloop transitions, 51 changer transitions 0/200 dead transitions. [2022-12-06 07:54:58,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 200 transitions, 4248 flow [2022-12-06 07:54:58,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 07:54:58,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2896551724137931 [2022-12-06 07:54:58,194 INFO L175 Difference]: Start difference. First operand has 151 places, 179 transitions, 3502 flow. Second operand 5 states and 84 transitions. [2022-12-06 07:54:58,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 200 transitions, 4248 flow [2022-12-06 07:54:58,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 200 transitions, 3988 flow, removed 115 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:58,282 INFO L231 Difference]: Finished difference. Result has 152 places, 179 transitions, 3407 flow [2022-12-06 07:54:58,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=3267, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3407, PETRI_PLACES=152, PETRI_TRANSITIONS=179} [2022-12-06 07:54:58,282 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-06 07:54:58,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:58,283 INFO L89 Accepts]: Start accepts. Operand has 152 places, 179 transitions, 3407 flow [2022-12-06 07:54:58,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:58,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:58,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 179 transitions, 3407 flow [2022-12-06 07:54:58,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 179 transitions, 3407 flow [2022-12-06 07:54:58,351 INFO L130 PetriNetUnfolder]: 195/611 cut-off events. [2022-12-06 07:54:58,351 INFO L131 PetriNetUnfolder]: For 15835/15959 co-relation queries the response was YES. [2022-12-06 07:54:58,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5306 conditions, 611 events. 195/611 cut-off events. For 15835/15959 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4408 event pairs, 40 based on Foata normal form. 6/577 useless extension candidates. Maximal degree in co-relation 5002. Up to 178 conditions per place. [2022-12-06 07:54:58,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 179 transitions, 3407 flow [2022-12-06 07:54:58,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-06 07:54:58,358 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:58,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 07:54:58,358 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 179 transitions, 3407 flow [2022-12-06 07:54:58,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:58,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:58,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:58,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 07:54:58,358 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1430528684, now seen corresponding path program 1 times [2022-12-06 07:54:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:58,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914086340] [2022-12-06 07:54:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:58,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:58,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-06 07:54:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:58,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914086340] [2022-12-06 07:54:58,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914086340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:58,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:58,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795048650] [2022-12-06 07:54:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:58,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:54:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:54:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:54:58,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:54:58,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 179 transitions, 3407 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:58,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:58,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:54:58,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:59,203 INFO L130 PetriNetUnfolder]: 969/1801 cut-off events. [2022-12-06 07:54:59,203 INFO L131 PetriNetUnfolder]: For 43856/43856 co-relation queries the response was YES. [2022-12-06 07:54:59,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16364 conditions, 1801 events. 969/1801 cut-off events. For 43856/43856 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10805 event pairs, 244 based on Foata normal form. 3/1794 useless extension candidates. Maximal degree in co-relation 15461. Up to 1586 conditions per place. [2022-12-06 07:54:59,216 INFO L137 encePairwiseOnDemand]: 18/57 looper letters, 141 selfloop transitions, 64 changer transitions 11/216 dead transitions. [2022-12-06 07:54:59,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 216 transitions, 4423 flow [2022-12-06 07:54:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 07:54:59,217 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3087719298245614 [2022-12-06 07:54:59,217 INFO L175 Difference]: Start difference. First operand has 152 places, 179 transitions, 3407 flow. Second operand 5 states and 88 transitions. [2022-12-06 07:54:59,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 216 transitions, 4423 flow [2022-12-06 07:54:59,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 216 transitions, 4285 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:59,316 INFO L231 Difference]: Finished difference. Result has 156 places, 193 transitions, 3857 flow [2022-12-06 07:54:59,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3295, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3857, PETRI_PLACES=156, PETRI_TRANSITIONS=193} [2022-12-06 07:54:59,317 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 135 predicate places. [2022-12-06 07:54:59,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:59,317 INFO L89 Accepts]: Start accepts. Operand has 156 places, 193 transitions, 3857 flow [2022-12-06 07:54:59,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:59,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:59,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 193 transitions, 3857 flow [2022-12-06 07:54:59,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 193 transitions, 3857 flow [2022-12-06 07:54:59,391 INFO L130 PetriNetUnfolder]: 212/680 cut-off events. [2022-12-06 07:54:59,392 INFO L131 PetriNetUnfolder]: For 17849/17958 co-relation queries the response was YES. [2022-12-06 07:54:59,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5920 conditions, 680 events. 212/680 cut-off events. For 17849/17958 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5094 event pairs, 48 based on Foata normal form. 14/654 useless extension candidates. Maximal degree in co-relation 5609. Up to 197 conditions per place. [2022-12-06 07:54:59,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 193 transitions, 3857 flow [2022-12-06 07:54:59,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-06 07:54:59,399 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:59,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 07:54:59,400 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 193 transitions, 3857 flow [2022-12-06 07:54:59,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:59,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:59,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:59,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 07:54:59,400 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:54:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2062357319, now seen corresponding path program 1 times [2022-12-06 07:54:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:59,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202516782] [2022-12-06 07:54:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202516782] [2022-12-06 07:54:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202516782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355864181] [2022-12-06 07:54:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:59,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:59,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:59,477 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:54:59,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:54:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:59,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 07:54:59,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:59,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:59,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:54:59,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:59,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:54:59,808 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 07:54:59,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 70 [2022-12-06 07:54:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:59,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:00,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355864181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:00,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:00,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 07:55:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127374903] [2022-12-06 07:55:00,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:00,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:55:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:00,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:55:00,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=2, NotChecked=0, Total=156 [2022-12-06 07:55:00,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 07:55:00,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 193 transitions, 3857 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:00,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:00,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 07:55:00,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:00,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* c_~x1~0 4) c_~f~0.offset)) (.cse9 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (forall ((v_ArrVal_948 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_948) c_~f~0.base))) (let ((.cse2 (select .cse7 .cse9))) (let ((.cse6 (select .cse7 (+ c_~f~0.offset (* (select .cse7 (+ c_~f~0.offset (* .cse2 4))) 4)))) (.cse1 (select .cse7 .cse8))) (let ((.cse3 (select .cse7 (+ c_~f~0.offset (* 4 .cse1)))) (.cse5 (select .cse7 (+ c_~f~0.offset (* .cse6 4))))) (let ((.cse0 (select .cse7 (+ (* .cse5 4) c_~f~0.offset))) (.cse4 (select .cse7 (+ c_~f~0.offset (* .cse3 4))))) (or (<= c_~size~0 .cse0) (not (<= 0 .cse1)) (< .cse0 0) (not (< .cse2 c_~size~0)) (<= c_~size~0 .cse3) (< .cse3 0) (< .cse4 0) (not (< .cse5 c_~size~0)) (not (<= 0 .cse2)) (not (<= 0 .cse5)) (not (<= 0 .cse6)) (<= c_~size~0 .cse4) (= (select .cse7 (+ (* .cse0 4) c_~f~0.offset)) (select .cse7 (+ (* .cse4 4) c_~f~0.offset))) (not (< .cse6 c_~size~0)) (not (< .cse1 c_~size~0))))))))) (let ((.cse14 (select |c_#memory_int| c_~f~0.base))) (let ((.cse13 (select .cse14 .cse9))) (let ((.cse17 (select .cse14 .cse8)) (.cse16 (select .cse14 (+ c_~f~0.offset (* 4 (select .cse14 (+ (* .cse13 4) c_~f~0.offset))))))) (let ((.cse10 (select .cse14 (+ c_~f~0.offset (* .cse16 4)))) (.cse11 (select .cse14 (+ c_~f~0.offset (* .cse17 4))))) (let ((.cse12 (select .cse14 (+ c_~f~0.offset (* .cse11 4)))) (.cse15 (select .cse14 (+ c_~f~0.offset (* 4 .cse10))))) (or (not (<= 0 .cse10)) (<= c_~size~0 .cse11) (< .cse11 0) (< .cse12 0) (not (< .cse13 c_~size~0)) (not (< .cse10 c_~size~0)) (= (select .cse14 (+ c_~f~0.offset (* .cse12 4))) (select .cse14 (+ (* 4 .cse15) c_~f~0.offset))) (not (<= 0 .cse13)) (not (<= 0 .cse16)) (<= c_~size~0 .cse12) (<= c_~size~0 .cse15) (not (<= 0 .cse17)) (not (< .cse17 c_~size~0)) (< .cse15 0) (not (< .cse16 c_~size~0)))))))))) is different from false [2022-12-06 07:55:20,830 WARN L233 SmtUtils]: Spent 20.34s on a formula simplification. DAG size of input: 137 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:55:41,305 WARN L233 SmtUtils]: Spent 20.37s on a formula simplification. DAG size of input: 120 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:55:54,358 WARN L233 SmtUtils]: Spent 12.33s on a formula simplification. DAG size of input: 123 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:55:55,219 INFO L130 PetriNetUnfolder]: 1066/1969 cut-off events. [2022-12-06 07:55:55,219 INFO L131 PetriNetUnfolder]: For 53918/53918 co-relation queries the response was YES. [2022-12-06 07:55:55,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18526 conditions, 1969 events. 1066/1969 cut-off events. For 53918/53918 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12009 event pairs, 210 based on Foata normal form. 15/1974 useless extension candidates. Maximal degree in co-relation 17616. Up to 1506 conditions per place. [2022-12-06 07:55:55,233 INFO L137 encePairwiseOnDemand]: 10/57 looper letters, 151 selfloop transitions, 109 changer transitions 6/266 dead transitions. [2022-12-06 07:55:55,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 266 transitions, 5685 flow [2022-12-06 07:55:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:55:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:55:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 128 transitions. [2022-12-06 07:55:55,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1497076023391813 [2022-12-06 07:55:55,244 INFO L175 Difference]: Start difference. First operand has 156 places, 193 transitions, 3857 flow. Second operand 15 states and 128 transitions. [2022-12-06 07:55:55,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 266 transitions, 5685 flow [2022-12-06 07:55:55,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 266 transitions, 5628 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:55:55,370 INFO L231 Difference]: Finished difference. Result has 177 places, 222 transitions, 5007 flow [2022-12-06 07:55:55,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3801, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5007, PETRI_PLACES=177, PETRI_TRANSITIONS=222} [2022-12-06 07:55:55,370 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 156 predicate places. [2022-12-06 07:55:55,370 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:55,370 INFO L89 Accepts]: Start accepts. Operand has 177 places, 222 transitions, 5007 flow [2022-12-06 07:55:55,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:55,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:55,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 222 transitions, 5007 flow [2022-12-06 07:55:55,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 222 transitions, 5007 flow [2022-12-06 07:55:55,457 INFO L130 PetriNetUnfolder]: 235/744 cut-off events. [2022-12-06 07:55:55,457 INFO L131 PetriNetUnfolder]: For 23528/23678 co-relation queries the response was YES. [2022-12-06 07:55:55,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6989 conditions, 744 events. 235/744 cut-off events. For 23528/23678 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5713 event pairs, 51 based on Foata normal form. 7/706 useless extension candidates. Maximal degree in co-relation 6654. Up to 221 conditions per place. [2022-12-06 07:55:55,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 222 transitions, 5007 flow [2022-12-06 07:55:55,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-06 07:55:55,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:55:55,751 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:55:55,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-06 07:55:55,751 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 222 transitions, 5021 flow [2022-12-06 07:55:55,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:55,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:55,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:55,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:55:55,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 07:55:55,956 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash -23212719, now seen corresponding path program 1 times [2022-12-06 07:55:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:55,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190561232] [2022-12-06 07:55:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190561232] [2022-12-06 07:55:56,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190561232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:56,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:56,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:55:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656299397] [2022-12-06 07:55:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:56,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:55:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:55:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:55:56,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:55:56,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 222 transitions, 5021 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:56,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:56,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:55:56,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:56,474 INFO L130 PetriNetUnfolder]: 1182/2184 cut-off events. [2022-12-06 07:55:56,474 INFO L131 PetriNetUnfolder]: For 64533/64533 co-relation queries the response was YES. [2022-12-06 07:55:56,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21349 conditions, 2184 events. 1182/2184 cut-off events. For 64533/64533 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13574 event pairs, 417 based on Foata normal form. 24/2198 useless extension candidates. Maximal degree in co-relation 20394. Up to 1125 conditions per place. [2022-12-06 07:55:56,492 INFO L137 encePairwiseOnDemand]: 43/59 looper letters, 237 selfloop transitions, 21 changer transitions 2/260 dead transitions. [2022-12-06 07:55:56,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 260 transitions, 6211 flow [2022-12-06 07:55:56,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:55:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:55:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-06 07:55:56,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3305084745762712 [2022-12-06 07:55:56,493 INFO L175 Difference]: Start difference. First operand has 177 places, 222 transitions, 5021 flow. Second operand 4 states and 78 transitions. [2022-12-06 07:55:56,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 260 transitions, 6211 flow [2022-12-06 07:55:56,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 260 transitions, 5633 flow, removed 274 selfloop flow, removed 2 redundant places. [2022-12-06 07:55:56,734 INFO L231 Difference]: Finished difference. Result has 180 places, 227 transitions, 4654 flow [2022-12-06 07:55:56,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4489, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4654, PETRI_PLACES=180, PETRI_TRANSITIONS=227} [2022-12-06 07:55:56,734 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 159 predicate places. [2022-12-06 07:55:56,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:56,734 INFO L89 Accepts]: Start accepts. Operand has 180 places, 227 transitions, 4654 flow [2022-12-06 07:55:56,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:56,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:56,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 227 transitions, 4654 flow [2022-12-06 07:55:56,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 227 transitions, 4654 flow [2022-12-06 07:55:56,829 INFO L130 PetriNetUnfolder]: 251/824 cut-off events. [2022-12-06 07:55:56,830 INFO L131 PetriNetUnfolder]: For 22119/22256 co-relation queries the response was YES. [2022-12-06 07:55:56,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7299 conditions, 824 events. 251/824 cut-off events. For 22119/22256 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6590 event pairs, 56 based on Foata normal form. 5/784 useless extension candidates. Maximal degree in co-relation 6951. Up to 237 conditions per place. [2022-12-06 07:55:56,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 227 transitions, 4654 flow [2022-12-06 07:55:56,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-06 07:55:57,557 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:55:57,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 823 [2022-12-06 07:55:57,557 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 227 transitions, 4676 flow [2022-12-06 07:55:57,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:57,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:57,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:57,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:55:57,558 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:55:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash 793332690, now seen corresponding path program 1 times [2022-12-06 07:55:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:57,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217126769] [2022-12-06 07:55:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:59,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217126769] [2022-12-06 07:55:59,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217126769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:59,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:59,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:55:59,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625965046] [2022-12-06 07:55:59,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:59,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:55:59,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:55:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:55:59,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:55:59,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 227 transitions, 4676 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:59,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:59,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:55:59,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:59,930 INFO L130 PetriNetUnfolder]: 1198/2213 cut-off events. [2022-12-06 07:55:59,931 INFO L131 PetriNetUnfolder]: For 62274/62274 co-relation queries the response was YES. [2022-12-06 07:55:59,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21026 conditions, 2213 events. 1198/2213 cut-off events. For 62274/62274 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13821 event pairs, 341 based on Foata normal form. 1/2208 useless extension candidates. Maximal degree in co-relation 20032. Up to 2115 conditions per place. [2022-12-06 07:55:59,946 INFO L137 encePairwiseOnDemand]: 20/59 looper letters, 185 selfloop transitions, 54 changer transitions 3/242 dead transitions. [2022-12-06 07:55:59,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 242 transitions, 5378 flow [2022-12-06 07:55:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:55:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:55:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 07:55:59,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3220338983050847 [2022-12-06 07:55:59,947 INFO L175 Difference]: Start difference. First operand has 180 places, 227 transitions, 4676 flow. Second operand 4 states and 76 transitions. [2022-12-06 07:55:59,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 242 transitions, 5378 flow [2022-12-06 07:56:00,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 242 transitions, 5302 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 07:56:00,118 INFO L231 Difference]: Finished difference. Result has 183 places, 229 transitions, 4843 flow [2022-12-06 07:56:00,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4600, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4843, PETRI_PLACES=183, PETRI_TRANSITIONS=229} [2022-12-06 07:56:00,118 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 162 predicate places. [2022-12-06 07:56:00,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:00,119 INFO L89 Accepts]: Start accepts. Operand has 183 places, 229 transitions, 4843 flow [2022-12-06 07:56:00,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:00,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:00,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 229 transitions, 4843 flow [2022-12-06 07:56:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 229 transitions, 4843 flow [2022-12-06 07:56:00,217 INFO L130 PetriNetUnfolder]: 254/832 cut-off events. [2022-12-06 07:56:00,217 INFO L131 PetriNetUnfolder]: For 24076/24252 co-relation queries the response was YES. [2022-12-06 07:56:00,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7476 conditions, 832 events. 254/832 cut-off events. For 24076/24252 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6676 event pairs, 57 based on Foata normal form. 6/790 useless extension candidates. Maximal degree in co-relation 7123. Up to 236 conditions per place. [2022-12-06 07:56:00,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 229 transitions, 4843 flow [2022-12-06 07:56:00,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 734 [2022-12-06 07:56:00,228 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:56:00,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 07:56:00,228 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 229 transitions, 4843 flow [2022-12-06 07:56:00,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:00,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:00,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:00,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 07:56:00,228 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash 997417001, now seen corresponding path program 1 times [2022-12-06 07:56:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:00,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037893081] [2022-12-06 07:56:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:00,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037893081] [2022-12-06 07:56:00,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037893081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:56:00,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:56:00,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:56:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278094743] [2022-12-06 07:56:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:56:00,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:56:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:00,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:56:00,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:56:00,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:56:00,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 229 transitions, 4843 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:00,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:00,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:56:00,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:00,862 INFO L130 PetriNetUnfolder]: 1264/2425 cut-off events. [2022-12-06 07:56:00,863 INFO L131 PetriNetUnfolder]: For 72757/72757 co-relation queries the response was YES. [2022-12-06 07:56:00,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22998 conditions, 2425 events. 1264/2425 cut-off events. For 72757/72757 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16140 event pairs, 500 based on Foata normal form. 16/2435 useless extension candidates. Maximal degree in co-relation 21753. Up to 1933 conditions per place. [2022-12-06 07:56:00,882 INFO L137 encePairwiseOnDemand]: 35/59 looper letters, 235 selfloop transitions, 47 changer transitions 4/286 dead transitions. [2022-12-06 07:56:00,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 286 transitions, 6507 flow [2022-12-06 07:56:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:56:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:56:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-06 07:56:00,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3347457627118644 [2022-12-06 07:56:00,883 INFO L175 Difference]: Start difference. First operand has 183 places, 229 transitions, 4843 flow. Second operand 4 states and 79 transitions. [2022-12-06 07:56:00,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 286 transitions, 6507 flow [2022-12-06 07:56:01,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 286 transitions, 6410 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 07:56:01,082 INFO L231 Difference]: Finished difference. Result has 186 places, 255 transitions, 5449 flow [2022-12-06 07:56:01,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4736, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5449, PETRI_PLACES=186, PETRI_TRANSITIONS=255} [2022-12-06 07:56:01,083 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 165 predicate places. [2022-12-06 07:56:01,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:01,083 INFO L89 Accepts]: Start accepts. Operand has 186 places, 255 transitions, 5449 flow [2022-12-06 07:56:01,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:01,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:01,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 255 transitions, 5449 flow [2022-12-06 07:56:01,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 255 transitions, 5449 flow [2022-12-06 07:56:01,209 INFO L130 PetriNetUnfolder]: 300/998 cut-off events. [2022-12-06 07:56:01,209 INFO L131 PetriNetUnfolder]: For 31297/31461 co-relation queries the response was YES. [2022-12-06 07:56:01,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9294 conditions, 998 events. 300/998 cut-off events. For 31297/31461 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 8368 event pairs, 57 based on Foata normal form. 6/963 useless extension candidates. Maximal degree in co-relation 8789. Up to 302 conditions per place. [2022-12-06 07:56:01,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 255 transitions, 5449 flow [2022-12-06 07:56:01,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-06 07:56:01,221 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:56:01,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 07:56:01,222 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 255 transitions, 5449 flow [2022-12-06 07:56:01,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:01,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:01,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:01,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 07:56:01,222 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:56:01,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:01,222 INFO L85 PathProgramCache]: Analyzing trace with hash 81941919, now seen corresponding path program 2 times [2022-12-06 07:56:01,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:01,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124719148] [2022-12-06 07:56:01,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:01,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:01,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:01,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124719148] [2022-12-06 07:56:01,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124719148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:01,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039831321] [2022-12-06 07:56:01,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:56:01,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:01,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:01,288 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:01,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:56:01,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:56:01,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:56:01,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 07:56:01,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:01,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:01,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:56:01,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:01,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:56:01,665 INFO L321 Elim1Store]: treesize reduction 198, result has 12.0 percent of original size [2022-12-06 07:56:01,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 86 [2022-12-06 07:56:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:01,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039831321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:02,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:02,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 07:56:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107535599] [2022-12-06 07:56:02,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:02,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:56:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:02,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:56:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=93, Unknown=3, NotChecked=0, Total=132 [2022-12-06 07:56:02,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 07:56:02,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 255 transitions, 5449 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:02,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:02,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 07:56:02,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:35,444 WARN L233 SmtUtils]: Spent 32.62s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:57:04,684 WARN L233 SmtUtils]: Spent 28.56s on a formula simplification. DAG size of input: 197 DAG size of output: 179 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:57:40,834 WARN L233 SmtUtils]: Spent 34.60s on a formula simplification. DAG size of input: 205 DAG size of output: 187 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:58:06,102 WARN L233 SmtUtils]: Spent 24.55s on a formula simplification. DAG size of input: 186 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:58:07,189 INFO L130 PetriNetUnfolder]: 1350/2579 cut-off events. [2022-12-06 07:58:07,189 INFO L131 PetriNetUnfolder]: For 83917/83917 co-relation queries the response was YES. [2022-12-06 07:58:07,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25480 conditions, 2579 events. 1350/2579 cut-off events. For 83917/83917 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 17361 event pairs, 401 based on Foata normal form. 26/2599 useless extension candidates. Maximal degree in co-relation 24443. Up to 1788 conditions per place. [2022-12-06 07:58:07,212 INFO L137 encePairwiseOnDemand]: 12/59 looper letters, 181 selfloop transitions, 142 changer transitions 25/348 dead transitions. [2022-12-06 07:58:07,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 348 transitions, 7735 flow [2022-12-06 07:58:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:58:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:58:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-12-06 07:58:07,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1535393818544367 [2022-12-06 07:58:07,214 INFO L175 Difference]: Start difference. First operand has 186 places, 255 transitions, 5449 flow. Second operand 17 states and 154 transitions. [2022-12-06 07:58:07,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 348 transitions, 7735 flow [2022-12-06 07:58:07,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 348 transitions, 7561 flow, removed 62 selfloop flow, removed 1 redundant places. [2022-12-06 07:58:07,451 INFO L231 Difference]: Finished difference. Result has 209 places, 272 transitions, 6131 flow [2022-12-06 07:58:07,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=5271, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6131, PETRI_PLACES=209, PETRI_TRANSITIONS=272} [2022-12-06 07:58:07,452 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-06 07:58:07,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:07,452 INFO L89 Accepts]: Start accepts. Operand has 209 places, 272 transitions, 6131 flow [2022-12-06 07:58:07,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:07,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:07,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 272 transitions, 6131 flow [2022-12-06 07:58:07,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 272 transitions, 6131 flow [2022-12-06 07:58:07,578 INFO L130 PetriNetUnfolder]: 309/980 cut-off events. [2022-12-06 07:58:07,578 INFO L131 PetriNetUnfolder]: For 35556/35755 co-relation queries the response was YES. [2022-12-06 07:58:07,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9946 conditions, 980 events. 309/980 cut-off events. For 35556/35755 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7940 event pairs, 58 based on Foata normal form. 16/953 useless extension candidates. Maximal degree in co-relation 9553. Up to 319 conditions per place. [2022-12-06 07:58:07,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 272 transitions, 6131 flow [2022-12-06 07:58:07,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 778 [2022-12-06 07:58:08,434 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [691] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_316| v_~f~0.base_216))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_216 (* v_~x2~0_296 4)))) (.cse1 (select .cse4 (+ v_~f~0.offset_216 (* v_~x1~0_412 4))))) (let ((.cse9 (select .cse4 (+ (* .cse1 4) v_~f~0.offset_216))) (.cse7 (select .cse4 (+ v_~f~0.offset_216 (* 4 .cse3))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_216 (* .cse7 4)))) (.cse10 (select .cse4 (+ v_~f~0.offset_216 (* 4 .cse9))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_216 (* .cse10 4)))) (.cse2 (select .cse4 (+ (* .cse8 4) v_~f~0.offset_216)))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_216 (* .cse2 4)))) (.cse6 (select .cse4 (+ v_~f~0.offset_216 (* 4 .cse0))))) (and (not (= (ite (and (< .cse0 v_~size~0_224) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_224) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_185| 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_224|) (not (= (ite (and (<= 0 v_~x1~0_412) (< v_~x1~0_412 v_~size~0_224)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_224)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_236|) (not (= (ite (and (< .cse3 v_~size~0_224) (<= 0 .cse3)) 1 0) 0)) (= v_~x2~0_294 (select .cse4 (+ v_~f~0.offset_216 (* .cse5 4)))) (= (select .cse4 (+ v_~f~0.offset_216 (* 4 .cse6))) v_~x1~0_410) (= |v_thread1Thread1of1ForFork0_~i~0#1_327| 6) (not (= (ite (and (< v_~x2~0_296 v_~size~0_224) (<= 0 v_~x2~0_296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| (ite (and (< .cse5 v_~size~0_224) (<= 0 .cse5)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_185|) (< 4 (* 2 (mod v_~n~0_223 2147483648))) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_224)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_224) (<= 0 .cse8)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_236| 0)) (not (= (ite (and (< .cse9 v_~size~0_224) (<= 0 .cse9)) 1 0) 0)) (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_224)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_224)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_296, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_216, #memory_int=|v_#memory_int_316|, ~n~0=v_~n~0_223, ~x1~0=v_~x1~0_412, ~f~0.offset=v_~f~0.offset_216} OutVars{~x2~0=v_~x2~0_294, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_238|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_224, ~f~0.base=v_~f~0.base_216, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_151|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_224|, ~x1~0=v_~x1~0_410, ~f~0.offset=v_~f~0.offset_216, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_185|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_327|, #memory_int=|v_#memory_int_316|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_236|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_137|, ~n~0=v_~n~0_223, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_137|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_246|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:09,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:58:09,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1802 [2022-12-06 07:58:09,254 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 272 transitions, 6155 flow [2022-12-06 07:58:09,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:09,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:09,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:09,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:09,465 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,SelfDestructingSolverStorable42 [2022-12-06 07:58:09,465 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 160914370, now seen corresponding path program 1 times [2022-12-06 07:58:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19637308] [2022-12-06 07:58:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:09,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:09,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19637308] [2022-12-06 07:58:09,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19637308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:58:09,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:58:09,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:58:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76492317] [2022-12-06 07:58:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:58:09,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:58:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:58:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:58:09,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 07:58:09,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 272 transitions, 6155 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:09,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:09,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 07:58:09,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:10,161 INFO L130 PetriNetUnfolder]: 1342/2538 cut-off events. [2022-12-06 07:58:10,162 INFO L131 PetriNetUnfolder]: For 88269/88269 co-relation queries the response was YES. [2022-12-06 07:58:10,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26250 conditions, 2538 events. 1342/2538 cut-off events. For 88269/88269 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 16689 event pairs, 494 based on Foata normal form. 4/2536 useless extension candidates. Maximal degree in co-relation 24865. Up to 2074 conditions per place. [2022-12-06 07:58:10,181 INFO L137 encePairwiseOnDemand]: 39/61 looper letters, 254 selfloop transitions, 66 changer transitions 3/323 dead transitions. [2022-12-06 07:58:10,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 323 transitions, 7728 flow [2022-12-06 07:58:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:58:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:58:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-06 07:58:10,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25136612021857924 [2022-12-06 07:58:10,182 INFO L175 Difference]: Start difference. First operand has 209 places, 272 transitions, 6155 flow. Second operand 6 states and 92 transitions. [2022-12-06 07:58:10,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 323 transitions, 7728 flow [2022-12-06 07:58:10,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 323 transitions, 7295 flow, removed 131 selfloop flow, removed 10 redundant places. [2022-12-06 07:58:10,422 INFO L231 Difference]: Finished difference. Result has 206 places, 282 transitions, 6147 flow [2022-12-06 07:58:10,423 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=5736, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6147, PETRI_PLACES=206, PETRI_TRANSITIONS=282} [2022-12-06 07:58:10,423 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 185 predicate places. [2022-12-06 07:58:10,423 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:10,423 INFO L89 Accepts]: Start accepts. Operand has 206 places, 282 transitions, 6147 flow [2022-12-06 07:58:10,424 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:10,424 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:10,424 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 282 transitions, 6147 flow [2022-12-06 07:58:10,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 282 transitions, 6147 flow [2022-12-06 07:58:10,578 INFO L130 PetriNetUnfolder]: 320/1026 cut-off events. [2022-12-06 07:58:10,578 INFO L131 PetriNetUnfolder]: For 36725/36920 co-relation queries the response was YES. [2022-12-06 07:58:10,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10486 conditions, 1026 events. 320/1026 cut-off events. For 36725/36920 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8457 event pairs, 60 based on Foata normal form. 10/991 useless extension candidates. Maximal degree in co-relation 9873. Up to 338 conditions per place. [2022-12-06 07:58:10,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 282 transitions, 6147 flow [2022-12-06 07:58:10,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-06 07:58:10,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:10,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:10,801 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:58:10,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 378 [2022-12-06 07:58:10,801 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 283 transitions, 6200 flow [2022-12-06 07:58:10,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:10,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:10,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:10,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 07:58:10,801 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1671497517, now seen corresponding path program 1 times [2022-12-06 07:58:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:10,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644359671] [2022-12-06 07:58:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:58:10,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:10,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644359671] [2022-12-06 07:58:10,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644359671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:58:10,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:58:10,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:58:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357458427] [2022-12-06 07:58:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:58:10,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:58:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:58:10,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:58:10,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 07:58:10,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 283 transitions, 6200 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:10,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:10,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 07:58:10,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:11,414 INFO L130 PetriNetUnfolder]: 1348/2548 cut-off events. [2022-12-06 07:58:11,414 INFO L131 PetriNetUnfolder]: For 89248/89248 co-relation queries the response was YES. [2022-12-06 07:58:11,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26813 conditions, 2548 events. 1348/2548 cut-off events. For 89248/89248 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16716 event pairs, 636 based on Foata normal form. 8/2550 useless extension candidates. Maximal degree in co-relation 25281. Up to 2512 conditions per place. [2022-12-06 07:58:11,436 INFO L137 encePairwiseOnDemand]: 59/63 looper letters, 286 selfloop transitions, 6 changer transitions 0/292 dead transitions. [2022-12-06 07:58:11,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 292 transitions, 6951 flow [2022-12-06 07:58:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:58:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:58:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 07:58:11,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-06 07:58:11,437 INFO L175 Difference]: Start difference. First operand has 206 places, 283 transitions, 6200 flow. Second operand 3 states and 70 transitions. [2022-12-06 07:58:11,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 292 transitions, 6951 flow [2022-12-06 07:58:11,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 292 transitions, 6903 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-06 07:58:11,677 INFO L231 Difference]: Finished difference. Result has 209 places, 283 transitions, 6194 flow [2022-12-06 07:58:11,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6122, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=6194, PETRI_PLACES=209, PETRI_TRANSITIONS=283} [2022-12-06 07:58:11,678 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 188 predicate places. [2022-12-06 07:58:11,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:11,678 INFO L89 Accepts]: Start accepts. Operand has 209 places, 283 transitions, 6194 flow [2022-12-06 07:58:11,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:11,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:11,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 283 transitions, 6194 flow [2022-12-06 07:58:11,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 283 transitions, 6194 flow [2022-12-06 07:58:11,825 INFO L130 PetriNetUnfolder]: 323/1034 cut-off events. [2022-12-06 07:58:11,825 INFO L131 PetriNetUnfolder]: For 38550/38750 co-relation queries the response was YES. [2022-12-06 07:58:11,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10697 conditions, 1034 events. 323/1034 cut-off events. For 38550/38750 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8509 event pairs, 59 based on Foata normal form. 10/1001 useless extension candidates. Maximal degree in co-relation 10079. Up to 341 conditions per place. [2022-12-06 07:58:11,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 283 transitions, 6194 flow [2022-12-06 07:58:11,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-06 07:58:11,839 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:58:11,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 07:58:11,840 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 283 transitions, 6194 flow [2022-12-06 07:58:11,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:11,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:11,840 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:11,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 07:58:11,840 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1266092666, now seen corresponding path program 2 times [2022-12-06 07:58:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:11,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275927062] [2022-12-06 07:58:11,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:11,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:13,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275927062] [2022-12-06 07:58:13,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275927062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:13,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187609285] [2022-12-06 07:58:13,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:58:13,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:13,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:13,278 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-06 07:58:13,279 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-06 07:58:13,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:58:13,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:58:13,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-06 07:58:13,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:13,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:58:13,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:58:13,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:58:13,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:58:13,640 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 07:58:13,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 64 [2022-12-06 07:58:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:13,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:14,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187609285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:14,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:14,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:58:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670379898] [2022-12-06 07:58:14,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:14,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:58:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:14,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:58:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=181, Unknown=3, NotChecked=0, Total=240 [2022-12-06 07:58:14,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 07:58:14,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 283 transitions, 6194 flow. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:14,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:14,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 07:58:14,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:20,314 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:58:23,241 INFO L130 PetriNetUnfolder]: 1511/2879 cut-off events. [2022-12-06 07:58:23,241 INFO L131 PetriNetUnfolder]: For 114210/114210 co-relation queries the response was YES. [2022-12-06 07:58:23,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31418 conditions, 2879 events. 1511/2879 cut-off events. For 114210/114210 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19579 event pairs, 323 based on Foata normal form. 10/2883 useless extension candidates. Maximal degree in co-relation 29654. Up to 1512 conditions per place. [2022-12-06 07:58:23,264 INFO L137 encePairwiseOnDemand]: 18/62 looper letters, 211 selfloop transitions, 135 changer transitions 16/362 dead transitions. [2022-12-06 07:58:23,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 362 transitions, 8409 flow [2022-12-06 07:58:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:58:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:58:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2022-12-06 07:58:23,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18914956011730205 [2022-12-06 07:58:23,265 INFO L175 Difference]: Start difference. First operand has 209 places, 283 transitions, 6194 flow. Second operand 11 states and 129 transitions. [2022-12-06 07:58:23,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 362 transitions, 8409 flow [2022-12-06 07:58:23,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 362 transitions, 8340 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 07:58:23,574 INFO L231 Difference]: Finished difference. Result has 223 places, 295 transitions, 7052 flow [2022-12-06 07:58:23,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=6158, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7052, PETRI_PLACES=223, PETRI_TRANSITIONS=295} [2022-12-06 07:58:23,574 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2022-12-06 07:58:23,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:23,575 INFO L89 Accepts]: Start accepts. Operand has 223 places, 295 transitions, 7052 flow [2022-12-06 07:58:23,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:23,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:23,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 295 transitions, 7052 flow [2022-12-06 07:58:23,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 295 transitions, 7052 flow [2022-12-06 07:58:23,741 INFO L130 PetriNetUnfolder]: 349/1134 cut-off events. [2022-12-06 07:58:23,741 INFO L131 PetriNetUnfolder]: For 50514/50715 co-relation queries the response was YES. [2022-12-06 07:58:23,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12659 conditions, 1134 events. 349/1134 cut-off events. For 50514/50715 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9633 event pairs, 76 based on Foata normal form. 8/1094 useless extension candidates. Maximal degree in co-relation 12011. Up to 396 conditions per place. [2022-12-06 07:58:23,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 295 transitions, 7052 flow [2022-12-06 07:58:23,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-06 07:58:23,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:23,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:58:23,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-06 07:58:23,911 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 294 transitions, 7050 flow [2022-12-06 07:58:23,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:23,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:23,911 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:23,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 07:58:24,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:24,117 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -715073901, now seen corresponding path program 1 times [2022-12-06 07:58:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:24,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242460137] [2022-12-06 07:58:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:24,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242460137] [2022-12-06 07:58:24,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242460137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:24,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511606100] [2022-12-06 07:58:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:24,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:24,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:24,209 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-06 07:58:24,211 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-06 07:58:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:58:24,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:24,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:24,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511606100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:24,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:24,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 07:58:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144721627] [2022-12-06 07:58:24,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:24,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:58:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:24,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:58:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:58:24,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 07:58:24,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 294 transitions, 7050 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:24,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:24,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 07:58:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:27,333 INFO L130 PetriNetUnfolder]: 1454/2711 cut-off events. [2022-12-06 07:58:27,333 INFO L131 PetriNetUnfolder]: For 127623/127623 co-relation queries the response was YES. [2022-12-06 07:58:27,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32019 conditions, 2711 events. 1454/2711 cut-off events. For 127623/127623 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 17861 event pairs, 208 based on Foata normal form. 173/2878 useless extension candidates. Maximal degree in co-relation 31103. Up to 1572 conditions per place. [2022-12-06 07:58:27,355 INFO L137 encePairwiseOnDemand]: 19/63 looper letters, 152 selfloop transitions, 116 changer transitions 113/381 dead transitions. [2022-12-06 07:58:27,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 381 transitions, 9619 flow [2022-12-06 07:58:27,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:58:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:58:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 133 transitions. [2022-12-06 07:58:27,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15079365079365079 [2022-12-06 07:58:27,357 INFO L175 Difference]: Start difference. First operand has 222 places, 294 transitions, 7050 flow. Second operand 14 states and 133 transitions. [2022-12-06 07:58:27,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 381 transitions, 9619 flow [2022-12-06 07:58:27,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 381 transitions, 9048 flow, removed 171 selfloop flow, removed 9 redundant places. [2022-12-06 07:58:27,828 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 5492 flow [2022-12-06 07:58:27,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6560, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5492, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2022-12-06 07:58:27,828 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 209 predicate places. [2022-12-06 07:58:27,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:27,828 INFO L89 Accepts]: Start accepts. Operand has 230 places, 223 transitions, 5492 flow [2022-12-06 07:58:27,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:27,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:27,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 223 transitions, 5492 flow [2022-12-06 07:58:27,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 223 transitions, 5492 flow [2022-12-06 07:58:27,928 INFO L130 PetriNetUnfolder]: 249/771 cut-off events. [2022-12-06 07:58:27,928 INFO L131 PetriNetUnfolder]: For 34379/34502 co-relation queries the response was YES. [2022-12-06 07:58:27,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8784 conditions, 771 events. 249/771 cut-off events. For 34379/34502 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5871 event pairs, 57 based on Foata normal form. 14/756 useless extension candidates. Maximal degree in co-relation 8675. Up to 244 conditions per place. [2022-12-06 07:58:27,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 223 transitions, 5492 flow [2022-12-06 07:58:27,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 07:58:27,938 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:58:27,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 07:58:27,939 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 223 transitions, 5492 flow [2022-12-06 07:58:27,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:27,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:27,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:27,946 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-06 07:58:28,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:28,142 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -623591662, now seen corresponding path program 2 times [2022-12-06 07:58:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:28,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59803723] [2022-12-06 07:58:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:28,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:28,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59803723] [2022-12-06 07:58:28,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59803723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:28,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964894658] [2022-12-06 07:58:28,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:58:28,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:28,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:28,193 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-06 07:58:28,227 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-06 07:58:28,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:58:28,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:58:28,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:58:28,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:28,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:28,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964894658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:28,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:28,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 07:58:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183703366] [2022-12-06 07:58:28,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:28,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:58:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:28,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:58:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:58:28,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 07:58:28,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 223 transitions, 5492 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:28,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:28,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 07:58:28,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:29,025 INFO L130 PetriNetUnfolder]: 990/1878 cut-off events. [2022-12-06 07:58:29,025 INFO L131 PetriNetUnfolder]: For 83872/83872 co-relation queries the response was YES. [2022-12-06 07:58:29,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21859 conditions, 1878 events. 990/1878 cut-off events. For 83872/83872 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11463 event pairs, 153 based on Foata normal form. 4/1878 useless extension candidates. Maximal degree in co-relation 21728. Up to 1137 conditions per place. [2022-12-06 07:58:29,041 INFO L137 encePairwiseOnDemand]: 21/46 looper letters, 210 selfloop transitions, 79 changer transitions 0/289 dead transitions. [2022-12-06 07:58:29,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 289 transitions, 7538 flow [2022-12-06 07:58:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:58:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:58:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-12-06 07:58:29,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18115942028985507 [2022-12-06 07:58:29,042 INFO L175 Difference]: Start difference. First operand has 198 places, 223 transitions, 5492 flow. Second operand 12 states and 100 transitions. [2022-12-06 07:58:29,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 289 transitions, 7538 flow [2022-12-06 07:58:29,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 289 transitions, 6974 flow, removed 185 selfloop flow, removed 20 redundant places. [2022-12-06 07:58:29,262 INFO L231 Difference]: Finished difference. Result has 191 places, 231 transitions, 5494 flow [2022-12-06 07:58:29,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5158, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5494, PETRI_PLACES=191, PETRI_TRANSITIONS=231} [2022-12-06 07:58:29,262 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 170 predicate places. [2022-12-06 07:58:29,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:29,262 INFO L89 Accepts]: Start accepts. Operand has 191 places, 231 transitions, 5494 flow [2022-12-06 07:58:29,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:29,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:29,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 231 transitions, 5494 flow [2022-12-06 07:58:29,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 231 transitions, 5494 flow [2022-12-06 07:58:29,354 INFO L130 PetriNetUnfolder]: 253/778 cut-off events. [2022-12-06 07:58:29,355 INFO L131 PetriNetUnfolder]: For 26177/26335 co-relation queries the response was YES. [2022-12-06 07:58:29,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7983 conditions, 778 events. 253/778 cut-off events. For 26177/26335 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5881 event pairs, 52 based on Foata normal form. 12/758 useless extension candidates. Maximal degree in co-relation 7492. Up to 245 conditions per place. [2022-12-06 07:58:29,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 231 transitions, 5494 flow [2022-12-06 07:58:29,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 07:58:29,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:29,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse1 (* (mod v_~n~0_139 2147483648) 2)) (.cse0 (select .cse2 (+ v_~f~0.offset_130 (* v_~x2~0_147 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_147) (< v_~x2~0_147 v_~size~0_140)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_161| 1) |v_thread1Thread1of1ForFork0_~i~0#1_160|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_113| 4294967296) .cse1) (= v_~x1~0_198 (select .cse2 (+ v_~f~0.offset_130 (* v_~x1~0_199 4)))) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_113|) |v_thread2Thread1of1ForFork1_~i~1#1_112|) (= (ite (and (< v_~x1~0_199 v_~size~0_140) (<= 0 v_~x1~0_199)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_161| 4294967296) .cse1) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_130 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0))))) InVars {~x2~0=v_~x2~0_147, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_161|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_113|, ~n~0=v_~n~0_139, ~x1~0=v_~x1~0_199, ~f~0.offset=v_~f~0.offset_130} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~x1~0=v_~x1~0_198, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_51|, ~n~0=v_~n~0_139, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:29,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:30,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_268| v_~f~0.base_178))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_178 (* v_~x2~0_241 4)))) (.cse2 (* (mod v_~n~0_185 2147483648) 2)) (.cse3 (select .cse0 (+ v_~f~0.offset_178 (* v_~x1~0_317 4))))) (and (= (select .cse0 (+ v_~f~0.offset_178 (* .cse1 4))) v_~x2~0_240) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_186)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_239| 4294967296) .cse2) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_179| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_241) (< v_~x2~0_241 v_~size~0_186)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_238| 4294967295) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_178| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_179|)) (not (= (ite (and (< v_~x1~0_317 v_~size~0_186) (<= 0 v_~x1~0_317)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_178 (* .cse3 4))) v_~x1~0_316) (= (ite (and (< .cse3 v_~size~0_186) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162|) (= |v_thread1Thread1of1ForFork0_~i~0#1_238| (+ |v_thread1Thread1of1ForFork0_~i~0#1_239| 2))))) InVars {~x2~0=v_~x2~0_241, ~size~0=v_~size~0_186, ~f~0.base=v_~f~0.base_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_239|, #memory_int=|v_#memory_int_268|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_179|, ~n~0=v_~n~0_185, ~x1~0=v_~x1~0_317, ~f~0.offset=v_~f~0.offset_178} OutVars{~x2~0=v_~x2~0_240, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_180|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, ~size~0=v_~size~0_186, ~f~0.base=v_~f~0.base_178, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_121|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_178|, ~x1~0=v_~x1~0_316, ~f~0.offset=v_~f~0.offset_178, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_238|, #memory_int=|v_#memory_int_268|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_107|, ~n~0=v_~n~0_185, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_107|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_188|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:30,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:30,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_274| v_~f~0.base_184))) (let ((.cse0 (* 2 (mod v_~n~0_191 2147483648))) (.cse1 (select .cse2 (+ v_~f~0.offset_184 (* v_~x2~0_253 4))))) (and (= (ite (and (< v_~x1~0_329 v_~size~0_192) (<= 0 v_~x1~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_251| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_253 v_~size~0_192) (<= 0 v_~x2~0_253)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_191|) |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= |v_thread1Thread1of1ForFork0_~i~0#1_250| (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_191| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_184 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= v_~x1~0_328 (select .cse2 (+ v_~f~0.offset_184 (* v_~x1~0_329 4))))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, #memory_int=|v_#memory_int_274|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_190|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_250|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_113|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_113|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:31,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_276| v_~f~0.base_186))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_186 (* v_~x1~0_335 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_186 (* v_~x2~0_258 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_186 (* .cse2 4)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_256| 4294967295) 4294967296) .cse0) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_196|) |v_thread2Thread1of1ForFork1_~i~1#1_195|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_194)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_335 v_~size~0_194) (<= 0 v_~x1~0_335)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_256| (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= v_~x1~0_334 (select .cse3 (+ v_~f~0.offset_186 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188| 0)) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_194)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_186 (* .cse1 4))) v_~x2~0_257) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_196| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, #memory_int=|v_#memory_int_276|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_196|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_335, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_257, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_190|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_126|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_195|, ~x1~0=v_~x1~0_334, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_256|, #memory_int=|v_#memory_int_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_116|, ~n~0=v_~n~0_193, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_116|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:31,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:31,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:31,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_221| v_~f~0.base_140))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_140 (* v_~x2~0_163 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648)))) (and (= (ite (and (< .cse0 v_~size~0_150) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= (select .cse1 (+ v_~f~0.offset_140 (* v_~x1~0_227 4))) v_~x1~0_226) (= (ite (and (<= 0 v_~x1~0_227) (< v_~x1~0_227 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_180| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_179| (+ |v_thread1Thread1of1ForFork0_~i~0#1_180| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_127|) |v_thread2Thread1of1ForFork1_~i~1#1_126|) (= (select .cse1 (+ v_~f~0.offset_140 (* .cse0 4))) v_~x2~0_162) (not (= (ite (and (< v_~x2~0_163 v_~size~0_150) (<= 0 v_~x2~0_163)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_127| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|)))) InVars {~x2~0=v_~x2~0_163, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_140, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_180|, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_127|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_227, ~f~0.offset=v_~f~0.offset_140} OutVars{~x2~0=v_~x2~0_162, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_127|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_71|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_140, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_75|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_126|, ~x1~0=v_~x1~0_226, ~f~0.offset=v_~f~0.offset_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_179|, #memory_int=|v_#memory_int_221|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_61|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:32,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [681] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_295| v_~f~0.base_202))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_202 (* v_~x2~0_277 4)))) (.cse0 (* (mod v_~n~0_209 2147483648) 2))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_211| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| (ite (and (< .cse1 v_~size~0_210) (<= 0 .cse1)) 1 0)) (= (ite (and (< v_~x1~0_379 v_~size~0_210) (<= 0 v_~x1~0_379)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|) (= v_~x2~0_276 (select .cse2 (+ v_~f~0.offset_202 (* 4 .cse1)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217| 0)) (not (= (ite (and (<= 0 v_~x2~0_277) (< v_~x2~0_277 v_~size~0_210)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_211|) |v_thread2Thread1of1ForFork1_~i~1#1_210|) (= v_~x1~0_378 (select .cse2 (+ v_~f~0.offset_202 (* v_~x1~0_379 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_301| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_300| (+ |v_thread1Thread1of1ForFork0_~i~0#1_301| 1))))) InVars {~x2~0=v_~x2~0_277, ~size~0=v_~size~0_210, ~f~0.base=v_~f~0.base_202, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_301|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_211|, ~n~0=v_~n~0_209, ~x1~0=v_~x1~0_379, ~f~0.offset=v_~f~0.offset_202} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_219|, ~x2~0=v_~x2~0_276, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_137|, ~size~0=v_~size~0_210, ~f~0.base=v_~f~0.base_202, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_141|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_210|, ~x1~0=v_~x1~0_378, ~f~0.offset=v_~f~0.offset_202, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_300|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_127|, ~n~0=v_~n~0_209, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_227|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_127|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:32,486 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse1 (* (mod v_~n~0_139 2147483648) 2)) (.cse0 (select .cse2 (+ v_~f~0.offset_130 (* v_~x2~0_147 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_147) (< v_~x2~0_147 v_~size~0_140)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_161| 1) |v_thread1Thread1of1ForFork0_~i~0#1_160|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_113| 4294967296) .cse1) (= v_~x1~0_198 (select .cse2 (+ v_~f~0.offset_130 (* v_~x1~0_199 4)))) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_113|) |v_thread2Thread1of1ForFork1_~i~1#1_112|) (= (ite (and (< v_~x1~0_199 v_~size~0_140) (<= 0 v_~x1~0_199)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_161| 4294967296) .cse1) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_130 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0))))) InVars {~x2~0=v_~x2~0_147, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_161|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_113|, ~n~0=v_~n~0_139, ~x1~0=v_~x1~0_199, ~f~0.offset=v_~f~0.offset_130} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~x1~0=v_~x1~0_198, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_51|, ~n~0=v_~n~0_139, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:32,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_205| v_~f~0.base_128))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_128 (* v_~x2~0_143 4)))) (.cse1 (* 2 (mod v_~n~0_137 2147483648)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_138)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_157| 4294967296) .cse1) (= v_~x1~0_194 (select .cse2 (+ v_~f~0.offset_128 (* v_~x1~0_195 4)))) (not (= (ite (and (< v_~x2~0_143 v_~size~0_138) (<= 0 v_~x2~0_143)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_156| (+ |v_thread1Thread1of1ForFork0_~i~0#1_157| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~x1~0_195 v_~size~0_138) (<= 0 v_~x1~0_195)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_109|) |v_thread2Thread1of1ForFork1_~i~1#1_108|) (= (select .cse2 (+ v_~f~0.offset_128 (* .cse0 4))) v_~x2~0_142) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_109| 4294967296) .cse1)))) InVars {~x2~0=v_~x2~0_143, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~n~0=v_~n~0_137, ~x1~0=v_~x1~0_195, ~f~0.offset=v_~f~0.offset_128} OutVars{~x2~0=v_~x2~0_142, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_108|, ~x1~0=v_~x1~0_194, ~f~0.offset=v_~f~0.offset_128, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_205|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_137, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:33,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_272| v_~f~0.base_182))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_182 (* v_~x2~0_249 4)))) (.cse2 (* (mod v_~n~0_189 2147483648) 2))) (and (= (select .cse0 (+ v_~f~0.offset_182 (* .cse1 4))) v_~x2~0_248) (= v_~x1~0_324 (select .cse0 (+ v_~f~0.offset_182 (* v_~x1~0_325 4)))) (not (= (ite (and (< v_~x2~0_249 v_~size~0_190) (<= 0 v_~x2~0_249)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_247| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| (ite (and (< .cse1 v_~size~0_190) (<= 0 .cse1)) 1 0)) (= (ite (and (< v_~x1~0_325 v_~size~0_190) (<= 0 v_~x1~0_325)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_186|) (= |v_thread1Thread1of1ForFork0_~i~0#1_246| (+ |v_thread1Thread1of1ForFork0_~i~0#1_247| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|)))) InVars {~x2~0=v_~x2~0_249, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_182, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_247|, #memory_int=|v_#memory_int_272|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_189, ~x1~0=v_~x1~0_325, ~f~0.offset=v_~f~0.offset_182} OutVars{~x2~0=v_~x2~0_248, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_184|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_121|, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_182, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_186|, ~x1~0=v_~x1~0_324, ~f~0.offset=v_~f~0.offset_182, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_246|, #memory_int=|v_#memory_int_272|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_111|, ~n~0=v_~n~0_189, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_111|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_192|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:33,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [665] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_270| v_~f~0.base_180))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_180 (* v_~x1~0_321 4)))) (.cse0 (* 2 (mod v_~n~0_187 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_180 (* v_~x2~0_245 4))))) (and (not (= (ite (and (< v_~x1~0_321 v_~size~0_188) (<= 0 v_~x1~0_321)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_183|) |v_thread2Thread1of1ForFork1_~i~1#1_182|) (= |v_thread1Thread1of1ForFork0_~i~0#1_242| (+ |v_thread1Thread1of1ForFork0_~i~0#1_243| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_242| 4294967295) 4294967296) .cse0) (= v_~x2~0_244 (select .cse1 (+ v_~f~0.offset_180 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| (ite (and (< .cse3 v_~size~0_188) (<= 0 .cse3)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_243| 4294967296) .cse0) (= v_~x1~0_320 (select .cse1 (+ v_~f~0.offset_180 (* .cse3 4)))) (not (= (ite (and (< v_~x2~0_245 v_~size~0_188) (<= 0 v_~x2~0_245)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_183| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_188)) 1 0))))) InVars {~x2~0=v_~x2~0_245, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_243|, #memory_int=|v_#memory_int_270|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_183|, ~n~0=v_~n~0_187, ~x1~0=v_~x1~0_321, ~f~0.offset=v_~f~0.offset_180} OutVars{~x2~0=v_~x2~0_244, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_182|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_182|, ~x1~0=v_~x1~0_320, ~f~0.offset=v_~f~0.offset_180, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_242|, #memory_int=|v_#memory_int_270|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_109|, ~n~0=v_~n~0_187, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_190|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:33,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:33,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:33,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:34,168 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:34,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_205| v_~f~0.base_128))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_128 (* v_~x2~0_143 4)))) (.cse1 (* 2 (mod v_~n~0_137 2147483648)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_138)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_157| 4294967296) .cse1) (= v_~x1~0_194 (select .cse2 (+ v_~f~0.offset_128 (* v_~x1~0_195 4)))) (not (= (ite (and (< v_~x2~0_143 v_~size~0_138) (<= 0 v_~x2~0_143)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_156| (+ |v_thread1Thread1of1ForFork0_~i~0#1_157| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~x1~0_195 v_~size~0_138) (<= 0 v_~x1~0_195)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_109|) |v_thread2Thread1of1ForFork1_~i~1#1_108|) (= (select .cse2 (+ v_~f~0.offset_128 (* .cse0 4))) v_~x2~0_142) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_109| 4294967296) .cse1)))) InVars {~x2~0=v_~x2~0_143, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~n~0=v_~n~0_137, ~x1~0=v_~x1~0_195, ~f~0.offset=v_~f~0.offset_128} OutVars{~x2~0=v_~x2~0_142, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_108|, ~x1~0=v_~x1~0_194, ~f~0.offset=v_~f~0.offset_128, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_205|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_137, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:34,633 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:58:34,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5371 [2022-12-06 07:58:34,633 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 236 transitions, 5916 flow [2022-12-06 07:58:34,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:34,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:34,634 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:34,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 07:58:34,838 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,SelfDestructingSolverStorable47 [2022-12-06 07:58:34,839 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1254682622, now seen corresponding path program 1 times [2022-12-06 07:58:34,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:34,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110862893] [2022-12-06 07:58:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:34,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:58:34,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:34,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110862893] [2022-12-06 07:58:34,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110862893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:34,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131995484] [2022-12-06 07:58:34,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:34,902 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-06 07:58:34,903 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-06 07:58:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:35,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:58:35,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:58:35,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:58:35,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131995484] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:35,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:35,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 07:58:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283556580] [2022-12-06 07:58:35,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:35,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:58:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:58:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:58:35,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 07:58:35,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 236 transitions, 5916 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:35,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:35,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 07:58:35,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:35,680 INFO L130 PetriNetUnfolder]: 1187/2259 cut-off events. [2022-12-06 07:58:35,681 INFO L131 PetriNetUnfolder]: For 84491/84491 co-relation queries the response was YES. [2022-12-06 07:58:35,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24323 conditions, 2259 events. 1187/2259 cut-off events. For 84491/84491 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14596 event pairs, 382 based on Foata normal form. 12/2271 useless extension candidates. Maximal degree in co-relation 23006. Up to 1502 conditions per place. [2022-12-06 07:58:35,697 INFO L137 encePairwiseOnDemand]: 37/64 looper letters, 193 selfloop transitions, 65 changer transitions 6/264 dead transitions. [2022-12-06 07:58:35,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 264 transitions, 6510 flow [2022-12-06 07:58:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:58:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:58:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 07:58:35,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21354166666666666 [2022-12-06 07:58:35,698 INFO L175 Difference]: Start difference. First operand has 192 places, 236 transitions, 5916 flow. Second operand 6 states and 82 transitions. [2022-12-06 07:58:35,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 264 transitions, 6510 flow [2022-12-06 07:58:35,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 264 transitions, 6394 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-12-06 07:58:35,864 INFO L231 Difference]: Finished difference. Result has 194 places, 213 transitions, 5019 flow [2022-12-06 07:58:35,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=4932, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5019, PETRI_PLACES=194, PETRI_TRANSITIONS=213} [2022-12-06 07:58:35,864 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 173 predicate places. [2022-12-06 07:58:35,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:35,865 INFO L89 Accepts]: Start accepts. Operand has 194 places, 213 transitions, 5019 flow [2022-12-06 07:58:35,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:35,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:35,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 213 transitions, 5019 flow [2022-12-06 07:58:35,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 213 transitions, 5019 flow [2022-12-06 07:58:35,973 INFO L130 PetriNetUnfolder]: 275/862 cut-off events. [2022-12-06 07:58:35,973 INFO L131 PetriNetUnfolder]: For 32980/33150 co-relation queries the response was YES. [2022-12-06 07:58:35,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9083 conditions, 862 events. 275/862 cut-off events. For 32980/33150 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6760 event pairs, 66 based on Foata normal form. 8/836 useless extension candidates. Maximal degree in co-relation 8479. Up to 299 conditions per place. [2022-12-06 07:58:35,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 213 transitions, 5019 flow [2022-12-06 07:58:35,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 614 [2022-12-06 07:58:35,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:36,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:37,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_201| v_~f~0.base_124))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_124 (* v_~x2~0_132 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_124 (* v_~x1~0_189 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= (ite (and (< .cse0 v_~size~0_134) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (not (= (ite (and (<= 0 v_~x2~0_132) (< v_~x2~0_132 v_~size~0_134)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_152| 2) (= (select .cse1 (+ v_~f~0.offset_124 (* .cse2 4))) v_~x2~0_131) (< 0 (* 2 (mod v_~n~0_133 2147483648))) (not (= (ite (and (< v_~x1~0_189 v_~size~0_134) (<= 0 v_~x1~0_189)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_134)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|) (= (select .cse1 (+ v_~f~0.offset_124 (* 4 .cse0))) v_~x1~0_188) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_101|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|)))) InVars {~x2~0=v_~x2~0_132, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, #memory_int=|v_#memory_int_201|, ~n~0=v_~n~0_133, ~x1~0=v_~x1~0_189, ~f~0.offset=v_~f~0.offset_124} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_104|, ~x2~0=v_~x2~0_131, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_52|, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_101|, ~x1~0=v_~x1~0_188, ~f~0.offset=v_~f~0.offset_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, #memory_int=|v_#memory_int_201|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_42|, ~n~0=v_~n~0_133, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:39,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_201| v_~f~0.base_124))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_124 (* v_~x2~0_132 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_124 (* v_~x1~0_189 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= (ite (and (< .cse0 v_~size~0_134) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| 0)) (not (= (ite (and (<= 0 v_~x2~0_132) (< v_~x2~0_132 v_~size~0_134)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_152| 2) (= (select .cse1 (+ v_~f~0.offset_124 (* .cse2 4))) v_~x2~0_131) (< 0 (* 2 (mod v_~n~0_133 2147483648))) (not (= (ite (and (< v_~x1~0_189 v_~size~0_134) (<= 0 v_~x1~0_189)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_134)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|) (= (select .cse1 (+ v_~f~0.offset_124 (* 4 .cse0))) v_~x1~0_188) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_101|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|)))) InVars {~x2~0=v_~x2~0_132, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, #memory_int=|v_#memory_int_201|, ~n~0=v_~n~0_133, ~x1~0=v_~x1~0_189, ~f~0.offset=v_~f~0.offset_124} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_104|, ~x2~0=v_~x2~0_131, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_52|, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_124, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_56|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_66|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_101|, ~x1~0=v_~x1~0_188, ~f~0.offset=v_~f~0.offset_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_90|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, #memory_int=|v_#memory_int_201|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_42|, ~n~0=v_~n~0_133, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_42|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [540] L98-6-->L98-6: Formula: (and (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22| 2147483648)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 1)) (= (store |v_#memory_int_71| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_71| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22|)) |v_#memory_int_70|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_22|, #memory_int=|v_#memory_int_71|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_41|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_23|, #memory_int=|v_#memory_int_70|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1] [2022-12-06 07:58:39,592 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:58:39,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3729 [2022-12-06 07:58:39,593 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 211 transitions, 5142 flow [2022-12-06 07:58:39,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:39,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:39,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:39,600 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-06 07:58:39,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 07:58:39,798 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:39,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1747537663, now seen corresponding path program 1 times [2022-12-06 07:58:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:39,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977985559] [2022-12-06 07:58:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:39,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:39,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977985559] [2022-12-06 07:58:39,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977985559] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:39,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187852117] [2022-12-06 07:58:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:39,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:39,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:39,869 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:39,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 07:58:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:39,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 07:58:39,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:40,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:58:40,013 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 14 treesize of output 16 [2022-12-06 07:58:40,128 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-12-06 07:58:40,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 48 [2022-12-06 07:58:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:40,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:40,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:40,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 394 treesize of output 414 [2022-12-06 07:58:40,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:40,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 226 [2022-12-06 07:58:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:47,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187852117] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:47,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:47,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-12-06 07:58:47,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515821933] [2022-12-06 07:58:47,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:47,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:58:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:47,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:58:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:58:47,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 07:58:47,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 211 transitions, 5142 flow. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:47,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:47,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 07:58:47,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:49,310 INFO L130 PetriNetUnfolder]: 1212/2303 cut-off events. [2022-12-06 07:58:49,310 INFO L131 PetriNetUnfolder]: For 97089/97089 co-relation queries the response was YES. [2022-12-06 07:58:49,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25502 conditions, 2303 events. 1212/2303 cut-off events. For 97089/97089 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 15069 event pairs, 368 based on Foata normal form. 16/2319 useless extension candidates. Maximal degree in co-relation 24298. Up to 1869 conditions per place. [2022-12-06 07:58:49,329 INFO L137 encePairwiseOnDemand]: 14/51 looper letters, 190 selfloop transitions, 102 changer transitions 15/307 dead transitions. [2022-12-06 07:58:49,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 307 transitions, 7548 flow [2022-12-06 07:58:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 07:58:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 07:58:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 148 transitions. [2022-12-06 07:58:49,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1319073083778966 [2022-12-06 07:58:49,330 INFO L175 Difference]: Start difference. First operand has 190 places, 211 transitions, 5142 flow. Second operand 22 states and 148 transitions. [2022-12-06 07:58:49,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 307 transitions, 7548 flow [2022-12-06 07:58:49,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 307 transitions, 7189 flow, removed 124 selfloop flow, removed 5 redundant places. [2022-12-06 07:58:49,523 INFO L231 Difference]: Finished difference. Result has 217 places, 239 transitions, 5938 flow [2022-12-06 07:58:49,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4750, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5938, PETRI_PLACES=217, PETRI_TRANSITIONS=239} [2022-12-06 07:58:49,523 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 196 predicate places. [2022-12-06 07:58:49,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:49,523 INFO L89 Accepts]: Start accepts. Operand has 217 places, 239 transitions, 5938 flow [2022-12-06 07:58:49,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:49,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:49,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 239 transitions, 5938 flow [2022-12-06 07:58:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 239 transitions, 5938 flow [2022-12-06 07:58:49,641 INFO L130 PetriNetUnfolder]: 303/930 cut-off events. [2022-12-06 07:58:49,641 INFO L131 PetriNetUnfolder]: For 41331/41509 co-relation queries the response was YES. [2022-12-06 07:58:49,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10415 conditions, 930 events. 303/930 cut-off events. For 41331/41509 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7377 event pairs, 66 based on Foata normal form. 11/906 useless extension candidates. Maximal degree in co-relation 10157. Up to 340 conditions per place. [2022-12-06 07:58:49,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 239 transitions, 5938 flow [2022-12-06 07:58:49,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-06 07:58:49,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:50,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_274| v_~f~0.base_184))) (let ((.cse0 (* 2 (mod v_~n~0_191 2147483648))) (.cse1 (select .cse2 (+ v_~f~0.offset_184 (* v_~x2~0_253 4))))) (and (= (ite (and (< v_~x1~0_329 v_~size~0_192) (<= 0 v_~x1~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_251| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_253 v_~size~0_192) (<= 0 v_~x2~0_253)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_191|) |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= |v_thread1Thread1of1ForFork0_~i~0#1_250| (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_191| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_184 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= v_~x1~0_328 (select .cse2 (+ v_~f~0.offset_184 (* v_~x1~0_329 4))))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, #memory_int=|v_#memory_int_274|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_190|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_250|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_113|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_113|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:50,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_334| v_~f~0.base_228))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_228 (* v_~x2~0_325 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_228 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_228 (* .cse3 4))))) (and (= v_~x2~0_323 (select .cse0 (+ v_~f~0.offset_228 (* 4 .cse1)))) (not (= (ite (and (< v_~x2~0_325 v_~size~0_236) (<= 0 v_~x2~0_325)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_250|) 4294967296) (* 2 (mod v_~n~0_235 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| (ite (and (< .cse1 v_~size~0_236) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_236)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_250| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205| 0)) (not (= (ite (and (< .cse3 v_~size~0_236) (<= 0 .cse3)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_236, ~f~0.base=v_~f~0.base_228, #memory_int=|v_#memory_int_334|, ~n~0=v_~n~0_235, ~f~0.offset=v_~f~0.offset_228} OutVars{~x2~0=v_~x2~0_323, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_167|, ~size~0=v_~size~0_236, ~f~0.base=v_~f~0.base_228, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_171|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_250|, ~f~0.offset=v_~f~0.offset_228, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_205|, #memory_int=|v_#memory_int_334|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_157|, ~n~0=v_~n~0_235, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_157|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:50,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_264| v_~f~0.base_174))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_174 (* v_~x1~0_309 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_174 (* v_~x2~0_233 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_234| 2) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_182)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|) (not (= (ite (and (< v_~x1~0_309 v_~size~0_182) (<= 0 v_~x1~0_309)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (= v_~x1~0_308 (select .cse1 (+ v_~f~0.offset_174 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_233) (< v_~x2~0_233 v_~size~0_182)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_174|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (= v_~x2~0_232 (select .cse1 (+ v_~f~0.offset_174 (* .cse2 4)))) (< 0 (* 2 (mod v_~n~0_181 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (and (< .cse2 v_~size~0_182) (<= 0 .cse2)) 1 0))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, #memory_int=|v_#memory_int_264|, ~n~0=v_~n~0_181, ~x1~0=v_~x1~0_309, ~f~0.offset=v_~f~0.offset_174} OutVars{~x2~0=v_~x2~0_232, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_176|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_174|, ~x1~0=v_~x1~0_308, ~f~0.offset=v_~f~0.offset_174, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_234|, #memory_int=|v_#memory_int_264|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_103|, ~n~0=v_~n~0_181, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_103|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_184|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [665] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_270| v_~f~0.base_180))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_180 (* v_~x1~0_321 4)))) (.cse0 (* 2 (mod v_~n~0_187 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_180 (* v_~x2~0_245 4))))) (and (not (= (ite (and (< v_~x1~0_321 v_~size~0_188) (<= 0 v_~x1~0_321)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_183|) |v_thread2Thread1of1ForFork1_~i~1#1_182|) (= |v_thread1Thread1of1ForFork0_~i~0#1_242| (+ |v_thread1Thread1of1ForFork0_~i~0#1_243| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_242| 4294967295) 4294967296) .cse0) (= v_~x2~0_244 (select .cse1 (+ v_~f~0.offset_180 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| (ite (and (< .cse3 v_~size~0_188) (<= 0 .cse3)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_243| 4294967296) .cse0) (= v_~x1~0_320 (select .cse1 (+ v_~f~0.offset_180 (* .cse3 4)))) (not (= (ite (and (< v_~x2~0_245 v_~size~0_188) (<= 0 v_~x2~0_245)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_183| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_188)) 1 0))))) InVars {~x2~0=v_~x2~0_245, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_243|, #memory_int=|v_#memory_int_270|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_183|, ~n~0=v_~n~0_187, ~x1~0=v_~x1~0_321, ~f~0.offset=v_~f~0.offset_180} OutVars{~x2~0=v_~x2~0_244, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_182|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_182|, ~x1~0=v_~x1~0_320, ~f~0.offset=v_~f~0.offset_180, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_242|, #memory_int=|v_#memory_int_270|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_109|, ~n~0=v_~n~0_187, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_190|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:51,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_264| v_~f~0.base_174))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_174 (* v_~x1~0_309 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_174 (* v_~x2~0_233 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_234| 2) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_182)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|) (not (= (ite (and (< v_~x1~0_309 v_~size~0_182) (<= 0 v_~x1~0_309)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (= v_~x1~0_308 (select .cse1 (+ v_~f~0.offset_174 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_233) (< v_~x2~0_233 v_~size~0_182)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_174|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (= v_~x2~0_232 (select .cse1 (+ v_~f~0.offset_174 (* .cse2 4)))) (< 0 (* 2 (mod v_~n~0_181 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| (ite (and (< .cse2 v_~size~0_182) (<= 0 .cse2)) 1 0))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, #memory_int=|v_#memory_int_264|, ~n~0=v_~n~0_181, ~x1~0=v_~x1~0_309, ~f~0.offset=v_~f~0.offset_174} OutVars{~x2~0=v_~x2~0_232, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_176|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_174, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_174|, ~x1~0=v_~x1~0_308, ~f~0.offset=v_~f~0.offset_174, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_158|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_234|, #memory_int=|v_#memory_int_264|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_174|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_103|, ~n~0=v_~n~0_181, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_103|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_184|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:52,013 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_278| v_~f~0.base_188))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_188 (* v_~x1~0_339 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_188 (* v_~x2~0_262 4)))) (.cse0 (* 2 (mod v_~n~0_195 2147483648))) (.cse3 (select .cse1 (+ v_~f~0.offset_188 (* .cse4 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_166| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_199| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_200|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_200| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_166|) (= v_~x2~0_261 (select .cse1 (+ v_~f~0.offset_188 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_174| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|) (= (ite (and (< .cse3 v_~size~0_196) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_174|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_260| 4294967295) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| (ite (and (< .cse2 v_~size~0_196) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_262) (< v_~x2~0_262 v_~size~0_196)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_261| 4294967296) .cse0) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_261| 3) |v_thread1Thread1of1ForFork0_~i~0#1_260|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_339 v_~size~0_196) (<= 0 v_~x1~0_339)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190| 0)) (= v_~x1~0_338 (select .cse1 (+ v_~f~0.offset_188 (* .cse3 4)))))))) InVars {~x2~0=v_~x2~0_262, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_188, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_261|, #memory_int=|v_#memory_int_278|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_200|, ~n~0=v_~n~0_195, ~x1~0=v_~x1~0_339, ~f~0.offset=v_~f~0.offset_188} OutVars{~x2~0=v_~x2~0_261, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_192|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_128|, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_188, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_132|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_199|, ~x1~0=v_~x1~0_338, ~f~0.offset=v_~f~0.offset_188, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_174|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_260|, #memory_int=|v_#memory_int_278|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_118|, ~n~0=v_~n~0_195, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_118|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_200|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:53,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [760] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_417| v_~f~0.base_302))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_302 (* v_~x2~0_477 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_302 (* .cse1 4))))) (let ((.cse0 (* 2 (mod v_~n~0_309 2147483648))) (.cse4 (select .cse3 (+ v_~f~0.offset_302 (* .cse2 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_510| 4294967296) .cse0) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_376|) 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_477 v_~size~0_310) (<= 0 v_~x2~0_477)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_356| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_372|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_310)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_310)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_372| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_356| (ite (and (< v_~x1~0_630 v_~size~0_310) (<= 0 v_~x1~0_630)) 1 0)) (= (select .cse3 (+ v_~f~0.offset_302 (* v_~x1~0_630 4))) v_~x1~0_629) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| (ite (and (< .cse4 v_~size~0_310) (<= 0 .cse4)) 1 0)) (= (select .cse3 (+ v_~f~0.offset_302 (* .cse4 4))) v_~x2~0_476) (= |v_thread1Thread1of1ForFork0_~i~0#1_509| (+ |v_thread1Thread1of1ForFork0_~i~0#1_510| 1)) (= |v_thread2Thread1of1ForFork1_~i~1#1_376| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|)))))) InVars {~x2~0=v_~x2~0_477, ~size~0=v_~size~0_310, ~f~0.base=v_~f~0.base_302, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_510|, #memory_int=|v_#memory_int_417|, ~n~0=v_~n~0_309, ~x1~0=v_~x1~0_630, ~f~0.offset=v_~f~0.offset_302} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_374|, ~x2~0=v_~x2~0_476, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_253|, ~size~0=v_~size~0_310, ~f~0.base=v_~f~0.base_302, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_257|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_267|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_376|, ~x1~0=v_~x1~0_629, ~f~0.offset=v_~f~0.offset_302, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_356|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_509|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_372|, #memory_int=|v_#memory_int_417|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_243|, ~n~0=v_~n~0_309, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_382|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_243|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:54,067 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:58:54,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4544 [2022-12-06 07:58:54,067 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 237 transitions, 6145 flow [2022-12-06 07:58:54,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:54,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:54,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:54,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:54,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 07:58:54,268 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -330347924, now seen corresponding path program 1 times [2022-12-06 07:58:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:54,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500970021] [2022-12-06 07:58:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500970021] [2022-12-06 07:58:54,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500970021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:58:54,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:58:54,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:58:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302074498] [2022-12-06 07:58:54,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:58:54,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:58:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:58:54,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:58:54,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 07:58:54,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 237 transitions, 6145 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:54,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:54,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 07:58:54,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:54,964 INFO L130 PetriNetUnfolder]: 1201/2284 cut-off events. [2022-12-06 07:58:54,965 INFO L131 PetriNetUnfolder]: For 99275/99275 co-relation queries the response was YES. [2022-12-06 07:58:54,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26414 conditions, 2284 events. 1201/2284 cut-off events. For 99275/99275 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14922 event pairs, 565 based on Foata normal form. 4/2286 useless extension candidates. Maximal degree in co-relation 25622. Up to 2151 conditions per place. [2022-12-06 07:58:54,986 INFO L137 encePairwiseOnDemand]: 40/61 looper letters, 220 selfloop transitions, 33 changer transitions 5/258 dead transitions. [2022-12-06 07:58:54,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 258 transitions, 7018 flow [2022-12-06 07:58:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:58:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:58:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-06 07:58:54,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.226775956284153 [2022-12-06 07:58:54,987 INFO L175 Difference]: Start difference. First operand has 211 places, 237 transitions, 6145 flow. Second operand 6 states and 83 transitions. [2022-12-06 07:58:54,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 258 transitions, 7018 flow [2022-12-06 07:58:55,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 258 transitions, 6347 flow, removed 277 selfloop flow, removed 12 redundant places. [2022-12-06 07:58:55,279 INFO L231 Difference]: Finished difference. Result has 205 places, 234 transitions, 5514 flow [2022-12-06 07:58:55,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=5494, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5514, PETRI_PLACES=205, PETRI_TRANSITIONS=234} [2022-12-06 07:58:55,279 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 184 predicate places. [2022-12-06 07:58:55,279 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:55,279 INFO L89 Accepts]: Start accepts. Operand has 205 places, 234 transitions, 5514 flow [2022-12-06 07:58:55,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:55,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:55,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 234 transitions, 5514 flow [2022-12-06 07:58:55,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 234 transitions, 5514 flow [2022-12-06 07:58:55,408 INFO L130 PetriNetUnfolder]: 304/926 cut-off events. [2022-12-06 07:58:55,409 INFO L131 PetriNetUnfolder]: For 37757/37887 co-relation queries the response was YES. [2022-12-06 07:58:55,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9966 conditions, 926 events. 304/926 cut-off events. For 37757/37887 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7320 event pairs, 68 based on Foata normal form. 10/907 useless extension candidates. Maximal degree in co-relation 9596. Up to 338 conditions per place. [2022-12-06 07:58:55,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 234 transitions, 5514 flow [2022-12-06 07:58:55,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 07:58:56,005 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_419| v_~f~0.base_304))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_304 (* v_~x1~0_635 4)))) (.cse1 (select .cse3 (+ v_~f~0.offset_304 (* v_~x2~0_482 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse1)))) (.cse0 (select .cse3 (+ v_~f~0.offset_304 (* .cse2 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_304 (* .cse0 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_304 (* .cse5 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374| 0)) (not (= (ite (and (< .cse0 v_~size~0_312) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_312) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_312)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_378|) 4294967296) (* (mod v_~n~0_311 2147483648) 2)) (= (select .cse3 (+ v_~f~0.offset_304 (* .cse4 4))) v_~x2~0_480) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_312)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|) (= v_~x1~0_633 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse6)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| (ite (and (< .cse6 v_~size~0_312) (<= 0 .cse6)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_378| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< v_~x2~0_482 v_~size~0_312) (<= 0 v_~x2~0_482)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_635 v_~size~0_312) (<= 0 v_~x1~0_635)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| (ite (and (< .cse4 v_~size~0_312) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_513| 4)))))) InVars {~x2~0=v_~x2~0_482, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, #memory_int=|v_#memory_int_419|, ~n~0=v_~n~0_311, ~x1~0=v_~x1~0_635, ~f~0.offset=v_~f~0.offset_304} OutVars{~x2~0=v_~x2~0_480, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_376|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_378|, ~x1~0=v_~x1~0_633, ~f~0.offset=v_~f~0.offset_304, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_513|, #memory_int=|v_#memory_int_419|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_311, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [770] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_427| v_~f~0.base_312))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_312 (* v_~x2~0_502 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_312 (* v_~x1~0_656 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_312 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_312 (* .cse4 4)))) (.cse3 (* (mod v_~n~0_319 2147483648) 2)) (.cse5 (select .cse0 (+ v_~f~0.offset_312 (* .cse6 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_281| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_305|) (= (select .cse0 (+ v_~f~0.offset_312 (* .cse1 4))) v_~x2~0_500) (not (= (ite (and (<= 0 v_~x1~0_656) (< v_~x1~0_656 v_~size~0_320)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_320)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_530| 4294967296) .cse3) (< (mod (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_394|) 4294967296) .cse3) (= |v_thread2Thread1of1ForFork1_~i~1#1_392| (+ |v_thread2Thread1of1ForFork1_~i~1#1_394| 4)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_394| 4294967296) .cse3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_305| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_281| (ite (and (< .cse1 v_~size~0_320) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_320)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_529| (+ |v_thread1Thread1of1ForFork0_~i~0#1_530| 3)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_529| 4294967295) 4294967296) .cse3) (not (= (ite (and (<= 0 v_~x2~0_502) (< v_~x2~0_502 v_~size~0_320)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_320)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372|) (= (select .cse0 (+ v_~f~0.offset_312 (* 4 .cse5))) v_~x1~0_655) (not (= (ite (and (< .cse6 v_~size~0_320) (<= 0 .cse6)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_502, ~size~0=v_~size~0_320, ~f~0.base=v_~f~0.base_312, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_530|, #memory_int=|v_#memory_int_427|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_394|, ~n~0=v_~n~0_319, ~x1~0=v_~x1~0_656, ~f~0.offset=v_~f~0.offset_312} OutVars{~x2~0=v_~x2~0_500, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_390|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_267|, ~size~0=v_~size~0_320, ~f~0.base=v_~f~0.base_312, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_271|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_281|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_392|, ~x1~0=v_~x1~0_655, ~f~0.offset=v_~f~0.offset_312, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_305|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_529|, #memory_int=|v_#memory_int_427|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_257|, ~n~0=v_~n~0_319, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_257|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_398|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:57,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_419| v_~f~0.base_304))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_304 (* v_~x1~0_635 4)))) (.cse1 (select .cse3 (+ v_~f~0.offset_304 (* v_~x2~0_482 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse1)))) (.cse0 (select .cse3 (+ v_~f~0.offset_304 (* .cse2 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_304 (* .cse0 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_304 (* .cse5 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374| 0)) (not (= (ite (and (< .cse0 v_~size~0_312) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_312) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_312)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_378|) 4294967296) (* (mod v_~n~0_311 2147483648) 2)) (= (select .cse3 (+ v_~f~0.offset_304 (* .cse4 4))) v_~x2~0_480) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_312)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|) (= v_~x1~0_633 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse6)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| (ite (and (< .cse6 v_~size~0_312) (<= 0 .cse6)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_378| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< v_~x2~0_482 v_~size~0_312) (<= 0 v_~x2~0_482)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_635 v_~size~0_312) (<= 0 v_~x1~0_635)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| (ite (and (< .cse4 v_~size~0_312) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_513| 4)))))) InVars {~x2~0=v_~x2~0_482, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, #memory_int=|v_#memory_int_419|, ~n~0=v_~n~0_311, ~x1~0=v_~x1~0_635, ~f~0.offset=v_~f~0.offset_304} OutVars{~x2~0=v_~x2~0_480, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_376|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_378|, ~x1~0=v_~x1~0_633, ~f~0.offset=v_~f~0.offset_304, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_513|, #memory_int=|v_#memory_int_419|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_311, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:57,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_419| v_~f~0.base_304))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_304 (* v_~x1~0_635 4)))) (.cse1 (select .cse3 (+ v_~f~0.offset_304 (* v_~x2~0_482 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse1)))) (.cse0 (select .cse3 (+ v_~f~0.offset_304 (* .cse2 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_304 (* .cse0 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_304 (* .cse5 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374| 0)) (not (= (ite (and (< .cse0 v_~size~0_312) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_312) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_312)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_378|) 4294967296) (* (mod v_~n~0_311 2147483648) 2)) (= (select .cse3 (+ v_~f~0.offset_304 (* .cse4 4))) v_~x2~0_480) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_312)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|) (= v_~x1~0_633 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse6)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| (ite (and (< .cse6 v_~size~0_312) (<= 0 .cse6)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_378| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< v_~x2~0_482 v_~size~0_312) (<= 0 v_~x2~0_482)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_635 v_~size~0_312) (<= 0 v_~x1~0_635)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| (ite (and (< .cse4 v_~size~0_312) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_513| 4)))))) InVars {~x2~0=v_~x2~0_482, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, #memory_int=|v_#memory_int_419|, ~n~0=v_~n~0_311, ~x1~0=v_~x1~0_635, ~f~0.offset=v_~f~0.offset_304} OutVars{~x2~0=v_~x2~0_480, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_376|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_378|, ~x1~0=v_~x1~0_633, ~f~0.offset=v_~f~0.offset_304, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_513|, #memory_int=|v_#memory_int_419|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_311, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:58:58,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_419| v_~f~0.base_304))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_304 (* v_~x1~0_635 4)))) (.cse1 (select .cse3 (+ v_~f~0.offset_304 (* v_~x2~0_482 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse1)))) (.cse0 (select .cse3 (+ v_~f~0.offset_304 (* .cse2 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_304 (* .cse0 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_304 (* .cse5 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374| 0)) (not (= (ite (and (< .cse0 v_~size~0_312) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_312) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_312)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_378|) 4294967296) (* (mod v_~n~0_311 2147483648) 2)) (= (select .cse3 (+ v_~f~0.offset_304 (* .cse4 4))) v_~x2~0_480) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_312)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|) (= v_~x1~0_633 (select .cse3 (+ v_~f~0.offset_304 (* 4 .cse6)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358| (ite (and (< .cse6 v_~size~0_312) (<= 0 .cse6)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_378| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (< v_~x2~0_482 v_~size~0_312) (<= 0 v_~x2~0_482)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_635 v_~size~0_312) (<= 0 v_~x1~0_635)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269| (ite (and (< .cse4 v_~size~0_312) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_513| 4)))))) InVars {~x2~0=v_~x2~0_482, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, #memory_int=|v_#memory_int_419|, ~n~0=v_~n~0_311, ~x1~0=v_~x1~0_635, ~f~0.offset=v_~f~0.offset_304} OutVars{~x2~0=v_~x2~0_480, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_376|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_312, ~f~0.base=v_~f~0.base_304, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_378|, ~x1~0=v_~x1~0_633, ~f~0.offset=v_~f~0.offset_304, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_293|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_358|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_513|, #memory_int=|v_#memory_int_419|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_245|, ~n~0=v_~n~0_311, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [768] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_425| v_~f~0.base_310))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_310 (* v_~x1~0_651 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_310 (* 4 .cse3))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_310 (* .cse1 4)))) (.cse0 (* 2 (mod v_~n~0_317 2147483648))) (.cse2 (select .cse4 (+ v_~f~0.offset_310 (* v_~x2~0_497 4))))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_389| 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_318) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_303| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279| (ite (and (< .cse2 v_~size~0_318) (<= 0 .cse2)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_318) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_651) (< v_~x1~0_651 v_~size~0_318)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_523| (+ |v_thread1Thread1of1ForFork0_~i~0#1_525| 4)) (= |v_thread2Thread1of1ForFork1_~i~1#1_388| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_389|)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_384| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_523| 4294967294) 4294967296) .cse0) (= v_~x1~0_649 (select .cse4 (+ v_~f~0.offset_310 (* .cse5 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_368| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_384|) (not (= (ite (and (<= 0 v_~x2~0_497) (< v_~x2~0_497 v_~size~0_318)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_303|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_525| 4294967296) .cse0) (= (ite (and (< .cse5 v_~size~0_318) (<= 0 .cse5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_368|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_523| 4294967295) 4294967296) .cse0) (= (select .cse4 (+ v_~f~0.offset_310 (* .cse2 4))) v_~x2~0_496)))))) InVars {~x2~0=v_~x2~0_497, ~size~0=v_~size~0_318, ~f~0.base=v_~f~0.base_310, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_525|, #memory_int=|v_#memory_int_425|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_389|, ~n~0=v_~n~0_317, ~x1~0=v_~x1~0_651, ~f~0.offset=v_~f~0.offset_310} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_386|, ~x2~0=v_~x2~0_496, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_265|, ~size~0=v_~size~0_318, ~f~0.base=v_~f~0.base_310, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_269|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_388|, ~x1~0=v_~x1~0_649, ~f~0.offset=v_~f~0.offset_310, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_303|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_368|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_523|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_384|, #memory_int=|v_#memory_int_425|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_255|, ~n~0=v_~n~0_317, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_394|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_255|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:58,982 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:58:58,983 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3704 [2022-12-06 07:58:58,983 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 234 transitions, 5603 flow [2022-12-06 07:58:58,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:58,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:58,983 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:58,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 07:58:58,983 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:58:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1624593122, now seen corresponding path program 1 times [2022-12-06 07:58:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:58,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692335894] [2022-12-06 07:58:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:59,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692335894] [2022-12-06 07:58:59,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692335894] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:59,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96933284] [2022-12-06 07:58:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:59,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:59,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:59,718 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:59,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 07:58:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:59,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 07:58:59,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:59,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:58:59,855 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 32 [2022-12-06 07:58:59,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:58:59,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 07:58:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:59,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:59:00,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:59:00,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-06 07:59:00,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:59:00,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-06 07:59:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:06,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96933284] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:59:06,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:59:06,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:59:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032602684] [2022-12-06 07:59:06,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:59:06,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:59:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:59:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:59:06,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 07:59:06,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 234 transitions, 5603 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:59:06,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:06,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 07:59:06,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:07,938 INFO L130 PetriNetUnfolder]: 1356/2546 cut-off events. [2022-12-06 07:59:07,938 INFO L131 PetriNetUnfolder]: For 104840/104840 co-relation queries the response was YES. [2022-12-06 07:59:07,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28748 conditions, 2546 events. 1356/2546 cut-off events. For 104840/104840 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 16809 event pairs, 350 based on Foata normal form. 3/2549 useless extension candidates. Maximal degree in co-relation 27923. Up to 1864 conditions per place. [2022-12-06 07:59:07,960 INFO L137 encePairwiseOnDemand]: 19/61 looper letters, 191 selfloop transitions, 129 changer transitions 24/344 dead transitions. [2022-12-06 07:59:07,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 344 transitions, 8303 flow [2022-12-06 07:59:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:59:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:59:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2022-12-06 07:59:07,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18969555035128804 [2022-12-06 07:59:07,961 INFO L175 Difference]: Start difference. First operand has 201 places, 234 transitions, 5603 flow. Second operand 14 states and 162 transitions. [2022-12-06 07:59:07,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 344 transitions, 8303 flow [2022-12-06 07:59:08,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 344 transitions, 8113 flow, removed 76 selfloop flow, removed 5 redundant places. [2022-12-06 07:59:08,219 INFO L231 Difference]: Finished difference. Result has 213 places, 269 transitions, 6870 flow [2022-12-06 07:59:08,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=5445, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6870, PETRI_PLACES=213, PETRI_TRANSITIONS=269} [2022-12-06 07:59:08,219 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 192 predicate places. [2022-12-06 07:59:08,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:59:08,219 INFO L89 Accepts]: Start accepts. Operand has 213 places, 269 transitions, 6870 flow [2022-12-06 07:59:08,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:59:08,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:59:08,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 269 transitions, 6870 flow [2022-12-06 07:59:08,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 269 transitions, 6870 flow [2022-12-06 07:59:08,352 INFO L130 PetriNetUnfolder]: 348/1035 cut-off events. [2022-12-06 07:59:08,353 INFO L131 PetriNetUnfolder]: For 44609/44761 co-relation queries the response was YES. [2022-12-06 07:59:08,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11740 conditions, 1035 events. 348/1035 cut-off events. For 44609/44761 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8307 event pairs, 73 based on Foata normal form. 14/1020 useless extension candidates. Maximal degree in co-relation 11369. Up to 391 conditions per place. [2022-12-06 07:59:08,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 212 places, 269 transitions, 6870 flow [2022-12-06 07:59:08,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-06 07:59:08,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [663] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_266| v_~f~0.base_176))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_176 (* v_~x1~0_313 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_176 (* v_~x2~0_237 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (= (ite (and (< v_~x2~0_237 v_~size~0_184) (<= 0 v_~x2~0_237)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_313) (< v_~x1~0_313 v_~size~0_184)) 1 0))) (= v_~x1~0_312 (select .cse0 (+ v_~f~0.offset_176 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_236| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_236| 4294967295) 4294967296) (* (mod v_~n~0_183 2147483648) 2)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_176|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (< .cse2 v_~size~0_184) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| (ite (and (< .cse1 v_~size~0_184) (<= 0 .cse1)) 1 0)) (= v_~x2~0_236 (select .cse0 (+ v_~f~0.offset_176 (* .cse2 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, #memory_int=|v_#memory_int_266|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_313, ~f~0.offset=v_~f~0.offset_176} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_178|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_119|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_176|, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_176, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_236|, #memory_int=|v_#memory_int_266|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_105|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_105|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_186|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [667] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_274| v_~f~0.base_184))) (let ((.cse0 (* 2 (mod v_~n~0_191 2147483648))) (.cse1 (select .cse2 (+ v_~f~0.offset_184 (* v_~x2~0_253 4))))) (and (= (ite (and (< v_~x1~0_329 v_~size~0_192) (<= 0 v_~x1~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_251| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_253 v_~size~0_192) (<= 0 v_~x2~0_253)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_191|) |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= |v_thread1Thread1of1ForFork0_~i~0#1_250| (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_191| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_184 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= v_~x1~0_328 (select .cse2 (+ v_~f~0.offset_184 (* v_~x1~0_329 4))))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, #memory_int=|v_#memory_int_274|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_190|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_250|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_113|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_113|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:59:08,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [663] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_266| v_~f~0.base_176))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_176 (* v_~x1~0_313 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_176 (* v_~x2~0_237 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (= (ite (and (< v_~x2~0_237 v_~size~0_184) (<= 0 v_~x2~0_237)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_313) (< v_~x1~0_313 v_~size~0_184)) 1 0))) (= v_~x1~0_312 (select .cse0 (+ v_~f~0.offset_176 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_236| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_236| 4294967295) 4294967296) (* (mod v_~n~0_183 2147483648) 2)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_176|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (< .cse2 v_~size~0_184) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| (ite (and (< .cse1 v_~size~0_184) (<= 0 .cse1)) 1 0)) (= v_~x2~0_236 (select .cse0 (+ v_~f~0.offset_176 (* .cse2 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, #memory_int=|v_#memory_int_266|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_313, ~f~0.offset=v_~f~0.offset_176} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_178|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_119|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_176|, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_176, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_236|, #memory_int=|v_#memory_int_266|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_105|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_105|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_186|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [755] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_411| v_~f~0.base_296))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_296 (* v_~x2~0_462 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_296 (* .cse3 4))))) (let ((.cse0 (* 2 (mod v_~n~0_303 2147483648))) (.cse4 (select .cse1 (+ v_~f~0.offset_296 (* .cse2 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_500| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_364| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366| 0)) (= (select .cse1 (+ v_~f~0.offset_296 (* v_~x1~0_620 4))) v_~x1~0_619) (not (= (ite (and (< .cse2 v_~size~0_304) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_304) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281| 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_362|) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_499| (+ |v_thread1Thread1of1ForFork0_~i~0#1_500| 1)) (= (ite (and (<= 0 v_~x1~0_620) (< v_~x1~0_620 v_~size~0_304)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350|) (= |v_thread2Thread1of1ForFork1_~i~1#1_362| (+ |v_thread2Thread1of1ForFork1_~i~1#1_364| 4)) (= v_~x2~0_460 (select .cse1 (+ v_~f~0.offset_296 (* .cse4 4)))) (not (= (ite (and (< v_~x2~0_462 v_~size~0_304) (<= 0 v_~x2~0_462)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257| (ite (and (< .cse4 v_~size~0_304) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|)))))) InVars {~x2~0=v_~x2~0_462, ~size~0=v_~size~0_304, ~f~0.base=v_~f~0.base_296, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_500|, #memory_int=|v_#memory_int_411|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_364|, ~n~0=v_~n~0_303, ~x1~0=v_~x1~0_620, ~f~0.offset=v_~f~0.offset_296} OutVars{~x2~0=v_~x2~0_460, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_368|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_243|, ~size~0=v_~size~0_304, ~f~0.base=v_~f~0.base_296, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_247|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_362|, ~x1~0=v_~x1~0_619, ~f~0.offset=v_~f~0.offset_296, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_499|, #memory_int=|v_#memory_int_411|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_233|, ~n~0=v_~n~0_303, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_233|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_376|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:59:09,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [663] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_266| v_~f~0.base_176))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_176 (* v_~x1~0_313 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_176 (* v_~x2~0_237 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (= (ite (and (< v_~x2~0_237 v_~size~0_184) (<= 0 v_~x2~0_237)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_313) (< v_~x1~0_313 v_~size~0_184)) 1 0))) (= v_~x1~0_312 (select .cse0 (+ v_~f~0.offset_176 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_236| 2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_236| 4294967295) 4294967296) (* (mod v_~n~0_183 2147483648) 2)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_176|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (< .cse2 v_~size~0_184) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160| (ite (and (< .cse1 v_~size~0_184) (<= 0 .cse1)) 1 0)) (= v_~x2~0_236 (select .cse0 (+ v_~f~0.offset_176 (* .cse2 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, #memory_int=|v_#memory_int_266|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_313, ~f~0.offset=v_~f~0.offset_176} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_178|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, ~size~0=v_~size~0_184, ~f~0.base=v_~f~0.base_176, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_119|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_176|, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_176, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_160|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_236|, #memory_int=|v_#memory_int_266|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_105|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_105|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_186|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [668] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_276| v_~f~0.base_186))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_186 (* v_~x1~0_335 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_186 (* v_~x2~0_258 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_186 (* .cse2 4)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_256| 4294967295) 4294967296) .cse0) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_196|) |v_thread2Thread1of1ForFork1_~i~1#1_195|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_194)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_335 v_~size~0_194) (<= 0 v_~x1~0_335)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_256| (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= v_~x1~0_334 (select .cse3 (+ v_~f~0.offset_186 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188| 0)) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_194)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_186 (* .cse1 4))) v_~x2~0_257) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_196| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, #memory_int=|v_#memory_int_276|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_196|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_335, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_257, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_190|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_126|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_195|, ~x1~0=v_~x1~0_334, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_256|, #memory_int=|v_#memory_int_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_116|, ~n~0=v_~n~0_193, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_116|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:59:10,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_274| v_~f~0.base_184))) (let ((.cse0 (* 2 (mod v_~n~0_191 2147483648))) (.cse1 (select .cse2 (+ v_~f~0.offset_184 (* v_~x2~0_253 4))))) (and (= (ite (and (< v_~x1~0_329 v_~size~0_192) (<= 0 v_~x1~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_251| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_253 v_~size~0_192) (<= 0 v_~x2~0_253)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_191|) |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= |v_thread1Thread1of1ForFork0_~i~0#1_250| (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_191| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_184 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= v_~x1~0_328 (select .cse2 (+ v_~f~0.offset_184 (* v_~x1~0_329 4))))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, #memory_int=|v_#memory_int_274|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_190|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_250|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_113|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_113|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:59:10,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [739] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_383| v_~f~0.base_276))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_276 (* v_~x2~0_419 4))))) (and (= v_~x2~0_418 (select .cse0 (+ v_~f~0.offset_276 (* .cse1 4)))) (= (ite (and (< v_~x1~0_576 v_~size~0_284) (<= 0 v_~x1~0_576)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_284)) 1 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_467| 4294967296) (* 2 (mod v_~n~0_283 2147483648))) (not (= (ite (and (<= 0 v_~x2~0_419) (< v_~x2~0_419 v_~size~0_284)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_336|) (= (select .cse0 (+ v_~f~0.offset_276 (* v_~x1~0_576 4))) v_~x1~0_575) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_466| (+ |v_thread1Thread1of1ForFork0_~i~0#1_467| 1))))) InVars {~x2~0=v_~x2~0_419, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_467|, #memory_int=|v_#memory_int_383|, ~n~0=v_~n~0_283, ~x1~0=v_~x1~0_576, ~f~0.offset=v_~f~0.offset_276} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_343|, ~x2~0=v_~x2~0_418, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_219|, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_336|, ~x1~0=v_~x1~0_575, ~f~0.offset=v_~f~0.offset_276, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_466|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|, #memory_int=|v_#memory_int_383|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_209|, ~n~0=v_~n~0_283, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_351|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_209|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:59:10,783 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:59:11,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:59:11,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_199| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_122 (* v_~x1~0_184 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_122 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| 0)) (not (= (ite (and (< .cse0 v_~size~0_132) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_122 (* .cse2 4))) v_~x1~0_182) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (not (= (ite (and (< v_~x1~0_184 v_~size~0_132) (<= 0 v_~x1~0_184)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_148| 4294967295) 4294967296) (* (mod v_~n~0_131 2147483648) 2)) (= (ite (and (< .cse2 v_~size~0_132) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|) (= |v_thread1Thread1of1ForFork0_~i~0#1_148| 3))))) InVars {~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_184, ~f~0.offset=v_~f~0.offset_122} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_82|, ~size~0=v_~size~0_132, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_182, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_108|, ~f~0.offset=v_~f~0.offset_122} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [739] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_383| v_~f~0.base_276))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_276 (* v_~x2~0_419 4))))) (and (= v_~x2~0_418 (select .cse0 (+ v_~f~0.offset_276 (* .cse1 4)))) (= (ite (and (< v_~x1~0_576 v_~size~0_284) (<= 0 v_~x1~0_576)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_284)) 1 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_467| 4294967296) (* 2 (mod v_~n~0_283 2147483648))) (not (= (ite (and (<= 0 v_~x2~0_419) (< v_~x2~0_419 v_~size~0_284)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_336|) (= (select .cse0 (+ v_~f~0.offset_276 (* v_~x1~0_576 4))) v_~x1~0_575) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_466| (+ |v_thread1Thread1of1ForFork0_~i~0#1_467| 1))))) InVars {~x2~0=v_~x2~0_419, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_467|, #memory_int=|v_#memory_int_383|, ~n~0=v_~n~0_283, ~x1~0=v_~x1~0_576, ~f~0.offset=v_~f~0.offset_276} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_343|, ~x2~0=v_~x2~0_418, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_219|, ~size~0=v_~size~0_284, ~f~0.base=v_~f~0.base_276, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_336|, ~x1~0=v_~x1~0_575, ~f~0.offset=v_~f~0.offset_276, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_257|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_325|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_466|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_341|, #memory_int=|v_#memory_int_383|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_209|, ~n~0=v_~n~0_283, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_351|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_209|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:59:11,762 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:59:11,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3544 [2022-12-06 07:59:11,763 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 267 transitions, 7096 flow [2022-12-06 07:59:11,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:59:11,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:59:11,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:59:11,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 07:59:11,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:59:11,964 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:59:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:59:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash -513479368, now seen corresponding path program 1 times [2022-12-06 07:59:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:59:11,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531047765] [2022-12-06 07:59:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:59:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:59:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531047765] [2022-12-06 07:59:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531047765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:59:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970247504] [2022-12-06 07:59:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:59:14,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:59:14,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:59:14,302 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:59:14,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 07:59:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:59:14,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 07:59:14,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:59:14,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:59:14,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 266 [2022-12-06 07:59:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:15,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:59:20,325 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-06 07:59:20,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 30 new quantified variables, introduced 120 case distinctions, treesize of input 131 treesize of output 1152 [2022-12-06 08:00:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:01,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970247504] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:01,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:01,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 08:00:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566822766] [2022-12-06 08:00:01,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:01,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 08:00:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 08:00:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 08:00:01,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:00:01,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 267 transitions, 7096 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:01,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:01,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:00:01,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:02,220 INFO L130 PetriNetUnfolder]: 1379/2586 cut-off events. [2022-12-06 08:00:02,220 INFO L131 PetriNetUnfolder]: For 118036/118036 co-relation queries the response was YES. [2022-12-06 08:00:02,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30236 conditions, 2586 events. 1379/2586 cut-off events. For 118036/118036 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 17171 event pairs, 573 based on Foata normal form. 1/2587 useless extension candidates. Maximal degree in co-relation 29378. Up to 2326 conditions per place. [2022-12-06 08:00:02,242 INFO L137 encePairwiseOnDemand]: 27/70 looper letters, 207 selfloop transitions, 87 changer transitions 3/297 dead transitions. [2022-12-06 08:00:02,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 297 transitions, 8145 flow [2022-12-06 08:00:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 08:00:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 08:00:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-06 08:00:02,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20612244897959184 [2022-12-06 08:00:02,243 INFO L175 Difference]: Start difference. First operand has 210 places, 267 transitions, 7096 flow. Second operand 7 states and 101 transitions. [2022-12-06 08:00:02,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 297 transitions, 8145 flow [2022-12-06 08:00:02,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 297 transitions, 7779 flow, removed 153 selfloop flow, removed 5 redundant places. [2022-12-06 08:00:02,535 INFO L231 Difference]: Finished difference. Result has 213 places, 274 transitions, 7217 flow [2022-12-06 08:00:02,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=6697, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7217, PETRI_PLACES=213, PETRI_TRANSITIONS=274} [2022-12-06 08:00:02,536 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 192 predicate places. [2022-12-06 08:00:02,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:02,536 INFO L89 Accepts]: Start accepts. Operand has 213 places, 274 transitions, 7217 flow [2022-12-06 08:00:02,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:02,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:02,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 274 transitions, 7217 flow [2022-12-06 08:00:02,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 274 transitions, 7217 flow [2022-12-06 08:00:02,686 INFO L130 PetriNetUnfolder]: 356/1050 cut-off events. [2022-12-06 08:00:02,686 INFO L131 PetriNetUnfolder]: For 46873/46993 co-relation queries the response was YES. [2022-12-06 08:00:02,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12202 conditions, 1050 events. 356/1050 cut-off events. For 46873/46993 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8450 event pairs, 74 based on Foata normal form. 5/1025 useless extension candidates. Maximal degree in co-relation 11803. Up to 405 conditions per place. [2022-12-06 08:00:02,699 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 274 transitions, 7217 flow [2022-12-06 08:00:02,699 INFO L188 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-06 08:00:02,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_429| v_~f~0.base_314))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_314 (* v_~x2~0_508 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_314 (* .cse3 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_314 (* .cse6 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_314 (* 4 .cse0))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_314 (* .cse5 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_314 (* v_~x1~0_660 4))))) (and (not (= 0 (ite (and (< .cse0 v_~size~0_322) (<= 0 .cse0)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_314 (* .cse2 4))) v_~x2~0_506) (= |v_thread1Thread1of1ForFork0_~i~0#1_533| 2) (not (= (ite (and (< v_~x2~0_508 v_~size~0_322) (<= 0 v_~x2~0_508)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_374| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_390|) (not (= (ite (and (< .cse3 v_~size~0_322) (<= 0 .cse3)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_398|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_285| (ite (and (< .cse2 v_~size~0_322) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_374| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_322)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_398|) 4294967296) (* (mod v_~n~0_321 2147483648) 2)) (not (= 0 (ite (and (< .cse5 v_~size~0_322) (<= 0 .cse5)) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_390| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309| 0)) (not (= (ite (and (< .cse6 v_~size~0_322) (<= 0 .cse6)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_314 (* .cse4 4))) v_~x1~0_659) (not (= (ite (and (<= 0 v_~x1~0_660) (< v_~x1~0_660 v_~size~0_322)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_285| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|)))))))) InVars {~x2~0=v_~x2~0_508, ~size~0=v_~size~0_322, ~f~0.base=v_~f~0.base_314, #memory_int=|v_#memory_int_429|, ~n~0=v_~n~0_321, ~x1~0=v_~x1~0_660, ~f~0.offset=v_~f~0.offset_314} OutVars{~x2~0=v_~x2~0_506, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_392|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_271|, ~size~0=v_~size~0_322, ~f~0.base=v_~f~0.base_314, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_275|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_285|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_398|, ~x1~0=v_~x1~0_659, ~f~0.offset=v_~f~0.offset_314, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_374|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_533|, #memory_int=|v_#memory_int_429|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_390|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_261|, ~n~0=v_~n~0_321, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_261|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_400|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:00:03,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:00:03,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 631 [2022-12-06 08:00:03,167 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 274 transitions, 7235 flow [2022-12-06 08:00:03,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:03,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:03,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:03,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:03,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-06 08:00:03,368 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1232472141, now seen corresponding path program 1 times [2022-12-06 08:00:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:03,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788865338] [2022-12-06 08:00:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:04,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788865338] [2022-12-06 08:00:04,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788865338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:04,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759483278] [2022-12-06 08:00:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:04,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:04,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:04,404 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:04,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 08:00:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:04,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 08:00:04,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:04,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:00:04,535 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 28 [2022-12-06 08:00:04,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:04,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 08:00:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:04,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:04,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:04,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-06 08:00:04,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:04,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-06 08:00:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:07,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759483278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:07,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:07,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 08:00:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911377480] [2022-12-06 08:00:07,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:07,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 08:00:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 08:00:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 08:00:07,437 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:00:07,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 274 transitions, 7235 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:07,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:07,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:00:07,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:09,041 INFO L130 PetriNetUnfolder]: 1448/2709 cut-off events. [2022-12-06 08:00:09,041 INFO L131 PetriNetUnfolder]: For 121307/121307 co-relation queries the response was YES. [2022-12-06 08:00:09,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31902 conditions, 2709 events. 1448/2709 cut-off events. For 121307/121307 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18161 event pairs, 339 based on Foata normal form. 1/2710 useless extension candidates. Maximal degree in co-relation 30663. Up to 2171 conditions per place. [2022-12-06 08:00:09,064 INFO L137 encePairwiseOnDemand]: 19/70 looper letters, 205 selfloop transitions, 120 changer transitions 16/341 dead transitions. [2022-12-06 08:00:09,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 341 transitions, 8987 flow [2022-12-06 08:00:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 08:00:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 08:00:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-12-06 08:00:09,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2022-12-06 08:00:09,065 INFO L175 Difference]: Start difference. First operand has 213 places, 274 transitions, 7235 flow. Second operand 11 states and 140 transitions. [2022-12-06 08:00:09,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 341 transitions, 8987 flow [2022-12-06 08:00:09,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 341 transitions, 8863 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 08:00:09,381 INFO L231 Difference]: Finished difference. Result has 223 places, 288 transitions, 7885 flow [2022-12-06 08:00:09,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=7111, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7885, PETRI_PLACES=223, PETRI_TRANSITIONS=288} [2022-12-06 08:00:09,382 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2022-12-06 08:00:09,382 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:09,382 INFO L89 Accepts]: Start accepts. Operand has 223 places, 288 transitions, 7885 flow [2022-12-06 08:00:09,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:09,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:09,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 288 transitions, 7885 flow [2022-12-06 08:00:09,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 288 transitions, 7885 flow [2022-12-06 08:00:09,529 INFO L130 PetriNetUnfolder]: 374/1100 cut-off events. [2022-12-06 08:00:09,529 INFO L131 PetriNetUnfolder]: For 51127/51271 co-relation queries the response was YES. [2022-12-06 08:00:09,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13044 conditions, 1100 events. 374/1100 cut-off events. For 51127/51271 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8980 event pairs, 79 based on Foata normal form. 6/1073 useless extension candidates. Maximal degree in co-relation 12642. Up to 427 conditions per place. [2022-12-06 08:00:09,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 288 transitions, 7885 flow [2022-12-06 08:00:09,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 806 [2022-12-06 08:00:09,544 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:00:09,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 08:00:09,544 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 288 transitions, 7885 flow [2022-12-06 08:00:09,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:09,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:09,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:09,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:09,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:09,747 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1511587205, now seen corresponding path program 1 times [2022-12-06 08:00:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617541740] [2022-12-06 08:00:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617541740] [2022-12-06 08:00:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617541740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329032220] [2022-12-06 08:00:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:09,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:09,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:09,818 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:09,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 08:00:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:09,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-06 08:00:09,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:09,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:00:09,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 08:00:09,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:00:09,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:00:10,131 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 08:00:10,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 70 [2022-12-06 08:00:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:10,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:12,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329032220] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:00:12,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:00:12,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 08:00:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200169293] [2022-12-06 08:00:12,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:00:12,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 08:00:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:12,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 08:00:12,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=115, Unknown=4, NotChecked=0, Total=156 [2022-12-06 08:00:12,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:00:12,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 288 transitions, 7885 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:12,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:12,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:00:12,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:12,761 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* c_~x1~0 4) c_~f~0.offset)) (.cse10 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (let ((.cse5 (select |c_#memory_int| c_~f~0.base))) (let ((.cse3 (select .cse5 .cse10))) (let ((.cse4 (select .cse5 (+ (* .cse3 4) c_~f~0.offset)))) (let ((.cse8 (select .cse5 .cse9)) (.cse7 (select .cse5 (+ c_~f~0.offset (* 4 .cse4))))) (let ((.cse0 (select .cse5 (+ c_~f~0.offset (* .cse7 4)))) (.cse1 (select .cse5 (+ c_~f~0.offset (* .cse8 4))))) (let ((.cse2 (select .cse5 (+ c_~f~0.offset (* .cse1 4)))) (.cse6 (select .cse5 (+ c_~f~0.offset (* 4 .cse0))))) (or (not (<= 0 .cse0)) (<= c_~size~0 .cse1) (< .cse1 0) (< .cse2 0) (not (< .cse3 c_~size~0)) (not (< .cse4 c_~size~0)) (not (< .cse0 c_~size~0)) (= (select .cse5 (+ c_~f~0.offset (* .cse2 4))) (select .cse5 (+ (* 4 .cse6) c_~f~0.offset))) (not (<= 0 .cse3)) (not (<= 0 .cse7)) (<= c_~size~0 .cse2) (<= c_~size~0 .cse6) (not (<= 0 .cse8)) (not (< .cse8 c_~size~0)) (< .cse6 0) (not (<= 0 .cse4)) (not (< .cse7 c_~size~0))))))))) (forall ((v_ArrVal_1479 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1479) c_~f~0.base))) (let ((.cse11 (select .cse16 .cse10))) (let ((.cse18 (select .cse16 (+ c_~f~0.offset (* .cse11 4))))) (let ((.cse17 (select .cse16 .cse9)) (.cse12 (select .cse16 (+ c_~f~0.offset (* .cse18 4))))) (let ((.cse19 (select .cse16 (+ (* .cse12 4) c_~f~0.offset))) (.cse14 (select .cse16 (+ c_~f~0.offset (* .cse17 4))))) (let ((.cse15 (select .cse16 (+ c_~f~0.offset (* .cse14 4)))) (.cse13 (select .cse16 (+ (* 4 .cse19) c_~f~0.offset)))) (or (not (<= 0 .cse11)) (not (< .cse12 c_~size~0)) (< .cse13 0) (< .cse14 0) (<= c_~size~0 .cse15) (= (select .cse16 (+ (* .cse15 4) c_~f~0.offset)) (select .cse16 (+ (* .cse13 4) c_~f~0.offset))) (not (< .cse17 c_~size~0)) (not (<= 0 .cse18)) (not (<= 0 .cse19)) (not (<= 0 .cse12)) (not (< .cse19 c_~size~0)) (not (< .cse18 c_~size~0)) (<= c_~size~0 .cse14) (< .cse15 0) (not (<= 0 .cse17)) (not (< .cse11 c_~size~0)) (<= c_~size~0 .cse13))))))))))) is different from false [2022-12-06 08:00:25,672 WARN L233 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 145 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 08:00:48,363 WARN L233 SmtUtils]: Spent 22.38s on a formula simplification. DAG size of input: 131 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 08:00:50,041 INFO L130 PetriNetUnfolder]: 1627/3028 cut-off events. [2022-12-06 08:00:50,041 INFO L131 PetriNetUnfolder]: For 148240/148240 co-relation queries the response was YES. [2022-12-06 08:00:50,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36534 conditions, 3028 events. 1627/3028 cut-off events. For 148240/148240 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 20554 event pairs, 597 based on Foata normal form. 15/3043 useless extension candidates. Maximal degree in co-relation 35123. Up to 2360 conditions per place. [2022-12-06 08:00:50,069 INFO L137 encePairwiseOnDemand]: 22/70 looper letters, 232 selfloop transitions, 147 changer transitions 5/384 dead transitions. [2022-12-06 08:00:50,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 384 transitions, 10873 flow [2022-12-06 08:00:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 08:00:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 08:00:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 150 transitions. [2022-12-06 08:00:50,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12605042016806722 [2022-12-06 08:00:50,071 INFO L175 Difference]: Start difference. First operand has 223 places, 288 transitions, 7885 flow. Second operand 17 states and 150 transitions. [2022-12-06 08:00:50,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 384 transitions, 10873 flow [2022-12-06 08:00:50,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 384 transitions, 10688 flow, removed 88 selfloop flow, removed 2 redundant places. [2022-12-06 08:00:50,499 INFO L231 Difference]: Finished difference. Result has 246 places, 327 transitions, 9529 flow [2022-12-06 08:00:50,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=7712, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9529, PETRI_PLACES=246, PETRI_TRANSITIONS=327} [2022-12-06 08:00:50,499 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 225 predicate places. [2022-12-06 08:00:50,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:50,499 INFO L89 Accepts]: Start accepts. Operand has 246 places, 327 transitions, 9529 flow [2022-12-06 08:00:50,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:50,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:50,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 327 transitions, 9529 flow [2022-12-06 08:00:50,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 327 transitions, 9529 flow [2022-12-06 08:00:50,705 INFO L130 PetriNetUnfolder]: 417/1206 cut-off events. [2022-12-06 08:00:50,705 INFO L131 PetriNetUnfolder]: For 71142/71334 co-relation queries the response was YES. [2022-12-06 08:00:50,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15414 conditions, 1206 events. 417/1206 cut-off events. For 71142/71334 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 9872 event pairs, 91 based on Foata normal form. 5/1171 useless extension candidates. Maximal degree in co-relation 15181. Up to 489 conditions per place. [2022-12-06 08:00:50,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 327 transitions, 9529 flow [2022-12-06 08:00:50,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-06 08:00:50,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [809] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_476| v_~f~0.base_354))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_354 (* v_~x2~0_595 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_354 (* .cse2 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_354 (* .cse3 4))))) (let ((.cse7 (select .cse4 (+ (* .cse1 4) v_~f~0.offset_354))) (.cse5 (select .cse4 (+ v_~f~0.offset_354 (* v_~x1~0_777 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_354 (* .cse5 4)))) (.cse6 (select .cse4 (+ v_~f~0.offset_354 (* .cse7 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_613| 3) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_362)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_448|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_362)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364| 0)) (not (= (ite (and (< .cse3 v_~size~0_362) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_595 v_~size~0_362) (<= 0 v_~x2~0_595)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464| 0)) (= (select .cse4 (+ v_~f~0.offset_354 (* .cse0 4))) v_~x1~0_775) (not (= (ite (and (< v_~x1~0_777 v_~size~0_362) (<= 0 v_~x1~0_777)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_362) (<= 0 .cse5)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_354 (* .cse6 4))) v_~x2~0_594) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_362)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_455|) 4294967296) (* (mod v_~n~0_361 2147483648) 2)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_455|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_448| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_340| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_340| (ite (and (< .cse6 v_~size~0_362) (<= 0 .cse6)) 1 0))))))))) InVars {~x2~0=v_~x2~0_595, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_354, #memory_int=|v_#memory_int_476|, ~n~0=v_~n~0_361, ~x1~0=v_~x1~0_777, ~f~0.offset=v_~f~0.offset_354} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_466|, ~x2~0=v_~x2~0_594, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_326|, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_354, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_330|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_340|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_455|, ~x1~0=v_~x1~0_775, ~f~0.offset=v_~f~0.offset_354, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_448|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_613|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_464|, #memory_int=|v_#memory_int_476|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_316|, ~n~0=v_~n~0_361, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_474|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_316|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:00:51,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_449| v_~f~0.base_332))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_332 (* v_~x2~0_560 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_332 (* .cse1 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_332 (* .cse4 4))))) (let ((.cse7 (select .cse6 (+ v_~f~0.offset_332 (* v_~x1~0_713 4)))) (.cse2 (select .cse6 (+ v_~f~0.offset_332 (* .cse3 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_332 (* .cse2 4)))) (.cse5 (select .cse6 (+ (* .cse7 4) v_~f~0.offset_332)))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_340)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_342|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_342| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_407| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_423|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_431|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_340)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_340)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_423| 0)) (not (= (ite (and (< .cse3 v_~size~0_340) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_570| 3) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_431|) 4294967296) (* (mod v_~n~0_339 2147483648) 2)) (not (= (ite (and (< .cse4 v_~size~0_340) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_713) (< v_~x1~0_713 v_~size~0_340)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_340)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_407|) (= v_~x2~0_558 (select .cse6 (+ v_~f~0.offset_332 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_560) (< v_~x2~0_560 v_~size~0_340)) 1 0) 0)) (= (select .cse6 (+ (* .cse5 4) v_~f~0.offset_332)) v_~x1~0_711) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_340)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_560, ~size~0=v_~size~0_340, ~f~0.base=v_~f~0.base_332, #memory_int=|v_#memory_int_449|, ~n~0=v_~n~0_339, ~x1~0=v_~x1~0_713, ~f~0.offset=v_~f~0.offset_332} OutVars{~x2~0=v_~x2~0_558, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_425|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_304|, ~size~0=v_~size~0_340, ~f~0.base=v_~f~0.base_332, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_308|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_431|, ~x1~0=v_~x1~0_711, ~f~0.offset=v_~f~0.offset_332, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_342|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_407|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_570|, #memory_int=|v_#memory_int_449|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_423|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_294|, ~n~0=v_~n~0_339, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_294|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_433|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:00:52,539 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 08:00:52,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2040 [2022-12-06 08:00:52,539 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 327 transitions, 9620 flow [2022-12-06 08:00:52,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:52,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:52,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:52,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 08:00:52,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:52,740 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash -961576725, now seen corresponding path program 1 times [2022-12-06 08:00:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:52,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200262917] [2022-12-06 08:00:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:52,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200262917] [2022-12-06 08:00:52,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200262917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:00:52,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:00:52,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 08:00:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735098805] [2022-12-06 08:00:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:00:52,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 08:00:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 08:00:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 08:00:52,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 08:00:52,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 327 transitions, 9620 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:52,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:52,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 08:00:52,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:53,718 INFO L130 PetriNetUnfolder]: 1651/3065 cut-off events. [2022-12-06 08:00:53,718 INFO L131 PetriNetUnfolder]: For 173145/173145 co-relation queries the response was YES. [2022-12-06 08:00:53,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39031 conditions, 3065 events. 1651/3065 cut-off events. For 173145/173145 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 20786 event pairs, 789 based on Foata normal form. 18/3083 useless extension candidates. Maximal degree in co-relation 38222. Up to 2941 conditions per place. [2022-12-06 08:00:53,744 INFO L137 encePairwiseOnDemand]: 61/73 looper letters, 317 selfloop transitions, 32 changer transitions 1/350 dead transitions. [2022-12-06 08:00:53,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 350 transitions, 10791 flow [2022-12-06 08:00:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 08:00:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 08:00:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 08:00:53,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2979452054794521 [2022-12-06 08:00:53,745 INFO L175 Difference]: Start difference. First operand has 246 places, 327 transitions, 9620 flow. Second operand 4 states and 87 transitions. [2022-12-06 08:00:53,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 350 transitions, 10791 flow [2022-12-06 08:00:54,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 350 transitions, 10246 flow, removed 234 selfloop flow, removed 4 redundant places. [2022-12-06 08:00:54,213 INFO L231 Difference]: Finished difference. Result has 247 places, 335 transitions, 9372 flow [2022-12-06 08:00:54,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=9089, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9372, PETRI_PLACES=247, PETRI_TRANSITIONS=335} [2022-12-06 08:00:54,213 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 226 predicate places. [2022-12-06 08:00:54,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:54,213 INFO L89 Accepts]: Start accepts. Operand has 247 places, 335 transitions, 9372 flow [2022-12-06 08:00:54,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:54,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:54,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 335 transitions, 9372 flow [2022-12-06 08:00:54,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 335 transitions, 9372 flow [2022-12-06 08:00:54,416 INFO L130 PetriNetUnfolder]: 426/1227 cut-off events. [2022-12-06 08:00:54,416 INFO L131 PetriNetUnfolder]: For 71829/72022 co-relation queries the response was YES. [2022-12-06 08:00:54,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15644 conditions, 1227 events. 426/1227 cut-off events. For 71829/72022 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10121 event pairs, 89 based on Foata normal form. 6/1194 useless extension candidates. Maximal degree in co-relation 15308. Up to 494 conditions per place. [2022-12-06 08:00:54,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 335 transitions, 9372 flow [2022-12-06 08:00:54,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 946 [2022-12-06 08:00:54,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:00:54,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 08:00:54,434 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 335 transitions, 9372 flow [2022-12-06 08:00:54,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:54,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:54,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:54,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 08:00:54,435 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1197574230, now seen corresponding path program 2 times [2022-12-06 08:00:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040063259] [2022-12-06 08:00:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:54,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:54,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040063259] [2022-12-06 08:00:54,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040063259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:00:54,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:00:54,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 08:00:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250174040] [2022-12-06 08:00:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:00:54,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 08:00:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:00:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 08:00:54,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 08:00:54,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 08:00:54,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 335 transitions, 9372 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:54,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:00:54,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 08:00:54,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:00:55,407 INFO L130 PetriNetUnfolder]: 1645/3061 cut-off events. [2022-12-06 08:00:55,407 INFO L131 PetriNetUnfolder]: For 171425/171425 co-relation queries the response was YES. [2022-12-06 08:00:55,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38930 conditions, 3061 events. 1645/3061 cut-off events. For 171425/171425 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 20808 event pairs, 813 based on Foata normal form. 4/3065 useless extension candidates. Maximal degree in co-relation 38312. Up to 3006 conditions per place. [2022-12-06 08:00:55,435 INFO L137 encePairwiseOnDemand]: 58/73 looper letters, 335 selfloop transitions, 16 changer transitions 2/353 dead transitions. [2022-12-06 08:00:55,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 353 transitions, 10466 flow [2022-12-06 08:00:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:00:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:00:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 08:00:55,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2493150684931507 [2022-12-06 08:00:55,436 INFO L175 Difference]: Start difference. First operand has 247 places, 335 transitions, 9372 flow. Second operand 5 states and 91 transitions. [2022-12-06 08:00:55,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 353 transitions, 10466 flow [2022-12-06 08:00:55,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 353 transitions, 10426 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-12-06 08:00:55,969 INFO L231 Difference]: Finished difference. Result has 252 places, 337 transitions, 9428 flow [2022-12-06 08:00:55,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=9336, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9428, PETRI_PLACES=252, PETRI_TRANSITIONS=337} [2022-12-06 08:00:55,970 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 231 predicate places. [2022-12-06 08:00:55,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:55,970 INFO L89 Accepts]: Start accepts. Operand has 252 places, 337 transitions, 9428 flow [2022-12-06 08:00:55,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:55,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:55,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 337 transitions, 9428 flow [2022-12-06 08:00:55,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 337 transitions, 9428 flow [2022-12-06 08:00:56,167 INFO L130 PetriNetUnfolder]: 424/1223 cut-off events. [2022-12-06 08:00:56,167 INFO L131 PetriNetUnfolder]: For 71289/71451 co-relation queries the response was YES. [2022-12-06 08:00:56,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15671 conditions, 1223 events. 424/1223 cut-off events. For 71289/71451 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10060 event pairs, 91 based on Foata normal form. 4/1190 useless extension candidates. Maximal degree in co-relation 15334. Up to 495 conditions per place. [2022-12-06 08:00:56,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 337 transitions, 9428 flow [2022-12-06 08:00:56,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 944 [2022-12-06 08:00:56,187 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:00:56,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 08:00:56,187 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 337 transitions, 9428 flow [2022-12-06 08:00:56,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:00:56,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:00:56,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:00:56,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 08:00:56,188 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:00:56,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:00:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1336433875, now seen corresponding path program 1 times [2022-12-06 08:00:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:00:56,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574856862] [2022-12-06 08:00:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:00:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:00:57,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574856862] [2022-12-06 08:00:57,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574856862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:00:57,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661884681] [2022-12-06 08:00:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:00:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:00:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:00:57,463 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:00:57,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 08:00:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:00:57,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 08:00:57,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:00:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:00:57,594 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 14 treesize of output 16 [2022-12-06 08:00:57,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:57,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 08:00:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:00:57,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:00:57,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:57,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-06 08:00:58,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:00:58,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-06 08:01:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:03,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661884681] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:03,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:03,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 08:01:03,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377302022] [2022-12-06 08:01:03,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:03,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 08:01:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 08:01:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 08:01:03,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 08:01:03,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 337 transitions, 9428 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:03,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:03,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 08:01:03,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:05,110 INFO L130 PetriNetUnfolder]: 1780/3294 cut-off events. [2022-12-06 08:01:05,110 INFO L131 PetriNetUnfolder]: For 188437/188437 co-relation queries the response was YES. [2022-12-06 08:01:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42659 conditions, 3294 events. 1780/3294 cut-off events. For 188437/188437 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 22709 event pairs, 465 based on Foata normal form. 1/3295 useless extension candidates. Maximal degree in co-relation 41583. Up to 2736 conditions per place. [2022-12-06 08:01:05,140 INFO L137 encePairwiseOnDemand]: 16/73 looper letters, 252 selfloop transitions, 155 changer transitions 4/411 dead transitions. [2022-12-06 08:01:05,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 411 transitions, 11896 flow [2022-12-06 08:01:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 08:01:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 08:01:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-12-06 08:01:05,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1656288916562889 [2022-12-06 08:01:05,141 INFO L175 Difference]: Start difference. First operand has 252 places, 337 transitions, 9428 flow. Second operand 11 states and 133 transitions. [2022-12-06 08:01:05,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 411 transitions, 11896 flow [2022-12-06 08:01:05,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 411 transitions, 11840 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 08:01:05,663 INFO L231 Difference]: Finished difference. Result has 263 places, 371 transitions, 11002 flow [2022-12-06 08:01:05,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=9382, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11002, PETRI_PLACES=263, PETRI_TRANSITIONS=371} [2022-12-06 08:01:05,664 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 242 predicate places. [2022-12-06 08:01:05,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:05,664 INFO L89 Accepts]: Start accepts. Operand has 263 places, 371 transitions, 11002 flow [2022-12-06 08:01:05,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:05,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:05,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 263 places, 371 transitions, 11002 flow [2022-12-06 08:01:05,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 371 transitions, 11002 flow [2022-12-06 08:01:05,887 INFO L130 PetriNetUnfolder]: 466/1323 cut-off events. [2022-12-06 08:01:05,887 INFO L131 PetriNetUnfolder]: For 80653/80842 co-relation queries the response was YES. [2022-12-06 08:01:05,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17761 conditions, 1323 events. 466/1323 cut-off events. For 80653/80842 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 11017 event pairs, 98 based on Foata normal form. 4/1288 useless extension candidates. Maximal degree in co-relation 17188. Up to 555 conditions per place. [2022-12-06 08:01:05,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 263 places, 371 transitions, 11002 flow [2022-12-06 08:01:05,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 1024 [2022-12-06 08:01:06,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [738] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_381| v_~f~0.base_274))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_274 (* v_~x2~0_414 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_274 (* v_~x1~0_571 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_274 (* .cse2 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_274 (* .cse1 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_274 (* 4 .cse3))))) (and (< 2 (* 2 (mod v_~n~0_281 2147483648))) (= (ite (and (< .cse0 v_~size~0_282) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321|) (= |v_thread1Thread1of1ForFork0_~i~0#1_462| 3) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_282)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_282)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337| 0)) (not (= (ite (and (< .cse3 v_~size~0_282) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| (ite (and (< .cse4 v_~size~0_282) (<= 0 .cse4)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_332| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_253| 0)) (= (select .cse5 (+ v_~f~0.offset_274 (* .cse4 4))) v_~x2~0_412) (not (= (ite (and (<= 0 v_~x1~0_571) (< v_~x1~0_571 v_~size~0_282)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_253|) (= v_~x1~0_569 (select .cse5 (+ v_~f~0.offset_274 (* .cse0 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337|) (not (= (ite (and (<= 0 v_~x2~0_414) (< v_~x2~0_414 v_~size~0_282)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_414, ~size~0=v_~size~0_282, ~f~0.base=v_~f~0.base_274, #memory_int=|v_#memory_int_381|, ~n~0=v_~n~0_281, ~x1~0=v_~x1~0_571, ~f~0.offset=v_~f~0.offset_274} OutVars{~x2~0=v_~x2~0_412, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_339|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_215|, ~size~0=v_~size~0_282, ~f~0.base=v_~f~0.base_274, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_219|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_332|, ~x1~0=v_~x1~0_569, ~f~0.offset=v_~f~0.offset_274, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_253|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_321|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_462|, #memory_int=|v_#memory_int_381|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_337|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_205|, ~n~0=v_~n~0_281, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_205|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_347|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:01:06,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_415| v_~f~0.base_300))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_300 (* v_~x2~0_472 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_300 (* 4 .cse0))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_300 (* 4 .cse3))))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_300 (* .cse4 4))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_300 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|) (< 4 (* 2 (mod v_~n~0_307 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_308)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_308) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| (ite (and (< .cse2 v_~size~0_308) (<= 0 .cse2)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_308) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_308) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_472 v_~size~0_308) (<= 0 v_~x2~0_472)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_300 (* .cse2 4))) v_~x2~0_470) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_372|)))))))) InVars {~x2~0=v_~x2~0_472, ~size~0=v_~size~0_308, ~f~0.base=v_~f~0.base_300, #memory_int=|v_#memory_int_415|, ~n~0=v_~n~0_307, ~f~0.offset=v_~f~0.offset_300} OutVars{~x2~0=v_~x2~0_470, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_249|, ~size~0=v_~size~0_308, ~f~0.base=v_~f~0.base_300, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_253|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_372|, ~f~0.offset=v_~f~0.offset_300, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|, #memory_int=|v_#memory_int_415|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_239|, ~n~0=v_~n~0_307, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_239|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [751] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_407| v_~f~0.base_292))) (let ((.cse2 (* 2 (mod v_~n~0_299 2147483648))) (.cse1 (select .cse0 (+ v_~f~0.offset_292 (* v_~x2~0_457 4))))) (and (= (select .cse0 (+ v_~f~0.offset_292 (* .cse1 4))) v_~x2~0_456) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_359| 4294967296) .cse2) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_490| 1) |v_thread1Thread1of1ForFork0_~i~0#1_489|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_490| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_255| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_255| (ite (and (< .cse1 v_~size~0_300) (<= 0 .cse1)) 1 0)) (= (select .cse0 (+ v_~f~0.offset_292 (* v_~x1~0_610 4))) v_~x1~0_609) (= (ite (and (<= 0 v_~x1~0_610) (< v_~x1~0_610 v_~size~0_300)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_344|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_360| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_344| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_360|) (not (= (ite (and (<= 0 v_~x2~0_457) (< v_~x2~0_457 v_~size~0_300)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_358| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_359|))))) InVars {~x2~0=v_~x2~0_457, ~size~0=v_~size~0_300, ~f~0.base=v_~f~0.base_292, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_490|, #memory_int=|v_#memory_int_407|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_359|, ~n~0=v_~n~0_299, ~x1~0=v_~x1~0_610, ~f~0.offset=v_~f~0.offset_292} OutVars{~x2~0=v_~x2~0_456, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_362|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_241|, ~size~0=v_~size~0_300, ~f~0.base=v_~f~0.base_292, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_245|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_255|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_358|, ~x1~0=v_~x1~0_609, ~f~0.offset=v_~f~0.offset_292, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_344|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_489|, #memory_int=|v_#memory_int_407|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_360|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_231|, ~n~0=v_~n~0_299, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_231|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_370|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:01:07,451 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 08:01:07,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1788 [2022-12-06 08:01:07,452 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 371 transitions, 11085 flow [2022-12-06 08:01:07,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:07,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:07,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:07,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:07,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:07,658 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash 846805007, now seen corresponding path program 1 times [2022-12-06 08:01:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:07,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459687540] [2022-12-06 08:01:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459687540] [2022-12-06 08:01:07,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459687540] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584773920] [2022-12-06 08:01:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:07,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:07,755 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 08:01:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:07,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:01:07,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:07,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:07,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584773920] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:07,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:07,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 08:01:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890907910] [2022-12-06 08:01:07,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:07,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 08:01:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 08:01:07,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 08:01:07,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-06 08:01:07,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 371 transitions, 11085 flow. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:07,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:07,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-06 08:01:07,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:11,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:01:12,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:01:15,521 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 [] [2022-12-06 08:01:17,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:01:18,800 INFO L130 PetriNetUnfolder]: 2032/3781 cut-off events. [2022-12-06 08:01:18,800 INFO L131 PetriNetUnfolder]: For 238158/238158 co-relation queries the response was YES. [2022-12-06 08:01:18,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51411 conditions, 3781 events. 2032/3781 cut-off events. For 238158/238158 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 26993 event pairs, 695 based on Foata normal form. 58/3839 useless extension candidates. Maximal degree in co-relation 49762. Up to 2553 conditions per place. [2022-12-06 08:01:18,839 INFO L137 encePairwiseOnDemand]: 30/76 looper letters, 264 selfloop transitions, 231 changer transitions 12/507 dead transitions. [2022-12-06 08:01:18,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 507 transitions, 16191 flow [2022-12-06 08:01:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 08:01:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 08:01:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 156 transitions. [2022-12-06 08:01:18,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14661654135338345 [2022-12-06 08:01:18,840 INFO L175 Difference]: Start difference. First operand has 264 places, 371 transitions, 11085 flow. Second operand 14 states and 156 transitions. [2022-12-06 08:01:18,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 507 transitions, 16191 flow [2022-12-06 08:01:19,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 507 transitions, 15557 flow, removed 292 selfloop flow, removed 3 redundant places. [2022-12-06 08:01:19,568 INFO L231 Difference]: Finished difference. Result has 284 places, 446 transitions, 14249 flow [2022-12-06 08:01:19,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=10781, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14249, PETRI_PLACES=284, PETRI_TRANSITIONS=446} [2022-12-06 08:01:19,569 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 263 predicate places. [2022-12-06 08:01:19,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:19,569 INFO L89 Accepts]: Start accepts. Operand has 284 places, 446 transitions, 14249 flow [2022-12-06 08:01:19,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:19,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:19,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 446 transitions, 14249 flow [2022-12-06 08:01:19,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 446 transitions, 14249 flow [2022-12-06 08:01:19,848 INFO L130 PetriNetUnfolder]: 532/1494 cut-off events. [2022-12-06 08:01:19,848 INFO L131 PetriNetUnfolder]: For 117971/118221 co-relation queries the response was YES. [2022-12-06 08:01:19,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22526 conditions, 1494 events. 532/1494 cut-off events. For 117971/118221 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 12745 event pairs, 93 based on Foata normal form. 8/1460 useless extension candidates. Maximal degree in co-relation 22293. Up to 659 conditions per place. [2022-12-06 08:01:19,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 446 transitions, 14249 flow [2022-12-06 08:01:19,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-06 08:01:20,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [755] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_411| v_~f~0.base_296))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_296 (* v_~x2~0_462 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_296 (* .cse3 4))))) (let ((.cse0 (* 2 (mod v_~n~0_303 2147483648))) (.cse4 (select .cse1 (+ v_~f~0.offset_296 (* .cse2 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_500| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_364| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366| 0)) (= (select .cse1 (+ v_~f~0.offset_296 (* v_~x1~0_620 4))) v_~x1~0_619) (not (= (ite (and (< .cse2 v_~size~0_304) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_304) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281| 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_362|) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_499| (+ |v_thread1Thread1of1ForFork0_~i~0#1_500| 1)) (= (ite (and (<= 0 v_~x1~0_620) (< v_~x1~0_620 v_~size~0_304)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350|) (= |v_thread2Thread1of1ForFork1_~i~1#1_362| (+ |v_thread2Thread1of1ForFork1_~i~1#1_364| 4)) (= v_~x2~0_460 (select .cse1 (+ v_~f~0.offset_296 (* .cse4 4)))) (not (= (ite (and (< v_~x2~0_462 v_~size~0_304) (<= 0 v_~x2~0_462)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257| (ite (and (< .cse4 v_~size~0_304) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|)))))) InVars {~x2~0=v_~x2~0_462, ~size~0=v_~size~0_304, ~f~0.base=v_~f~0.base_296, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_500|, #memory_int=|v_#memory_int_411|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_364|, ~n~0=v_~n~0_303, ~x1~0=v_~x1~0_620, ~f~0.offset=v_~f~0.offset_296} OutVars{~x2~0=v_~x2~0_460, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_368|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_243|, ~size~0=v_~size~0_304, ~f~0.base=v_~f~0.base_296, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_247|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_257|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_362|, ~x1~0=v_~x1~0_619, ~f~0.offset=v_~f~0.offset_296, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_350|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_499|, #memory_int=|v_#memory_int_411|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_366|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_233|, ~n~0=v_~n~0_303, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_233|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_376|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:01:22,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_415| v_~f~0.base_300))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_300 (* v_~x2~0_472 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_300 (* 4 .cse0))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_300 (* 4 .cse3))))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_300 (* .cse4 4))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_300 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|) (< 4 (* 2 (mod v_~n~0_307 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_308)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_308) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| (ite (and (< .cse2 v_~size~0_308) (<= 0 .cse2)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_308) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_308) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_472 v_~size~0_308) (<= 0 v_~x2~0_472)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_300 (* .cse2 4))) v_~x2~0_470) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_372|)))))))) InVars {~x2~0=v_~x2~0_472, ~size~0=v_~size~0_308, ~f~0.base=v_~f~0.base_300, #memory_int=|v_#memory_int_415|, ~n~0=v_~n~0_307, ~f~0.offset=v_~f~0.offset_300} OutVars{~x2~0=v_~x2~0_470, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_249|, ~size~0=v_~size~0_308, ~f~0.base=v_~f~0.base_300, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_253|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_372|, ~f~0.offset=v_~f~0.offset_300, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|, #memory_int=|v_#memory_int_415|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_239|, ~n~0=v_~n~0_307, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_239|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [753] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_409| v_~f~0.base_294))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_294 (* v_~x1~0_615 4)))) (.cse2 (* 2 (mod v_~n~0_301 2147483648)))) (and (= v_~x1~0_613 (select .cse0 (+ v_~f~0.offset_294 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_495| 2) |v_thread1Thread1of1ForFork0_~i~0#1_493|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_302)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362| 0)) (not (= (ite (and (<= 0 v_~x1~0_615) (< v_~x1~0_615 v_~size~0_302)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_495| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_493| 4294967295) 4294967296) .cse2)))) InVars {~size~0=v_~size~0_302, ~f~0.base=v_~f~0.base_294, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_495|, #memory_int=|v_#memory_int_409|, ~n~0=v_~n~0_301, ~x1~0=v_~x1~0_615, ~f~0.offset=v_~f~0.offset_294} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_364|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_346|, ~size~0=v_~size~0_302, ~f~0.base=v_~f~0.base_294, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_493|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_362|, #memory_int=|v_#memory_int_409|, ~n~0=v_~n~0_301, ~x1~0=v_~x1~0_613, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_372|, ~f~0.offset=v_~f~0.offset_294} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:01:22,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:23,376 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 08:01:23,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3808 [2022-12-06 08:01:23,377 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 446 transitions, 14476 flow [2022-12-06 08:01:23,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:23,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:23,377 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:23,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:23,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-06 08:01:23,580 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:23,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1286510845, now seen corresponding path program 1 times [2022-12-06 08:01:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:23,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085379908] [2022-12-06 08:01:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:23,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085379908] [2022-12-06 08:01:23,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085379908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:23,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734345580] [2022-12-06 08:01:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:23,662 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:23,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 08:01:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:23,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 08:01:23,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:23,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:01:23,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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 08:01:23,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:01:23,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:01:24,044 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 08:01:24,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 70 [2022-12-06 08:01:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:24,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:24,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734345580] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:24,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:24,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 08:01:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403359311] [2022-12-06 08:01:24,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:24,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 08:01:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 08:01:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=188, Unknown=3, NotChecked=0, Total=240 [2022-12-06 08:01:24,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 82 [2022-12-06 08:01:24,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 446 transitions, 14476 flow. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:24,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:24,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 82 [2022-12-06 08:01:24,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:34,918 WARN L233 SmtUtils]: Spent 10.22s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 08:01:38,730 INFO L130 PetriNetUnfolder]: 2390/4435 cut-off events. [2022-12-06 08:01:38,730 INFO L131 PetriNetUnfolder]: For 354242/354242 co-relation queries the response was YES. [2022-12-06 08:01:38,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67134 conditions, 4435 events. 2390/4435 cut-off events. For 354242/354242 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 32543 event pairs, 445 based on Foata normal form. 23/4458 useless extension candidates. Maximal degree in co-relation 66738. Up to 2195 conditions per place. [2022-12-06 08:01:38,771 INFO L137 encePairwiseOnDemand]: 14/82 looper letters, 225 selfloop transitions, 169 changer transitions 244/638 dead transitions. [2022-12-06 08:01:38,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 638 transitions, 22132 flow [2022-12-06 08:01:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 08:01:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 08:01:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 185 transitions. [2022-12-06 08:01:38,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10254988913525499 [2022-12-06 08:01:38,772 INFO L175 Difference]: Start difference. First operand has 282 places, 446 transitions, 14476 flow. Second operand 22 states and 185 transitions. [2022-12-06 08:01:38,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 638 transitions, 22132 flow [2022-12-06 08:01:40,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 638 transitions, 20152 flow, removed 976 selfloop flow, removed 4 redundant places. [2022-12-06 08:01:40,054 INFO L231 Difference]: Finished difference. Result has 308 places, 345 transitions, 11216 flow [2022-12-06 08:01:40,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=13370, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=11216, PETRI_PLACES=308, PETRI_TRANSITIONS=345} [2022-12-06 08:01:40,055 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 287 predicate places. [2022-12-06 08:01:40,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:40,055 INFO L89 Accepts]: Start accepts. Operand has 308 places, 345 transitions, 11216 flow [2022-12-06 08:01:40,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:40,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:40,058 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 345 transitions, 11216 flow [2022-12-06 08:01:40,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 282 places, 345 transitions, 11216 flow [2022-12-06 08:01:40,281 INFO L130 PetriNetUnfolder]: 434/1222 cut-off events. [2022-12-06 08:01:40,282 INFO L131 PetriNetUnfolder]: For 101287/101445 co-relation queries the response was YES. [2022-12-06 08:01:40,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18482 conditions, 1222 events. 434/1222 cut-off events. For 101287/101445 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 9859 event pairs, 84 based on Foata normal form. 6/1195 useless extension candidates. Maximal degree in co-relation 18313. Up to 468 conditions per place. [2022-12-06 08:01:40,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 282 places, 345 transitions, 11216 flow [2022-12-06 08:01:40,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 898 [2022-12-06 08:01:40,302 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [814] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_487| v_~f~0.base_360))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_360 (* v_~x2~0_617 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_360 (* 4 .cse4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_360 (* .cse5 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_360 (* v_~x1~0_799 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_360 (* 4 .cse7)))) (.cse3 (select .cse1 (+ v_~f~0.offset_360 (* .cse8 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_360 (* .cse3 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_360 (* .cse6 4))))) (and (= (ite (and (< .cse0 v_~size~0_368) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_462|) (= v_~x2~0_616 (select .cse1 (+ v_~f~0.offset_360 (* .cse2 4)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_368)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_368)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_368)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478| 0)) (= v_~x1~0_797 (select .cse1 (+ v_~f~0.offset_360 (* .cse0 4)))) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_470|) 4294967296) (* 2 (mod v_~n~0_367 2147483648))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_368)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_470|) (not (= 0 (ite (and (< v_~x2~0_617 v_~size~0_368) (<= 0 v_~x2~0_617)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_627| 4) (not (= (ite (and (< v_~x1~0_799 v_~size~0_368) (<= 0 v_~x1~0_799)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_368)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_368)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_462| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|) (not (= (ite (and (< .cse8 v_~size~0_368) (<= 0 .cse8)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379| 0))))))))) InVars {~x2~0=v_~x2~0_617, ~size~0=v_~size~0_368, ~f~0.base=v_~f~0.base_360, #memory_int=|v_#memory_int_487|, ~n~0=v_~n~0_367, ~x1~0=v_~x1~0_799, ~f~0.offset=v_~f~0.offset_360} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_480|, ~x2~0=v_~x2~0_616, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_341|, ~size~0=v_~size~0_368, ~f~0.base=v_~f~0.base_360, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_345|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_470|, ~x1~0=v_~x1~0_797, ~f~0.offset=v_~f~0.offset_360, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_462|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_627|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_478|, #memory_int=|v_#memory_int_487|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_331|, ~n~0=v_~n~0_367, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_488|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_331|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:01:41,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_387| v_~f~0.base_280))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_280 (* v_~x2~0_428 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_280 (* .cse0 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_280 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_340| 4) (not (= (ite (and (< .cse0 v_~size~0_288) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_237| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_261|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_261| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_288)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_428 v_~size~0_288) (<= 0 v_~x2~0_428)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_237| (ite (and (< .cse2 v_~size~0_288) (<= 0 .cse2)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_340|) 4294967296) (* 2 (mod v_~n~0_287 2147483648))) (= (select .cse3 (+ v_~f~0.offset_280 (* .cse2 4))) v_~x2~0_426)))))) InVars {~x2~0=v_~x2~0_428, ~size~0=v_~size~0_288, ~f~0.base=v_~f~0.base_280, #memory_int=|v_#memory_int_387|, ~n~0=v_~n~0_287, ~f~0.offset=v_~f~0.offset_280} OutVars{~x2~0=v_~x2~0_426, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_223|, ~size~0=v_~size~0_288, ~f~0.base=v_~f~0.base_280, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_227|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_237|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_340|, ~f~0.offset=v_~f~0.offset_280, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_261|, #memory_int=|v_#memory_int_387|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_213|, ~n~0=v_~n~0_287, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_213|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:01:41,223 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_451| v_~f~0.base_334))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_334 (* v_~x2~0_566 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_334 (* .cse0 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_334 (* .cse3 4)))) (.cse4 (select .cse2 (+ v_~f~0.offset_334 (* v_~x1~0_718 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_574| 2) (not (= (ite (and (<= 0 v_~x1~0_718) (< v_~x1~0_718 v_~size~0_342)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_342)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_435|) 4294967296) (* 2 (mod v_~n~0_341 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_322| (ite (and (< .cse1 v_~size~0_342) (<= 0 .cse1)) 1 0)) (= (select .cse2 (+ v_~f~0.offset_334 (* .cse1 4))) v_~x2~0_564) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_322| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_342)) 1 0) 0)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_342)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_411|) (not (= (ite (and (<= 0 v_~x2~0_566) (< v_~x2~0_566 v_~size~0_342)) 1 0) 0)) (= v_~x1~0_717 (select .cse2 (+ v_~f~0.offset_334 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_427| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_435| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_411| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_427|)))))) InVars {~x2~0=v_~x2~0_566, ~size~0=v_~size~0_342, ~f~0.base=v_~f~0.base_334, #memory_int=|v_#memory_int_451|, ~n~0=v_~n~0_341, ~x1~0=v_~x1~0_718, ~f~0.offset=v_~f~0.offset_334} OutVars{~x2~0=v_~x2~0_564, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_429|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_308|, ~size~0=v_~size~0_342, ~f~0.base=v_~f~0.base_334, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_312|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_322|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_435|, ~x1~0=v_~x1~0_717, ~f~0.offset=v_~f~0.offset_334, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_411|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_574|, #memory_int=|v_#memory_int_451|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_427|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_298|, ~n~0=v_~n~0_341, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_298|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_437|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:01:41,939 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 08:01:41,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1885 [2022-12-06 08:01:41,940 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 345 transitions, 11336 flow [2022-12-06 08:01:41,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:41,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:41,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:41,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-06 08:01:42,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-06 08:01:42,146 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash -748615238, now seen corresponding path program 1 times [2022-12-06 08:01:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:42,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897037239] [2022-12-06 08:01:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:43,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:43,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897037239] [2022-12-06 08:01:43,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897037239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:43,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48616790] [2022-12-06 08:01:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:43,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:43,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:43,262 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 08:01:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:43,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 08:01:43,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:43,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:01:43,404 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 32 [2022-12-06 08:01:43,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:01:43,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 08:01:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:43,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:43,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:01:43,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 382 [2022-12-06 08:01:43,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:01:43,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 49 treesize of output 260 [2022-12-06 08:01:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:51,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48616790] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:51,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:51,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 08:01:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372437572] [2022-12-06 08:01:51,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:51,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 08:01:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 08:01:51,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-06 08:01:51,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 08:01:51,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 345 transitions, 11336 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:51,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:51,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 08:01:51,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:53,465 INFO L130 PetriNetUnfolder]: 2021/3754 cut-off events. [2022-12-06 08:01:53,465 INFO L131 PetriNetUnfolder]: For 333432/333432 co-relation queries the response was YES. [2022-12-06 08:01:53,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57019 conditions, 3754 events. 2021/3754 cut-off events. For 333432/333432 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 26565 event pairs, 539 based on Foata normal form. 8/3762 useless extension candidates. Maximal degree in co-relation 56801. Up to 2362 conditions per place. [2022-12-06 08:01:53,509 INFO L137 encePairwiseOnDemand]: 20/69 looper letters, 299 selfloop transitions, 191 changer transitions 23/513 dead transitions. [2022-12-06 08:01:53,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 513 transitions, 16199 flow [2022-12-06 08:01:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 08:01:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 08:01:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 217 transitions. [2022-12-06 08:01:53,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1429512516469038 [2022-12-06 08:01:53,511 INFO L175 Difference]: Start difference. First operand has 282 places, 345 transitions, 11336 flow. Second operand 22 states and 217 transitions. [2022-12-06 08:01:53,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 513 transitions, 16199 flow [2022-12-06 08:01:54,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 513 transitions, 14460 flow, removed 771 selfloop flow, removed 30 redundant places. [2022-12-06 08:01:54,631 INFO L231 Difference]: Finished difference. Result has 280 places, 410 transitions, 12715 flow [2022-12-06 08:01:54,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=9886, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12715, PETRI_PLACES=280, PETRI_TRANSITIONS=410} [2022-12-06 08:01:54,631 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 259 predicate places. [2022-12-06 08:01:54,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:54,631 INFO L89 Accepts]: Start accepts. Operand has 280 places, 410 transitions, 12715 flow [2022-12-06 08:01:54,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:54,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:54,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 410 transitions, 12715 flow [2022-12-06 08:01:54,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 410 transitions, 12715 flow [2022-12-06 08:01:54,900 INFO L130 PetriNetUnfolder]: 551/1533 cut-off events. [2022-12-06 08:01:54,900 INFO L131 PetriNetUnfolder]: For 108221/108375 co-relation queries the response was YES. [2022-12-06 08:01:54,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21588 conditions, 1533 events. 551/1533 cut-off events. For 108221/108375 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13062 event pairs, 117 based on Foata normal form. 8/1499 useless extension candidates. Maximal degree in co-relation 21358. Up to 614 conditions per place. [2022-12-06 08:01:54,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 410 transitions, 12715 flow [2022-12-06 08:01:54,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-06 08:01:54,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] $Ultimate##0-->L83-3: Formula: (let ((.cse1 (select |v_#memory_int_462| v_~f~0.base_344))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_344 (* v_~x1~0_746 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_344 (* .cse0 4))))) (and (= (+ |v_#pthreadsForks_107| 1) |v_#pthreadsForks_106|) (not (= (ite (and (<= 0 v_~x1~0_746) (< v_~x1~0_746 v_~size~0_352)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_352)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_97| |v_#pthreadsForks_107|) (= v_~x1~0_745 (select .cse1 (+ v_~f~0.offset_344 (* 4 .cse2)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_445| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_445|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429| (ite (and (< .cse2 v_~size~0_352) (<= 0 .cse2)) 1 0)) (= (store |v_#memory_int_462| |v_ULTIMATE.start_main_~#t2~0#1.base_65| (store (select |v_#memory_int_462| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) |v_ULTIMATE.start_main_~#t2~0#1.offset_65| |v_ULTIMATE.start_main_#t~pre12#1_97|)) |v_#memory_int_461|) (= |v_thread1Thread1of1ForFork0_~i~0#1_594| 3) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_594| 4294967295) 4294967296) (* (mod v_~n~0_351 2147483648) 2)))))) InVars {#pthreadsForks=|v_#pthreadsForks_107|, ~size~0=v_~size~0_352, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_65|, ~f~0.base=v_~f~0.base_344, #memory_int=|v_#memory_int_462|, ~n~0=v_~n~0_351, ~x1~0=v_~x1~0_746, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|, ~f~0.offset=v_~f~0.offset_344} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_447|, ~size~0=v_~size~0_352, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_65|, ~f~0.base=v_~f~0.base_344, ~x1~0=v_~x1~0_745, ~f~0.offset=v_~f~0.offset_344, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_72|, #pthreadsForks=|v_#pthreadsForks_106|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_90|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_594|, #memory_int=|v_#memory_int_461|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_445|, ~n~0=v_~n~0_351, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_455|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:01:55,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:01:55,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 532 [2022-12-06 08:01:55,163 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 410 transitions, 12753 flow [2022-12-06 08:01:55,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:55,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:55,163 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:55,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:55,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-12-06 08:01:55,368 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1486541340, now seen corresponding path program 1 times [2022-12-06 08:01:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:55,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908636108] [2022-12-06 08:01:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:01:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:55,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908636108] [2022-12-06 08:01:55,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908636108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:01:55,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:01:55,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 08:01:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825617710] [2022-12-06 08:01:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:01:55,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 08:01:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 08:01:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 08:01:55,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:01:55,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 410 transitions, 12753 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:55,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:55,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:01:55,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:56,489 INFO L130 PetriNetUnfolder]: 2011/3734 cut-off events. [2022-12-06 08:01:56,489 INFO L131 PetriNetUnfolder]: For 252938/252938 co-relation queries the response was YES. [2022-12-06 08:01:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52183 conditions, 3734 events. 2011/3734 cut-off events. For 252938/252938 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 26358 event pairs, 886 based on Foata normal form. 26/3758 useless extension candidates. Maximal degree in co-relation 51886. Up to 3293 conditions per place. [2022-12-06 08:01:56,529 INFO L137 encePairwiseOnDemand]: 48/70 looper letters, 371 selfloop transitions, 67 changer transitions 0/438 dead transitions. [2022-12-06 08:01:56,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 438 transitions, 14268 flow [2022-12-06 08:01:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:01:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:01:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 08:01:56,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-06 08:01:56,530 INFO L175 Difference]: Start difference. First operand has 280 places, 410 transitions, 12753 flow. Second operand 5 states and 98 transitions. [2022-12-06 08:01:56,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 438 transitions, 14268 flow [2022-12-06 08:01:57,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 438 transitions, 13001 flow, removed 583 selfloop flow, removed 9 redundant places. [2022-12-06 08:01:57,415 INFO L231 Difference]: Finished difference. Result has 276 places, 411 transitions, 11732 flow [2022-12-06 08:01:57,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=11540, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11732, PETRI_PLACES=276, PETRI_TRANSITIONS=411} [2022-12-06 08:01:57,415 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 255 predicate places. [2022-12-06 08:01:57,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:57,416 INFO L89 Accepts]: Start accepts. Operand has 276 places, 411 transitions, 11732 flow [2022-12-06 08:01:57,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:57,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:57,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 411 transitions, 11732 flow [2022-12-06 08:01:57,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 411 transitions, 11732 flow [2022-12-06 08:01:57,674 INFO L130 PetriNetUnfolder]: 550/1530 cut-off events. [2022-12-06 08:01:57,675 INFO L131 PetriNetUnfolder]: For 89135/89247 co-relation queries the response was YES. [2022-12-06 08:01:57,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19844 conditions, 1530 events. 550/1530 cut-off events. For 89135/89247 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 13026 event pairs, 113 based on Foata normal form. 4/1493 useless extension candidates. Maximal degree in co-relation 19654. Up to 602 conditions per place. [2022-12-06 08:01:57,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 411 transitions, 11732 flow [2022-12-06 08:01:57,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 1160 [2022-12-06 08:01:57,697 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:57,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-06 08:01:57,698 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 411 transitions, 11732 flow [2022-12-06 08:01:57,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:57,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:57,698 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:57,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 08:01:57,698 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1519928145, now seen corresponding path program 1 times [2022-12-06 08:01:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:57,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043954715] [2022-12-06 08:01:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:01:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043954715] [2022-12-06 08:01:57,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043954715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:01:57,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:01:57,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 08:01:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92633934] [2022-12-06 08:01:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:01:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 08:01:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 08:01:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 08:01:57,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:01:57,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 411 transitions, 11732 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:57,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:57,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:01:57,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:58,881 INFO L130 PetriNetUnfolder]: 2055/3826 cut-off events. [2022-12-06 08:01:58,881 INFO L131 PetriNetUnfolder]: For 218551/218551 co-relation queries the response was YES. [2022-12-06 08:01:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49462 conditions, 3826 events. 2055/3826 cut-off events. For 218551/218551 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 27250 event pairs, 941 based on Foata normal form. 18/3842 useless extension candidates. Maximal degree in co-relation 49097. Up to 3601 conditions per place. [2022-12-06 08:01:58,916 INFO L137 encePairwiseOnDemand]: 50/70 looper letters, 392 selfloop transitions, 54 changer transitions 1/447 dead transitions. [2022-12-06 08:01:58,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 447 transitions, 13480 flow [2022-12-06 08:01:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:01:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:01:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-06 08:01:58,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26571428571428574 [2022-12-06 08:01:58,917 INFO L175 Difference]: Start difference. First operand has 276 places, 411 transitions, 11732 flow. Second operand 5 states and 93 transitions. [2022-12-06 08:01:58,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 447 transitions, 13480 flow [2022-12-06 08:01:59,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 447 transitions, 13313 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 08:01:59,573 INFO L231 Difference]: Finished difference. Result has 278 places, 418 transitions, 11969 flow [2022-12-06 08:01:59,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=11575, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11969, PETRI_PLACES=278, PETRI_TRANSITIONS=418} [2022-12-06 08:01:59,574 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 257 predicate places. [2022-12-06 08:01:59,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:59,574 INFO L89 Accepts]: Start accepts. Operand has 278 places, 418 transitions, 11969 flow [2022-12-06 08:01:59,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:59,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:59,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 418 transitions, 11969 flow [2022-12-06 08:01:59,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 418 transitions, 11969 flow [2022-12-06 08:01:59,885 INFO L130 PetriNetUnfolder]: 562/1570 cut-off events. [2022-12-06 08:01:59,885 INFO L131 PetriNetUnfolder]: For 91567/91700 co-relation queries the response was YES. [2022-12-06 08:01:59,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20425 conditions, 1570 events. 562/1570 cut-off events. For 91567/91700 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 13447 event pairs, 111 based on Foata normal form. 4/1531 useless extension candidates. Maximal degree in co-relation 20197. Up to 620 conditions per place. [2022-12-06 08:01:59,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 418 transitions, 11969 flow [2022-12-06 08:01:59,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 1180 [2022-12-06 08:01:59,911 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:59,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-06 08:01:59,912 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 418 transitions, 11969 flow [2022-12-06 08:01:59,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:59,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:59,912 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:59,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 08:01:59,912 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:01:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:59,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1045991817, now seen corresponding path program 2 times [2022-12-06 08:01:59,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:59,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802553966] [2022-12-06 08:01:59,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:59,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:01:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802553966] [2022-12-06 08:01:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802553966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:01:59,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:01:59,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 08:01:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616843044] [2022-12-06 08:01:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:01:59,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 08:01:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:00,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 08:02:00,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 08:02:00,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:02:00,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 418 transitions, 11969 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:00,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:00,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:02:00,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:01,253 INFO L130 PetriNetUnfolder]: 2080/3887 cut-off events. [2022-12-06 08:02:01,253 INFO L131 PetriNetUnfolder]: For 219394/219394 co-relation queries the response was YES. [2022-12-06 08:02:01,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50184 conditions, 3887 events. 2080/3887 cut-off events. For 219394/219394 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 27809 event pairs, 944 based on Foata normal form. 4/3889 useless extension candidates. Maximal degree in co-relation 49890. Up to 3581 conditions per place. [2022-12-06 08:02:01,292 INFO L137 encePairwiseOnDemand]: 49/70 looper letters, 396 selfloop transitions, 57 changer transitions 6/459 dead transitions. [2022-12-06 08:02:01,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 459 transitions, 13970 flow [2022-12-06 08:02:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 08:02:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 08:02:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 08:02:01,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-06 08:02:01,293 INFO L175 Difference]: Start difference. First operand has 278 places, 418 transitions, 11969 flow. Second operand 6 states and 96 transitions. [2022-12-06 08:02:01,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 459 transitions, 13970 flow [2022-12-06 08:02:01,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 459 transitions, 13781 flow, removed 67 selfloop flow, removed 1 redundant places. [2022-12-06 08:02:01,951 INFO L231 Difference]: Finished difference. Result has 284 places, 423 transitions, 12128 flow [2022-12-06 08:02:01,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=11842, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12128, PETRI_PLACES=284, PETRI_TRANSITIONS=423} [2022-12-06 08:02:01,951 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 263 predicate places. [2022-12-06 08:02:01,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:01,951 INFO L89 Accepts]: Start accepts. Operand has 284 places, 423 transitions, 12128 flow [2022-12-06 08:02:01,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:01,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:01,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 284 places, 423 transitions, 12128 flow [2022-12-06 08:02:01,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 423 transitions, 12128 flow [2022-12-06 08:02:02,263 INFO L130 PetriNetUnfolder]: 557/1573 cut-off events. [2022-12-06 08:02:02,263 INFO L131 PetriNetUnfolder]: For 94816/94943 co-relation queries the response was YES. [2022-12-06 08:02:02,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20662 conditions, 1573 events. 557/1573 cut-off events. For 94816/94943 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 13546 event pairs, 110 based on Foata normal form. 4/1534 useless extension candidates. Maximal degree in co-relation 20465. Up to 613 conditions per place. [2022-12-06 08:02:02,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 284 places, 423 transitions, 12128 flow [2022-12-06 08:02:02,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 1186 [2022-12-06 08:02:02,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:02:02,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 335 [2022-12-06 08:02:02,286 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 423 transitions, 12128 flow [2022-12-06 08:02:02,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:02,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:02,286 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:02,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 08:02:02,286 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash -730727937, now seen corresponding path program 1 times [2022-12-06 08:02:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:02,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794199340] [2022-12-06 08:02:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:02,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:02,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:02,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794199340] [2022-12-06 08:02:02,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794199340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:02,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047969929] [2022-12-06 08:02:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:02,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:02,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:02,387 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:02,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 08:02:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:02,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:02:02,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:02:02,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 08:02:02,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047969929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:02:02,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 08:02:02,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-06 08:02:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845570876] [2022-12-06 08:02:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:02:02,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 08:02:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:02,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 08:02:02,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-06 08:02:02,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:02:02,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 423 transitions, 12128 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:02,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:02,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:02:02,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:03,662 INFO L130 PetriNetUnfolder]: 2050/3832 cut-off events. [2022-12-06 08:02:03,662 INFO L131 PetriNetUnfolder]: For 221728/221728 co-relation queries the response was YES. [2022-12-06 08:02:03,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50053 conditions, 3832 events. 2050/3832 cut-off events. For 221728/221728 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 27346 event pairs, 979 based on Foata normal form. 10/3840 useless extension candidates. Maximal degree in co-relation 49755. Up to 3713 conditions per place. [2022-12-06 08:02:03,701 INFO L137 encePairwiseOnDemand]: 51/70 looper letters, 405 selfloop transitions, 34 changer transitions 4/443 dead transitions. [2022-12-06 08:02:03,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 443 transitions, 13440 flow [2022-12-06 08:02:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:02:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:02:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 08:02:03,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26 [2022-12-06 08:02:03,702 INFO L175 Difference]: Start difference. First operand has 284 places, 423 transitions, 12128 flow. Second operand 5 states and 91 transitions. [2022-12-06 08:02:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 443 transitions, 13440 flow [2022-12-06 08:02:04,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 443 transitions, 13283 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-06 08:02:04,375 INFO L231 Difference]: Finished difference. Result has 286 places, 424 transitions, 12093 flow [2022-12-06 08:02:04,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=11971, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12093, PETRI_PLACES=286, PETRI_TRANSITIONS=424} [2022-12-06 08:02:04,376 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 265 predicate places. [2022-12-06 08:02:04,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:04,376 INFO L89 Accepts]: Start accepts. Operand has 286 places, 424 transitions, 12093 flow [2022-12-06 08:02:04,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:04,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:04,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 424 transitions, 12093 flow [2022-12-06 08:02:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 424 transitions, 12093 flow [2022-12-06 08:02:04,636 INFO L130 PetriNetUnfolder]: 553/1563 cut-off events. [2022-12-06 08:02:04,636 INFO L131 PetriNetUnfolder]: For 93057/93172 co-relation queries the response was YES. [2022-12-06 08:02:04,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20455 conditions, 1563 events. 553/1563 cut-off events. For 93057/93172 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 13430 event pairs, 108 based on Foata normal form. 3/1525 useless extension candidates. Maximal degree in co-relation 20260. Up to 605 conditions per place. [2022-12-06 08:02:04,660 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 424 transitions, 12093 flow [2022-12-06 08:02:04,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 1190 [2022-12-06 08:02:04,661 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:02:04,662 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 08:02:04,662 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 424 transitions, 12093 flow [2022-12-06 08:02:04,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:04,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:04,662 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:04,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:04,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:04,863 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1515335123, now seen corresponding path program 1 times [2022-12-06 08:02:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:04,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662657262] [2022-12-06 08:02:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:04,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662657262] [2022-12-06 08:02:04,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662657262] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909380898] [2022-12-06 08:02:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:04,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:04,927 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:04,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 08:02:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:05,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 08:02:05,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:05,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:02:05,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 08:02:05,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:02:05,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:02:05,085 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 14 treesize of output 16 [2022-12-06 08:02:05,281 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 08:02:05,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 64 [2022-12-06 08:02:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:05,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:05,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909380898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:05,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:05,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 08:02:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147623283] [2022-12-06 08:02:05,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:05,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 08:02:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 08:02:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-06 08:02:05,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-06 08:02:05,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 424 transitions, 12093 flow. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:05,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:05,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-06 08:02:05,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:08,442 INFO L130 PetriNetUnfolder]: 2178/4061 cut-off events. [2022-12-06 08:02:08,442 INFO L131 PetriNetUnfolder]: For 243546/243546 co-relation queries the response was YES. [2022-12-06 08:02:08,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53482 conditions, 4061 events. 2178/4061 cut-off events. For 243546/243546 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 29269 event pairs, 634 based on Foata normal form. 9/4068 useless extension candidates. Maximal degree in co-relation 53008. Up to 3416 conditions per place. [2022-12-06 08:02:08,487 INFO L137 encePairwiseOnDemand]: 15/70 looper letters, 355 selfloop transitions, 164 changer transitions 3/522 dead transitions. [2022-12-06 08:02:08,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 522 transitions, 15522 flow [2022-12-06 08:02:08,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 08:02:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 08:02:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 148 transitions. [2022-12-06 08:02:08,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11127819548872181 [2022-12-06 08:02:08,488 INFO L175 Difference]: Start difference. First operand has 286 places, 424 transitions, 12093 flow. Second operand 19 states and 148 transitions. [2022-12-06 08:02:08,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 522 transitions, 15522 flow [2022-12-06 08:02:09,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 522 transitions, 15459 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 08:02:09,284 INFO L231 Difference]: Finished difference. Result has 308 places, 455 transitions, 13667 flow [2022-12-06 08:02:09,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=12030, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=13667, PETRI_PLACES=308, PETRI_TRANSITIONS=455} [2022-12-06 08:02:09,284 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 287 predicate places. [2022-12-06 08:02:09,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:09,285 INFO L89 Accepts]: Start accepts. Operand has 308 places, 455 transitions, 13667 flow [2022-12-06 08:02:09,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:09,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:09,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 455 transitions, 13667 flow [2022-12-06 08:02:09,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 455 transitions, 13667 flow [2022-12-06 08:02:09,633 INFO L130 PetriNetUnfolder]: 592/1653 cut-off events. [2022-12-06 08:02:09,633 INFO L131 PetriNetUnfolder]: For 106734/106866 co-relation queries the response was YES. [2022-12-06 08:02:09,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22557 conditions, 1653 events. 592/1653 cut-off events. For 106734/106866 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 14285 event pairs, 112 based on Foata normal form. 3/1613 useless extension candidates. Maximal degree in co-relation 22263. Up to 665 conditions per place. [2022-12-06 08:02:09,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 455 transitions, 13667 flow [2022-12-06 08:02:09,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 1260 [2022-12-06 08:02:09,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [803] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_465| v_~f~0.base_346))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_346 (* v_~x1~0_751 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_346 (* .cse3 4))))) (let ((.cse5 (select .cse0 (+ (* .cse4 4) v_~f~0.offset_346)))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_346 (* v_~x2~0_585 4)))) (.cse2 (select .cse0 (+ v_~f~0.offset_346 (* .cse5 4))))) (and (= (select .cse0 (+ v_~f~0.offset_346 (* .cse1 4))) v_~x2~0_584) (= |v_thread1Thread1of1ForFork0_~i~0#1_596| 5) (= (ite (and (< .cse1 v_~size~0_354) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334|) (not (= (ite (and (<= 0 v_~x2~0_585) (< v_~x2~0_585 v_~size~0_354)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_431| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_447|) (< 4 (* (mod v_~n~0_353 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_358| 0)) (= v_~x1~0_749 (select .cse0 (+ v_~f~0.offset_346 (* .cse2 4)))) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_449|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_354)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_358|) (not (= (ite (and (<= 0 v_~x1~0_751) (< v_~x1~0_751 v_~size~0_354)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_354)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_431|) (not (= (ite (and (< .cse4 v_~size~0_354) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_447| 0)) (not (= (ite (and (< .cse5 v_~size~0_354) (<= 0 .cse5)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_585, ~size~0=v_~size~0_354, ~f~0.base=v_~f~0.base_346, #memory_int=|v_#memory_int_465|, ~n~0=v_~n~0_353, ~x1~0=v_~x1~0_751, ~f~0.offset=v_~f~0.offset_346} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_449|, ~x2~0=v_~x2~0_584, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_320|, ~size~0=v_~size~0_354, ~f~0.base=v_~f~0.base_346, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_324|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_449|, ~x1~0=v_~x1~0_749, ~f~0.offset=v_~f~0.offset_346, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_358|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_431|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_596|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_447|, #memory_int=|v_#memory_int_465|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_310|, ~n~0=v_~n~0_353, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_457|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_310|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:10,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:02:10,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1231 [2022-12-06 08:02:10,515 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 455 transitions, 13759 flow [2022-12-06 08:02:10,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:10,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:10,515 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:10,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:10,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:10,716 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash 998319397, now seen corresponding path program 2 times [2022-12-06 08:02:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:10,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698347776] [2022-12-06 08:02:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:10,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:10,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698347776] [2022-12-06 08:02:10,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698347776] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:10,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531600620] [2022-12-06 08:02:10,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 08:02:10,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:10,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:10,797 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:10,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 08:02:10,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 08:02:10,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 08:02:10,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:02:10,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:02:10,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 08:02:10,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531600620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:02:10,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 08:02:10,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-06 08:02:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246643392] [2022-12-06 08:02:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:02:10,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 08:02:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 08:02:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 08:02:10,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 08:02:10,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 455 transitions, 13759 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:10,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:10,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 08:02:10,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:12,273 INFO L130 PetriNetUnfolder]: 2172/4043 cut-off events. [2022-12-06 08:02:12,273 INFO L131 PetriNetUnfolder]: For 248943/248943 co-relation queries the response was YES. [2022-12-06 08:02:12,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54516 conditions, 4043 events. 2172/4043 cut-off events. For 248943/248943 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 28961 event pairs, 1071 based on Foata normal form. 2/4041 useless extension candidates. Maximal degree in co-relation 54007. Up to 4003 conditions per place. [2022-12-06 08:02:12,313 INFO L137 encePairwiseOnDemand]: 56/72 looper letters, 436 selfloop transitions, 22 changer transitions 7/465 dead transitions. [2022-12-06 08:02:12,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 465 transitions, 14838 flow [2022-12-06 08:02:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:02:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:02:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 08:02:12,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2388888888888889 [2022-12-06 08:02:12,314 INFO L175 Difference]: Start difference. First operand has 308 places, 455 transitions, 13759 flow. Second operand 5 states and 86 transitions. [2022-12-06 08:02:12,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 465 transitions, 14838 flow [2022-12-06 08:02:13,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 465 transitions, 14365 flow, removed 214 selfloop flow, removed 6 redundant places. [2022-12-06 08:02:13,171 INFO L231 Difference]: Finished difference. Result has 306 places, 452 transitions, 13225 flow [2022-12-06 08:02:13,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=13259, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=13225, PETRI_PLACES=306, PETRI_TRANSITIONS=452} [2022-12-06 08:02:13,172 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 285 predicate places. [2022-12-06 08:02:13,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:13,172 INFO L89 Accepts]: Start accepts. Operand has 306 places, 452 transitions, 13225 flow [2022-12-06 08:02:13,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:13,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:13,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 306 places, 452 transitions, 13225 flow [2022-12-06 08:02:13,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 452 transitions, 13225 flow [2022-12-06 08:02:13,463 INFO L130 PetriNetUnfolder]: 591/1633 cut-off events. [2022-12-06 08:02:13,464 INFO L131 PetriNetUnfolder]: For 103676/103805 co-relation queries the response was YES. [2022-12-06 08:02:13,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22077 conditions, 1633 events. 591/1633 cut-off events. For 103676/103805 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 13996 event pairs, 115 based on Foata normal form. 3/1594 useless extension candidates. Maximal degree in co-relation 21801. Up to 659 conditions per place. [2022-12-06 08:02:13,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 452 transitions, 13225 flow [2022-12-06 08:02:13,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-06 08:02:13,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_415| v_~f~0.base_300))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_300 (* v_~x2~0_472 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_300 (* 4 .cse0))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_300 (* 4 .cse3))))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_300 (* .cse4 4))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_300 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|) (< 4 (* 2 (mod v_~n~0_307 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_308)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_308) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| (ite (and (< .cse2 v_~size~0_308) (<= 0 .cse2)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_308) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_308) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_472 v_~size~0_308) (<= 0 v_~x2~0_472)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_300 (* .cse2 4))) v_~x2~0_470) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_372|)))))))) InVars {~x2~0=v_~x2~0_472, ~size~0=v_~size~0_308, ~f~0.base=v_~f~0.base_300, #memory_int=|v_#memory_int_415|, ~n~0=v_~n~0_307, ~f~0.offset=v_~f~0.offset_300} OutVars{~x2~0=v_~x2~0_470, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_249|, ~size~0=v_~size~0_308, ~f~0.base=v_~f~0.base_300, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_253|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_372|, ~f~0.offset=v_~f~0.offset_300, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_287|, #memory_int=|v_#memory_int_415|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_239|, ~n~0=v_~n~0_307, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_239|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 08:02:13,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:02:13,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 572 [2022-12-06 08:02:13,744 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 453 transitions, 13265 flow [2022-12-06 08:02:13,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:13,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:13,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:13,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:13,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:13,944 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1154658613, now seen corresponding path program 1 times [2022-12-06 08:02:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931143112] [2022-12-06 08:02:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:02:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931143112] [2022-12-06 08:02:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931143112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:02:13,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:02:13,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 08:02:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830662036] [2022-12-06 08:02:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:02:13,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:02:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:02:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 08:02:13,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 08:02:13,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 453 transitions, 13265 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:13,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:13,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 08:02:13,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:15,190 INFO L130 PetriNetUnfolder]: 2207/4095 cut-off events. [2022-12-06 08:02:15,190 INFO L131 PetriNetUnfolder]: For 252243/252243 co-relation queries the response was YES. [2022-12-06 08:02:15,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54939 conditions, 4095 events. 2207/4095 cut-off events. For 252243/252243 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 29355 event pairs, 1078 based on Foata normal form. 10/4103 useless extension candidates. Maximal degree in co-relation 54471. Up to 4064 conditions per place. [2022-12-06 08:02:15,233 INFO L137 encePairwiseOnDemand]: 68/72 looper letters, 440 selfloop transitions, 7 changer transitions 14/461 dead transitions. [2022-12-06 08:02:15,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 461 transitions, 14442 flow [2022-12-06 08:02:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:02:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:02:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-06 08:02:15,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-06 08:02:15,234 INFO L175 Difference]: Start difference. First operand has 304 places, 453 transitions, 13265 flow. Second operand 3 states and 78 transitions. [2022-12-06 08:02:15,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 461 transitions, 14442 flow [2022-12-06 08:02:15,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 461 transitions, 14388 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 08:02:15,982 INFO L231 Difference]: Finished difference. Result has 304 places, 440 transitions, 12921 flow [2022-12-06 08:02:15,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=13173, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=12921, PETRI_PLACES=304, PETRI_TRANSITIONS=440} [2022-12-06 08:02:15,982 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 283 predicate places. [2022-12-06 08:02:15,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:15,982 INFO L89 Accepts]: Start accepts. Operand has 304 places, 440 transitions, 12921 flow [2022-12-06 08:02:15,984 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:15,984 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:15,984 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 440 transitions, 12921 flow [2022-12-06 08:02:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 440 transitions, 12921 flow [2022-12-06 08:02:16,265 INFO L130 PetriNetUnfolder]: 579/1616 cut-off events. [2022-12-06 08:02:16,265 INFO L131 PetriNetUnfolder]: For 105835/105966 co-relation queries the response was YES. [2022-12-06 08:02:16,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21987 conditions, 1616 events. 579/1616 cut-off events. For 105835/105966 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 13906 event pairs, 112 based on Foata normal form. 3/1577 useless extension candidates. Maximal degree in co-relation 21710. Up to 649 conditions per place. [2022-12-06 08:02:16,291 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 440 transitions, 12921 flow [2022-12-06 08:02:16,291 INFO L188 LiptonReduction]: Number of co-enabled transitions 1234 [2022-12-06 08:02:16,841 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 08:02:16,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 860 [2022-12-06 08:02:16,842 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 440 transitions, 12952 flow [2022-12-06 08:02:16,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:16,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:16,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:16,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 08:02:16,842 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:16,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:16,842 INFO L85 PathProgramCache]: Analyzing trace with hash -284529335, now seen corresponding path program 1 times [2022-12-06 08:02:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:16,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937735154] [2022-12-06 08:02:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:16,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:16,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937735154] [2022-12-06 08:02:16,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937735154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:16,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348133889] [2022-12-06 08:02:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:16,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:16,903 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:16,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 08:02:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:17,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 08:02:17,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:17,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:17,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348133889] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:17,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:17,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 08:02:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230946062] [2022-12-06 08:02:17,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:17,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 08:02:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:17,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 08:02:17,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 08:02:17,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 08:02:17,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 440 transitions, 12952 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:17,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:17,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 08:02:17,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:18,545 INFO L130 PetriNetUnfolder]: 2203/4093 cut-off events. [2022-12-06 08:02:18,545 INFO L131 PetriNetUnfolder]: For 269528/269528 co-relation queries the response was YES. [2022-12-06 08:02:18,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55719 conditions, 4093 events. 2203/4093 cut-off events. For 269528/269528 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 29580 event pairs, 493 based on Foata normal form. 22/4113 useless extension candidates. Maximal degree in co-relation 55250. Up to 2347 conditions per place. [2022-12-06 08:02:18,589 INFO L137 encePairwiseOnDemand]: 59/69 looper letters, 546 selfloop transitions, 32 changer transitions 4/582 dead transitions. [2022-12-06 08:02:18,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 582 transitions, 18128 flow [2022-12-06 08:02:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 08:02:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 08:02:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-06 08:02:18,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20910973084886128 [2022-12-06 08:02:18,591 INFO L175 Difference]: Start difference. First operand has 302 places, 440 transitions, 12952 flow. Second operand 7 states and 101 transitions. [2022-12-06 08:02:18,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 582 transitions, 18128 flow [2022-12-06 08:02:19,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 582 transitions, 17955 flow, removed 80 selfloop flow, removed 2 redundant places. [2022-12-06 08:02:19,448 INFO L231 Difference]: Finished difference. Result has 308 places, 445 transitions, 13111 flow [2022-12-06 08:02:19,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=12815, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13111, PETRI_PLACES=308, PETRI_TRANSITIONS=445} [2022-12-06 08:02:19,448 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 287 predicate places. [2022-12-06 08:02:19,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:19,449 INFO L89 Accepts]: Start accepts. Operand has 308 places, 445 transitions, 13111 flow [2022-12-06 08:02:19,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:19,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:19,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 445 transitions, 13111 flow [2022-12-06 08:02:19,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 445 transitions, 13111 flow [2022-12-06 08:02:19,732 INFO L130 PetriNetUnfolder]: 589/1645 cut-off events. [2022-12-06 08:02:19,732 INFO L131 PetriNetUnfolder]: For 111252/111383 co-relation queries the response was YES. [2022-12-06 08:02:19,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22666 conditions, 1645 events. 589/1645 cut-off events. For 111252/111383 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 14173 event pairs, 117 based on Foata normal form. 3/1607 useless extension candidates. Maximal degree in co-relation 22386. Up to 659 conditions per place. [2022-12-06 08:02:19,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 445 transitions, 13111 flow [2022-12-06 08:02:19,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 1264 [2022-12-06 08:02:20,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:02:20,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 737 [2022-12-06 08:02:20,185 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 445 transitions, 13157 flow [2022-12-06 08:02:20,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:20,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:20,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:20,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:20,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-06 08:02:20,385 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:20,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1525413934, now seen corresponding path program 1 times [2022-12-06 08:02:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:20,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301431268] [2022-12-06 08:02:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:23,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:23,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301431268] [2022-12-06 08:02:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301431268] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:23,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695347666] [2022-12-06 08:02:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:23,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:23,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:23,603 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:23,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 08:02:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:23,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 08:02:23,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:23,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:02:23,767 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 38 treesize of output 34 [2022-12-06 08:02:23,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:02:23,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 08:02:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:23,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:24,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:02:24,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 364 [2022-12-06 08:02:25,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:02:25,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-06 08:02:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:27,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695347666] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:27,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:27,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 08:02:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203009486] [2022-12-06 08:02:27,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:27,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 08:02:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 08:02:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=169, Unknown=2, NotChecked=0, Total=210 [2022-12-06 08:02:27,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 08:02:27,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 445 transitions, 13157 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:27,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:27,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 08:02:27,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:30,690 INFO L130 PetriNetUnfolder]: 2235/4152 cut-off events. [2022-12-06 08:02:30,690 INFO L131 PetriNetUnfolder]: For 278378/278378 co-relation queries the response was YES. [2022-12-06 08:02:30,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56950 conditions, 4152 events. 2235/4152 cut-off events. For 278378/278378 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 29816 event pairs, 925 based on Foata normal form. 1/4151 useless extension candidates. Maximal degree in co-relation 56476. Up to 3665 conditions per place. [2022-12-06 08:02:30,730 INFO L137 encePairwiseOnDemand]: 21/69 looper letters, 400 selfloop transitions, 115 changer transitions 10/525 dead transitions. [2022-12-06 08:02:30,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 525 transitions, 15743 flow [2022-12-06 08:02:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 08:02:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 08:02:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2022-12-06 08:02:30,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1823671497584541 [2022-12-06 08:02:30,731 INFO L175 Difference]: Start difference. First operand has 307 places, 445 transitions, 13157 flow. Second operand 12 states and 151 transitions. [2022-12-06 08:02:30,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 525 transitions, 15743 flow [2022-12-06 08:02:31,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 525 transitions, 15599 flow, removed 70 selfloop flow, removed 2 redundant places. [2022-12-06 08:02:31,559 INFO L231 Difference]: Finished difference. Result has 320 places, 465 transitions, 14022 flow [2022-12-06 08:02:31,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=13013, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14022, PETRI_PLACES=320, PETRI_TRANSITIONS=465} [2022-12-06 08:02:31,560 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2022-12-06 08:02:31,560 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:31,560 INFO L89 Accepts]: Start accepts. Operand has 320 places, 465 transitions, 14022 flow [2022-12-06 08:02:31,562 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:31,562 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:31,562 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 465 transitions, 14022 flow [2022-12-06 08:02:31,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 465 transitions, 14022 flow [2022-12-06 08:02:31,876 INFO L130 PetriNetUnfolder]: 606/1683 cut-off events. [2022-12-06 08:02:31,876 INFO L131 PetriNetUnfolder]: For 118093/118225 co-relation queries the response was YES. [2022-12-06 08:02:31,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23619 conditions, 1683 events. 606/1683 cut-off events. For 118093/118225 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 14525 event pairs, 120 based on Foata normal form. 4/1644 useless extension candidates. Maximal degree in co-relation 23331. Up to 681 conditions per place. [2022-12-06 08:02:31,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 465 transitions, 14022 flow [2022-12-06 08:02:31,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 1324 [2022-12-06 08:02:32,645 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 08:02:32,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1086 [2022-12-06 08:02:32,646 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 465 transitions, 14102 flow [2022-12-06 08:02:32,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:32,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:32,646 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:32,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-06 08:02:32,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-06 08:02:32,853 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash 601085908, now seen corresponding path program 2 times [2022-12-06 08:02:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:32,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160638539] [2022-12-06 08:02:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:32,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:32,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:32,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160638539] [2022-12-06 08:02:32,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160638539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:32,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99672891] [2022-12-06 08:02:32,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 08:02:32,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:32,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:32,928 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:32,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 08:02:33,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 08:02:33,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 08:02:33,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 08:02:33,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:33,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99672891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:33,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:33,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 08:02:33,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751875310] [2022-12-06 08:02:33,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:33,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 08:02:33,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:33,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 08:02:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 08:02:33,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 08:02:33,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 465 transitions, 14102 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:33,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:33,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 08:02:33,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:36,605 INFO L130 PetriNetUnfolder]: 2392/4504 cut-off events. [2022-12-06 08:02:36,605 INFO L131 PetriNetUnfolder]: For 324089/324089 co-relation queries the response was YES. [2022-12-06 08:02:36,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62735 conditions, 4504 events. 2392/4504 cut-off events. For 324089/324089 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 33610 event pairs, 423 based on Foata normal form. 32/4534 useless extension candidates. Maximal degree in co-relation 62218. Up to 1718 conditions per place. [2022-12-06 08:02:36,658 INFO L137 encePairwiseOnDemand]: 20/71 looper letters, 410 selfloop transitions, 287 changer transitions 9/706 dead transitions. [2022-12-06 08:02:36,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 706 transitions, 21965 flow [2022-12-06 08:02:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 08:02:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 08:02:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 160 transitions. [2022-12-06 08:02:36,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11860637509266123 [2022-12-06 08:02:36,659 INFO L175 Difference]: Start difference. First operand has 320 places, 465 transitions, 14102 flow. Second operand 19 states and 160 transitions. [2022-12-06 08:02:36,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 706 transitions, 21965 flow [2022-12-06 08:02:37,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 706 transitions, 21771 flow, removed 92 selfloop flow, removed 2 redundant places. [2022-12-06 08:02:37,788 INFO L231 Difference]: Finished difference. Result has 346 places, 556 transitions, 17694 flow [2022-12-06 08:02:37,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=13917, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=17694, PETRI_PLACES=346, PETRI_TRANSITIONS=556} [2022-12-06 08:02:37,788 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 325 predicate places. [2022-12-06 08:02:37,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:37,788 INFO L89 Accepts]: Start accepts. Operand has 346 places, 556 transitions, 17694 flow [2022-12-06 08:02:37,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:37,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:37,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 346 places, 556 transitions, 17694 flow [2022-12-06 08:02:37,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 556 transitions, 17694 flow [2022-12-06 08:02:38,177 INFO L130 PetriNetUnfolder]: 635/1802 cut-off events. [2022-12-06 08:02:38,177 INFO L131 PetriNetUnfolder]: For 147350/147472 co-relation queries the response was YES. [2022-12-06 08:02:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26861 conditions, 1802 events. 635/1802 cut-off events. For 147350/147472 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 15999 event pairs, 98 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 26536. Up to 734 conditions per place. [2022-12-06 08:02:38,209 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 346 places, 556 transitions, 17694 flow [2022-12-06 08:02:38,209 INFO L188 LiptonReduction]: Number of co-enabled transitions 1506 [2022-12-06 08:02:38,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [813] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_485| v_~f~0.base_358))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_358 (* v_~x2~0_612 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_358 (* .cse3 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_358 (* .cse0 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_358 (* .cse8 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_358 (* .cse6 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_358 (* v_~x1~0_794 4)))) (.cse9 (select .cse1 (+ v_~f~0.offset_358 (* 4 .cse4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_358 (* 4 .cse9)))) (.cse5 (select .cse1 (+ v_~f~0.offset_358 (* .cse7 4))))) (and (not (= 0 (ite (and (< v_~x1~0_794 v_~size~0_366) (<= 0 v_~x1~0_794)) 1 0))) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_366)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_612) (< v_~x2~0_612 v_~size~0_366)) 1 0))) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_466|) 4294967296) (* (mod v_~n~0_365 2147483648) 2)) (= (select .cse1 (+ v_~f~0.offset_358 (* 4 .cse2))) v_~x2~0_610) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_460| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_366)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476| 0)) (not (= (ite (and (< .cse4 v_~size~0_366) (<= 0 .cse4)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_358 (* .cse5 4))) v_~x1~0_793) (= |v_thread1Thread1of1ForFork0_~i~0#1_625| 3) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_375| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_351| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_366)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_466| 8) (not (= (ite (and (< .cse6 v_~size~0_366) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_366) (<= 0 .cse7)) 1 0) 0)) (= (ite (and (< .cse5 v_~size~0_366) (<= 0 .cse5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_460|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_351| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_375|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_366)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_366)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_612, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_358, #memory_int=|v_#memory_int_485|, ~n~0=v_~n~0_365, ~x1~0=v_~x1~0_794, ~f~0.offset=v_~f~0.offset_358} OutVars{~x2~0=v_~x2~0_610, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_478|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_337|, ~size~0=v_~size~0_366, ~f~0.base=v_~f~0.base_358, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_341|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_351|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_466|, ~x1~0=v_~x1~0_793, ~f~0.offset=v_~f~0.offset_358, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_375|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_460|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_625|, #memory_int=|v_#memory_int_485|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_476|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_327|, ~n~0=v_~n~0_365, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_327|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_486|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:38,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:38,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_457| v_~f~0.base_340))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_340 (* v_~x1~0_735 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_340 (* .cse4 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_340 (* v_~x2~0_581 4)))) (.cse3 (select .cse2 (+ v_~f~0.offset_340 (* .cse1 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_356| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_332| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_348)) 1 0)) (not (= (ite (and (<= 0 v_~x1~0_735) (< v_~x1~0_735 v_~size~0_348)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_348)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_437| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_586| 4294967295) 4294967296) (* 2 (mod v_~n~0_347 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_332| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_356|) (= |v_thread1Thread1of1ForFork0_~i~0#1_586| 4) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_437|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_447|) (not (= (ite (and (< v_~x2~0_581 v_~size~0_348) (<= 0 v_~x2~0_581)) 1 0) 0)) (= v_~x1~0_733 (select .cse2 (+ v_~f~0.offset_340 (* .cse3 4)))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_348)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_340 (* .cse0 4))) v_~x2~0_580) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_348)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421|)))))) InVars {~x2~0=v_~x2~0_581, ~size~0=v_~size~0_348, ~f~0.base=v_~f~0.base_340, #memory_int=|v_#memory_int_457|, ~n~0=v_~n~0_347, ~x1~0=v_~x1~0_735, ~f~0.offset=v_~f~0.offset_340} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_439|, ~x2~0=v_~x2~0_580, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_318|, ~size~0=v_~size~0_348, ~f~0.base=v_~f~0.base_340, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_322|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_332|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_447|, ~x1~0=v_~x1~0_733, ~f~0.offset=v_~f~0.offset_340, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_356|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_586|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_437|, #memory_int=|v_#memory_int_457|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_308|, ~n~0=v_~n~0_347, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_447|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_308|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:39,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [808] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_473| v_~f~0.base_352))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_352 (* v_~x1~0_767 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_352 (* .cse0 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_352 (* v_~x2~0_589 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_352 (* .cse3 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_360) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_767 v_~size~0_360) (<= 0 v_~x1~0_767)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_606| 4294967294) 4294967296) (* (mod v_~n~0_359 2147483648) 2)) (= (select .cse1 (+ v_~f~0.offset_352 (* .cse2 4))) v_~x1~0_765) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_451|) (not (= (ite (and (< .cse3 v_~size~0_360) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_606| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| (ite (and (< .cse4 v_~size~0_360) (<= 0 .cse4)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|) (= (select .cse1 (+ v_~f~0.offset_352 (* 4 .cse4))) v_~x2~0_588) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_441| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_360)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_441|) (not (= (ite (and (<= 0 v_~x2~0_589) (< v_~x2~0_589 v_~size~0_360)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_589, ~size~0=v_~size~0_360, ~f~0.base=v_~f~0.base_352, #memory_int=|v_#memory_int_473|, ~n~0=v_~n~0_359, ~x1~0=v_~x1~0_767, ~f~0.offset=v_~f~0.offset_352} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_459|, ~x2~0=v_~x2~0_588, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_322|, ~size~0=v_~size~0_360, ~f~0.base=v_~f~0.base_352, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_326|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_451|, ~x1~0=v_~x1~0_765, ~f~0.offset=v_~f~0.offset_352, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_360|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_441|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_606|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_457|, #memory_int=|v_#memory_int_473|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_312|, ~n~0=v_~n~0_359, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_467|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_312|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:39,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_431| v_~f~0.base_316))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_316 (* v_~x2~0_514 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_316 (* .cse5 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_316 (* .cse6 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_316 (* .cse4 4))))) (let ((.cse0 (* 2 (mod v_~n~0_323 2147483648))) (.cse3 (select .cse2 (+ v_~f~0.offset_316 (* .cse1 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_536| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_313| 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_324)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_316 (* v_~x1~0_664 4))) v_~x1~0_663) (not (= (ite (and (< v_~x2~0_514 v_~size~0_324) (<= 0 v_~x2~0_514)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_392| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_289| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_324)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_376| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_392|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_376| (ite (and (<= 0 v_~x1~0_664) (< v_~x1~0_664 v_~size~0_324)) 1 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_324)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_535| (+ |v_thread1Thread1of1ForFork0_~i~0#1_536| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_289| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_313|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_324)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_402|) (< 4 .cse0) (not (= (ite (and (< .cse6 v_~size~0_324) (<= 0 .cse6)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_316 (* .cse3 4))) v_~x2~0_512)))))))) InVars {~x2~0=v_~x2~0_514, ~size~0=v_~size~0_324, ~f~0.base=v_~f~0.base_316, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_536|, #memory_int=|v_#memory_int_431|, ~n~0=v_~n~0_323, ~x1~0=v_~x1~0_664, ~f~0.offset=v_~f~0.offset_316} OutVars{~x2~0=v_~x2~0_512, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_394|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_275|, ~size~0=v_~size~0_324, ~f~0.base=v_~f~0.base_316, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_279|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_289|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_402|, ~x1~0=v_~x1~0_663, ~f~0.offset=v_~f~0.offset_316, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_313|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_376|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_535|, #memory_int=|v_#memory_int_431|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_392|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_265|, ~n~0=v_~n~0_323, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_265|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_402|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:40,235 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 08:02:40,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2447 [2022-12-06 08:02:40,235 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 554 transitions, 17771 flow [2022-12-06 08:02:40,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:40,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:40,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:40,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:40,447 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2097886631, now seen corresponding path program 1 times [2022-12-06 08:02:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:40,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816172942] [2022-12-06 08:02:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:40,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816172942] [2022-12-06 08:02:40,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816172942] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:40,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948448210] [2022-12-06 08:02:40,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:40,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:40,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:40,519 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:40,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 08:02:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:40,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 08:02:40,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:40,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:40,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948448210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:40,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:40,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 08:02:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422971482] [2022-12-06 08:02:40,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:40,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 08:02:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 08:02:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 08:02:40,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 08:02:40,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 554 transitions, 17771 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:40,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:40,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 08:02:40,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:45,014 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 [] [2022-12-06 08:02:46,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:02:47,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:02:50,162 INFO L130 PetriNetUnfolder]: 2587/5020 cut-off events. [2022-12-06 08:02:50,162 INFO L131 PetriNetUnfolder]: For 430669/430669 co-relation queries the response was YES. [2022-12-06 08:02:50,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74132 conditions, 5020 events. 2587/5020 cut-off events. For 430669/430669 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 38969 event pairs, 464 based on Foata normal form. 84/5102 useless extension candidates. Maximal degree in co-relation 73578. Up to 2115 conditions per place. [2022-12-06 08:02:50,226 INFO L137 encePairwiseOnDemand]: 44/75 looper letters, 503 selfloop transitions, 279 changer transitions 32/814 dead transitions. [2022-12-06 08:02:50,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 814 transitions, 27195 flow [2022-12-06 08:02:50,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 08:02:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 08:02:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 164 transitions. [2022-12-06 08:02:50,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12862745098039216 [2022-12-06 08:02:50,227 INFO L175 Difference]: Start difference. First operand has 344 places, 554 transitions, 17771 flow. Second operand 17 states and 164 transitions. [2022-12-06 08:02:50,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 814 transitions, 27195 flow [2022-12-06 08:02:52,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 814 transitions, 25940 flow, removed 601 selfloop flow, removed 3 redundant places. [2022-12-06 08:02:52,310 INFO L231 Difference]: Finished difference. Result has 367 places, 695 transitions, 22525 flow [2022-12-06 08:02:52,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=16362, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=22525, PETRI_PLACES=367, PETRI_TRANSITIONS=695} [2022-12-06 08:02:52,311 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 346 predicate places. [2022-12-06 08:02:52,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:02:52,311 INFO L89 Accepts]: Start accepts. Operand has 367 places, 695 transitions, 22525 flow [2022-12-06 08:02:52,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:02:52,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:02:52,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 367 places, 695 transitions, 22525 flow [2022-12-06 08:02:52,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 695 transitions, 22525 flow [2022-12-06 08:02:52,805 INFO L130 PetriNetUnfolder]: 704/2060 cut-off events. [2022-12-06 08:02:52,805 INFO L131 PetriNetUnfolder]: For 199863/199949 co-relation queries the response was YES. [2022-12-06 08:02:52,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32327 conditions, 2060 events. 704/2060 cut-off events. For 199863/199949 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 18853 event pairs, 84 based on Foata normal form. 6/2031 useless extension candidates. Maximal degree in co-relation 32003. Up to 841 conditions per place. [2022-12-06 08:02:52,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 695 transitions, 22525 flow [2022-12-06 08:02:52,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 1744 [2022-12-06 08:02:52,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 08:02:52,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:53,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:53,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:53,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_545| v_~f~0.base_404))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_404 (* v_~x2~0_731 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_404 (* v_~x1~0_926 4)))) (.cse8 (select .cse1 (+ v_~f~0.offset_404 (* 4 .cse9))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_404 (* .cse8 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_404 (* .cse6 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_404 (* .cse7 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_404 (* .cse3 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_404 (* .cse5 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_404 (* .cse4 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_412)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_556|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_551|) 4294967296) (* (mod v_~n~0_411 2147483648) 2)) (= (select .cse1 (+ v_~f~0.offset_404 (* .cse2 4))) v_~x2~0_730) (not (= (ite (and (< .cse3 v_~size~0_412) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_732| 5) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_427| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_412)) 1 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_551|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_556| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_427| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_451|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_412)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_451| 0)) (not (= (ite (and (< .cse5 v_~size~0_412) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_412) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_412) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_731) (< v_~x2~0_731 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_926) (< v_~x1~0_926 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_412) (<= 0 .cse9)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_404 (* .cse0 4))) v_~x1~0_924)))))))) InVars {~x2~0=v_~x2~0_731, ~size~0=v_~size~0_412, ~f~0.base=v_~f~0.base_404, #memory_int=|v_#memory_int_545|, ~n~0=v_~n~0_411, ~x1~0=v_~x1~0_926, ~f~0.offset=v_~f~0.offset_404} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_558|, ~x2~0=v_~x2~0_730, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_413|, ~size~0=v_~size~0_412, ~f~0.base=v_~f~0.base_404, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_417|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_427|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_551|, ~x1~0=v_~x1~0_924, ~f~0.offset=v_~f~0.offset_404, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_451|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_732|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_556|, #memory_int=|v_#memory_int_545|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_403|, ~n~0=v_~n~0_411, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_566|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_403|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 08:02:54,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_545| v_~f~0.base_404))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_404 (* v_~x2~0_731 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_404 (* v_~x1~0_926 4)))) (.cse8 (select .cse1 (+ v_~f~0.offset_404 (* 4 .cse9))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_404 (* .cse8 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_404 (* .cse6 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_404 (* .cse7 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_404 (* .cse3 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_404 (* .cse5 4)))) (.cse0 (select .cse1 (+ v_~f~0.offset_404 (* .cse4 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_412)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_556|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_551|) 4294967296) (* (mod v_~n~0_411 2147483648) 2)) (= (select .cse1 (+ v_~f~0.offset_404 (* .cse2 4))) v_~x2~0_730) (not (= (ite (and (< .cse3 v_~size~0_412) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_732| 5) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_427| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_412)) 1 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_551|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_556| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_427| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_451|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_412)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_451| 0)) (not (= (ite (and (< .cse5 v_~size~0_412) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_412) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_412) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_731) (< v_~x2~0_731 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_926) (< v_~x1~0_926 v_~size~0_412)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_412) (<= 0 .cse9)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_404 (* .cse0 4))) v_~x1~0_924)))))))) InVars {~x2~0=v_~x2~0_731, ~size~0=v_~size~0_412, ~f~0.base=v_~f~0.base_404, #memory_int=|v_#memory_int_545|, ~n~0=v_~n~0_411, ~x1~0=v_~x1~0_926, ~f~0.offset=v_~f~0.offset_404} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_558|, ~x2~0=v_~x2~0_730, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_413|, ~size~0=v_~size~0_412, ~f~0.base=v_~f~0.base_404, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_417|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_427|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_551|, ~x1~0=v_~x1~0_924, ~f~0.offset=v_~f~0.offset_404, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_451|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_732|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_556|, #memory_int=|v_#memory_int_545|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_403|, ~n~0=v_~n~0_411, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_566|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_403|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:55,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:55,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse4 (select |v_#memory_int_566| v_~f~0.base_424))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_424 (* v_~x2~0_776 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_424 (* v_~x1~0_961 4)))) (.cse10 (select .cse4 (+ v_~f~0.offset_424 (* 4 .cse7))))) (let ((.cse2 (select .cse4 (+ (* .cse10 4) v_~f~0.offset_424))) (.cse9 (select .cse4 (+ v_~f~0.offset_424 (* .cse8 4))))) (let ((.cse6 (select .cse4 (+ (* 4 .cse9) v_~f~0.offset_424))) (.cse3 (select .cse4 (+ (* 4 .cse2) v_~f~0.offset_424)))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_424 (* .cse3 4)))) (.cse5 (select .cse4 (+ v_~f~0.offset_424 (* .cse6 4)))) (.cse1 (* (mod v_~n~0_433 2147483648) 2))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_455| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_432)) 1 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_75|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_590|) 4294967296) .cse1) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_432)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_432)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_961 v_~size~0_432) (<= 0 v_~x1~0_961)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_770| 5) (= v_~x1~0_960 (select .cse4 (+ (* 4 .cse5) v_~f~0.offset_424))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_75| 0) (not (= (ite (and (< .cse6 v_~size~0_432) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_580| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_564| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_580|) (not (= (ite (and (<= 0 v_~x2~0_776) (< v_~x2~0_776 v_~size~0_432)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_432) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_432) (<= 0 .cse8)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_590|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_432)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_424 (* .cse0 4))) v_~x2~0_775) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_432)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_432)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_564|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_479| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_455| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_479|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_590| 4294967296) .cse1))))))))) InVars {~x2~0=v_~x2~0_776, ~size~0=v_~size~0_432, ~f~0.base=v_~f~0.base_424, #memory_int=|v_#memory_int_566|, ~n~0=v_~n~0_433, ~x1~0=v_~x1~0_961, ~f~0.offset=v_~f~0.offset_424} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_582|, ~x2~0=v_~x2~0_775, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_441|, ~size~0=v_~size~0_432, ~f~0.base=v_~f~0.base_424, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_75|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_445|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_455|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_590|, ~x1~0=v_~x1~0_960, ~f~0.offset=v_~f~0.offset_424, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_479|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_564|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_75|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_770|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_580|, #memory_int=|v_#memory_int_566|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_431|, ~n~0=v_~n~0_433, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_590|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_431|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:56,458 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_379| v_~f~0.base_272))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_272 (* v_~x2~0_408 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_272 (* .cse0 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_272 (* v_~x1~0_565 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_272 (* .cse5 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_272 (* .cse3 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_280) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_408) (< v_~x2~0_408 v_~size~0_280)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_328| 4) (= (select .cse1 (+ v_~f~0.offset_272 (* .cse2 4))) v_~x2~0_406) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_280)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_317| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_333|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_458| 4294967295) 4294967296) (* (mod v_~n~0_279 2147483648) 2)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_280)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_317|) (not (= (ite (and (< .cse5 v_~size~0_280) (<= 0 .cse5)) 1 0) 0)) (= v_~x1~0_563 (select .cse1 (+ v_~f~0.offset_272 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| (ite (and (< .cse2 v_~size~0_280) (<= 0 .cse2)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_458| 3) (not (= (ite (and (< v_~x1~0_565 v_~size~0_280) (<= 0 v_~x1~0_565)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_333| 0))))))) InVars {~x2~0=v_~x2~0_408, ~size~0=v_~size~0_280, ~f~0.base=v_~f~0.base_272, #memory_int=|v_#memory_int_379|, ~n~0=v_~n~0_279, ~x1~0=v_~x1~0_565, ~f~0.offset=v_~f~0.offset_272} OutVars{~x2~0=v_~x2~0_406, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_335|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_211|, ~size~0=v_~size~0_280, ~f~0.base=v_~f~0.base_272, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_215|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_328|, ~x1~0=v_~x1~0_563, ~f~0.offset=v_~f~0.offset_272, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_458|, #memory_int=|v_#memory_int_379|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_333|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_201|, ~n~0=v_~n~0_279, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_201|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_343|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:56,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [865] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_568| v_~f~0.base_426))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_426 (* v_~x2~0_780 4)))) (.cse1 (select .cse4 (+ v_~f~0.offset_426 (* v_~x1~0_966 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_426 (* .cse1 4)))) (.cse0 (select .cse4 (+ v_~f~0.offset_426 (* .cse10 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_426 (* .cse0 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_426 (* .cse9 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_426 (* 4 .cse2)))) (.cse7 (select .cse4 (+ v_~f~0.offset_426 (* .cse8 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_426 (* 4 .cse7)))) (.cse6 (select .cse4 (+ v_~f~0.offset_426 (* .cse3 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_966) (< v_~x1~0_966 v_~size~0_434)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_592|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_434)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_434) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_434)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_434)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|) (= (select .cse4 (+ v_~f~0.offset_426 (* .cse5 4))) v_~x2~0_779) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566| (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_434)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_457| (ite (and (< .cse5 v_~size~0_434) (<= 0 .cse5)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_434) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_434)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_592|) 4294967296) (* 2 (mod v_~n~0_435 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_457| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|) (not (= (ite (and (<= 0 v_~x2~0_780) (< v_~x2~0_780 v_~size~0_434)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_772| 6) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_434)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582| 0)) (not (= (ite (and (< .cse10 v_~size~0_434) (<= 0 .cse10)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_426 (* .cse6 4))) v_~x1~0_964)))))))) InVars {~x2~0=v_~x2~0_780, ~size~0=v_~size~0_434, ~f~0.base=v_~f~0.base_426, #memory_int=|v_#memory_int_568|, ~n~0=v_~n~0_435, ~x1~0=v_~x1~0_966, ~f~0.offset=v_~f~0.offset_426} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_584|, ~x2~0=v_~x2~0_779, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_443|, ~size~0=v_~size~0_434, ~f~0.base=v_~f~0.base_426, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_447|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_457|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_592|, ~x1~0=v_~x1~0_964, ~f~0.offset=v_~f~0.offset_426, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_772|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|, #memory_int=|v_#memory_int_568|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_433|, ~n~0=v_~n~0_435, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_592|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_433|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [867] L59-2-->L49-2: Formula: (let ((.cse0 (* (mod v_~n~0_439 2147483648) 2))) (and (= (ite (and (<= 0 v_~x1~0_975) (< v_~x1~0_975 v_~size~0_438)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_572|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_77| 0) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_779| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_778| (+ |v_thread1Thread1of1ForFork0_~i~0#1_779| 1)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_598| 4294967296) .cse0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_77|) (= (select (select |v_#memory_int_572| v_~f~0.base_430) (+ v_~f~0.offset_430 (* v_~x1~0_975 4))) v_~x1~0_974) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_572| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_588|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_588| 0)))) InVars {~size~0=v_~size~0_438, ~f~0.base=v_~f~0.base_430, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_779|, #memory_int=|v_#memory_int_572|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_598|, ~n~0=v_~n~0_439, ~x1~0=v_~x1~0_975, ~f~0.offset=v_~f~0.offset_430} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_590|, ~size~0=v_~size~0_438, ~f~0.base=v_~f~0.base_430, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_598|, ~x1~0=v_~x1~0_974, ~f~0.offset=v_~f~0.offset_430, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_572|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_77|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_778|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_588|, #memory_int=|v_#memory_int_572|, ~n~0=v_~n~0_439, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_598|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:57,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [865] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_568| v_~f~0.base_426))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_426 (* v_~x2~0_780 4)))) (.cse1 (select .cse4 (+ v_~f~0.offset_426 (* v_~x1~0_966 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_426 (* .cse1 4)))) (.cse0 (select .cse4 (+ v_~f~0.offset_426 (* .cse10 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_426 (* .cse0 4)))) (.cse2 (select .cse4 (+ v_~f~0.offset_426 (* .cse9 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_426 (* 4 .cse2)))) (.cse7 (select .cse4 (+ v_~f~0.offset_426 (* .cse8 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_426 (* 4 .cse7)))) (.cse6 (select .cse4 (+ v_~f~0.offset_426 (* .cse3 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_966) (< v_~x1~0_966 v_~size~0_434)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_592|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_434)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_434) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_434)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_434)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|) (= (select .cse4 (+ v_~f~0.offset_426 (* .cse5 4))) v_~x2~0_779) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566| (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_434)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_457| (ite (and (< .cse5 v_~size~0_434) (<= 0 .cse5)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_434) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_434)) 1 0) 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_592|) 4294967296) (* 2 (mod v_~n~0_435 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_457| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|) (not (= (ite (and (<= 0 v_~x2~0_780) (< v_~x2~0_780 v_~size~0_434)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_772| 6) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_434)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582| 0)) (not (= (ite (and (< .cse10 v_~size~0_434) (<= 0 .cse10)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_426 (* .cse6 4))) v_~x1~0_964)))))))) InVars {~x2~0=v_~x2~0_780, ~size~0=v_~size~0_434, ~f~0.base=v_~f~0.base_426, #memory_int=|v_#memory_int_568|, ~n~0=v_~n~0_435, ~x1~0=v_~x1~0_966, ~f~0.offset=v_~f~0.offset_426} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_584|, ~x2~0=v_~x2~0_779, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_443|, ~size~0=v_~size~0_434, ~f~0.base=v_~f~0.base_426, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_447|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_457|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_592|, ~x1~0=v_~x1~0_964, ~f~0.offset=v_~f~0.offset_426, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_772|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_582|, #memory_int=|v_#memory_int_568|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_433|, ~n~0=v_~n~0_435, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_592|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_433|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:02:58,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:58,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 08:02:59,045 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 08:02:59,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6734 [2022-12-06 08:02:59,045 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 691 transitions, 23005 flow [2022-12-06 08:02:59,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:59,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:02:59,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:02:59,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 08:02:59,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2022-12-06 08:02:59,248 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:02:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:02:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash -18306542, now seen corresponding path program 1 times [2022-12-06 08:02:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:02:59,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933632467] [2022-12-06 08:02:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:02:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:59,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:02:59,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933632467] [2022-12-06 08:02:59,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933632467] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:02:59,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144106231] [2022-12-06 08:02:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:02:59,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:02:59,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:02:59,307 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:02:59,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 08:02:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:02:59,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:02:59,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:02:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:59,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:59,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144106231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:59,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:59,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 08:02:59,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659217482] [2022-12-06 08:02:59,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:59,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 08:02:59,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:59,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 08:02:59,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 08:02:59,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 88 [2022-12-06 08:02:59,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 691 transitions, 23005 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:59,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:59,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 88 [2022-12-06 08:02:59,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:03,455 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 [] [2022-12-06 08:03:04,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:03:06,649 INFO L130 PetriNetUnfolder]: 2643/5035 cut-off events. [2022-12-06 08:03:06,649 INFO L131 PetriNetUnfolder]: For 474370/474370 co-relation queries the response was YES. [2022-12-06 08:03:06,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78599 conditions, 5035 events. 2643/5035 cut-off events. For 474370/474370 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 38400 event pairs, 940 based on Foata normal form. 26/5061 useless extension candidates. Maximal degree in co-relation 78057. Up to 4198 conditions per place. [2022-12-06 08:03:06,716 INFO L137 encePairwiseOnDemand]: 33/88 looper letters, 531 selfloop transitions, 268 changer transitions 13/812 dead transitions. [2022-12-06 08:03:06,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 812 transitions, 28849 flow [2022-12-06 08:03:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 08:03:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 08:03:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-12-06 08:03:06,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14886363636363636 [2022-12-06 08:03:06,717 INFO L175 Difference]: Start difference. First operand has 360 places, 691 transitions, 23005 flow. Second operand 10 states and 131 transitions. [2022-12-06 08:03:06,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 812 transitions, 28849 flow [2022-12-06 08:03:09,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 812 transitions, 26779 flow, removed 1018 selfloop flow, removed 4 redundant places. [2022-12-06 08:03:09,300 INFO L231 Difference]: Finished difference. Result has 370 places, 748 transitions, 24097 flow [2022-12-06 08:03:09,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=21323, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=24097, PETRI_PLACES=370, PETRI_TRANSITIONS=748} [2022-12-06 08:03:09,301 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 349 predicate places. [2022-12-06 08:03:09,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:09,301 INFO L89 Accepts]: Start accepts. Operand has 370 places, 748 transitions, 24097 flow [2022-12-06 08:03:09,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:09,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:09,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 370 places, 748 transitions, 24097 flow [2022-12-06 08:03:09,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 748 transitions, 24097 flow [2022-12-06 08:03:09,795 INFO L130 PetriNetUnfolder]: 746/2114 cut-off events. [2022-12-06 08:03:09,795 INFO L131 PetriNetUnfolder]: For 210777/210866 co-relation queries the response was YES. [2022-12-06 08:03:09,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33500 conditions, 2114 events. 746/2114 cut-off events. For 210777/210866 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 19066 event pairs, 86 based on Foata normal form. 6/2085 useless extension candidates. Maximal degree in co-relation 33164. Up to 772 conditions per place. [2022-12-06 08:03:09,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 363 places, 748 transitions, 24097 flow [2022-12-06 08:03:09,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 1828 [2022-12-06 08:03:10,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [835] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_520| v_~f~0.base_388))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_388 (* v_~x2~0_685 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_388 (* v_~x1~0_877 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_388 (* .cse4 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_388 (* .cse5 4)))) (.cse3 (select .cse1 (+ (* .cse0 4) v_~f~0.offset_388)))) (and (not (= (ite (and (< v_~x1~0_877 v_~size~0_396) (<= 0 v_~x1~0_877)) 1 0) 0)) (not (= 0 (ite (and (< .cse0 v_~size~0_396) (<= 0 .cse0)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_421| 0)) (= (select .cse1 (+ v_~f~0.offset_388 (* .cse2 4))) v_~x2~0_684) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_508| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_524|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_524| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_520| 4) (= |v_thread1Thread1of1ForFork0_~i~0#1_692| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_508| (ite (and (< .cse3 v_~size~0_396) (<= 0 .cse3)) 1 0)) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_520|) 4294967296) (* 2 (mod v_~n~0_395 2147483648))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_396)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_685 v_~size~0_396) (<= 0 v_~x2~0_685)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_396) (<= 0 .cse5)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_396)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_397|) (= (select .cse1 (+ v_~f~0.offset_388 (* .cse3 4))) v_~x1~0_875) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_397| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_421|)))))) InVars {~x2~0=v_~x2~0_685, ~size~0=v_~size~0_396, ~f~0.base=v_~f~0.base_388, #memory_int=|v_#memory_int_520|, ~n~0=v_~n~0_395, ~x1~0=v_~x1~0_877, ~f~0.offset=v_~f~0.offset_388} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_526|, ~x2~0=v_~x2~0_684, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_383|, ~size~0=v_~size~0_396, ~f~0.base=v_~f~0.base_388, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_387|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_397|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_520|, ~x1~0=v_~x1~0_875, ~f~0.offset=v_~f~0.offset_388, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_421|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_508|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_692|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_524|, #memory_int=|v_#memory_int_520|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_373|, ~n~0=v_~n~0_395, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_534|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_373|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:03:10,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:03:10,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1377 [2022-12-06 08:03:10,678 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 748 transitions, 24197 flow [2022-12-06 08:03:10,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:10,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:10,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:10,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 08:03:10,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:10,881 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1254235768, now seen corresponding path program 1 times [2022-12-06 08:03:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:10,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337665525] [2022-12-06 08:03:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:10,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:03:11,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337665525] [2022-12-06 08:03:11,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337665525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:03:11,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849135243] [2022-12-06 08:03:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:11,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:03:11,010 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:03:11,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 08:03:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:11,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 08:03:11,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:03:11,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:03:11,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 08:03:11,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:03:11,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:03:11,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 08:03:11,302 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 08:03:11,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 64 [2022-12-06 08:03:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:11,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:03:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:11,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849135243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:03:11,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:03:11,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 08:03:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998176167] [2022-12-06 08:03:11,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:03:11,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 08:03:11,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:03:11,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 08:03:11,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-06 08:03:11,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-06 08:03:11,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 748 transitions, 24197 flow. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:11,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:03:11,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-06 08:03:11,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:13,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 08:03:16,927 INFO L130 PetriNetUnfolder]: 2640/5018 cut-off events. [2022-12-06 08:03:16,928 INFO L131 PetriNetUnfolder]: For 485222/485222 co-relation queries the response was YES. [2022-12-06 08:03:16,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77549 conditions, 5018 events. 2640/5018 cut-off events. For 485222/485222 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 38264 event pairs, 951 based on Foata normal form. 10/5028 useless extension candidates. Maximal degree in co-relation 76986. Up to 4342 conditions per place. [2022-12-06 08:03:16,989 INFO L137 encePairwiseOnDemand]: 21/85 looper letters, 575 selfloop transitions, 233 changer transitions 8/816 dead transitions. [2022-12-06 08:03:16,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 816 transitions, 27976 flow [2022-12-06 08:03:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 08:03:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 08:03:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 141 transitions. [2022-12-06 08:03:16,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11848739495798319 [2022-12-06 08:03:16,991 INFO L175 Difference]: Start difference. First operand has 363 places, 748 transitions, 24197 flow. Second operand 14 states and 141 transitions. [2022-12-06 08:03:16,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 816 transitions, 27976 flow [2022-12-06 08:03:19,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 816 transitions, 27308 flow, removed 334 selfloop flow, removed 4 redundant places. [2022-12-06 08:03:19,105 INFO L231 Difference]: Finished difference. Result has 374 places, 756 transitions, 24629 flow [2022-12-06 08:03:19,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=23593, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=24629, PETRI_PLACES=374, PETRI_TRANSITIONS=756} [2022-12-06 08:03:19,105 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 353 predicate places. [2022-12-06 08:03:19,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:19,105 INFO L89 Accepts]: Start accepts. Operand has 374 places, 756 transitions, 24629 flow [2022-12-06 08:03:19,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:19,109 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:19,109 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 374 places, 756 transitions, 24629 flow [2022-12-06 08:03:19,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 756 transitions, 24629 flow [2022-12-06 08:03:19,654 INFO L130 PetriNetUnfolder]: 750/2123 cut-off events. [2022-12-06 08:03:19,654 INFO L131 PetriNetUnfolder]: For 205184/205251 co-relation queries the response was YES. [2022-12-06 08:03:19,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33536 conditions, 2123 events. 750/2123 cut-off events. For 205184/205251 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 19200 event pairs, 88 based on Foata normal form. 6/2095 useless extension candidates. Maximal degree in co-relation 33194. Up to 767 conditions per place. [2022-12-06 08:03:19,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 756 transitions, 24629 flow [2022-12-06 08:03:19,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 1844 [2022-12-06 08:03:19,696 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:03:19,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 591 [2022-12-06 08:03:19,697 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 756 transitions, 24629 flow [2022-12-06 08:03:19,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:19,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:19,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:19,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 08:03:19,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:19,897 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:19,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -256570560, now seen corresponding path program 1 times [2022-12-06 08:03:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:19,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314840458] [2022-12-06 08:03:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:03:19,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314840458] [2022-12-06 08:03:19,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314840458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:03:19,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:03:19,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 08:03:19,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430899367] [2022-12-06 08:03:19,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:03:19,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 08:03:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:03:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 08:03:19,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 08:03:19,958 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-06 08:03:19,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 756 transitions, 24629 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:19,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:03:19,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-06 08:03:19,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:21,998 INFO L130 PetriNetUnfolder]: 2646/5032 cut-off events. [2022-12-06 08:03:21,998 INFO L131 PetriNetUnfolder]: For 470810/470810 co-relation queries the response was YES. [2022-12-06 08:03:22,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77232 conditions, 5032 events. 2646/5032 cut-off events. For 470810/470810 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 38376 event pairs, 1032 based on Foata normal form. 6/5038 useless extension candidates. Maximal degree in co-relation 76656. Up to 4438 conditions per place. [2022-12-06 08:03:22,063 INFO L137 encePairwiseOnDemand]: 45/84 looper letters, 621 selfloop transitions, 158 changer transitions 0/779 dead transitions. [2022-12-06 08:03:22,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 779 transitions, 26830 flow [2022-12-06 08:03:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 08:03:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 08:03:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-06 08:03:22,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-06 08:03:22,064 INFO L175 Difference]: Start difference. First operand has 371 places, 756 transitions, 24629 flow. Second operand 6 states and 105 transitions. [2022-12-06 08:03:22,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 779 transitions, 26830 flow [2022-12-06 08:03:24,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 779 transitions, 26183 flow, removed 224 selfloop flow, removed 8 redundant places. [2022-12-06 08:03:24,194 INFO L231 Difference]: Finished difference. Result has 369 places, 756 transitions, 24380 flow [2022-12-06 08:03:24,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=23803, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24380, PETRI_PLACES=369, PETRI_TRANSITIONS=756} [2022-12-06 08:03:24,195 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 348 predicate places. [2022-12-06 08:03:24,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:24,195 INFO L89 Accepts]: Start accepts. Operand has 369 places, 756 transitions, 24380 flow [2022-12-06 08:03:24,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:24,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:24,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 369 places, 756 transitions, 24380 flow [2022-12-06 08:03:24,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 756 transitions, 24380 flow [2022-12-06 08:03:24,691 INFO L130 PetriNetUnfolder]: 751/2131 cut-off events. [2022-12-06 08:03:24,691 INFO L131 PetriNetUnfolder]: For 207683/207756 co-relation queries the response was YES. [2022-12-06 08:03:24,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33502 conditions, 2131 events. 751/2131 cut-off events. For 207683/207756 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 19337 event pairs, 87 based on Foata normal form. 7/2106 useless extension candidates. Maximal degree in co-relation 33158. Up to 769 conditions per place. [2022-12-06 08:03:24,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 369 places, 756 transitions, 24380 flow [2022-12-06 08:03:24,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-06 08:03:24,732 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:03:24,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 538 [2022-12-06 08:03:24,733 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 756 transitions, 24380 flow [2022-12-06 08:03:24,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:24,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:24,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:24,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 08:03:24,733 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:24,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash 706786108, now seen corresponding path program 1 times [2022-12-06 08:03:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:24,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667275684] [2022-12-06 08:03:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:25,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:03:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667275684] [2022-12-06 08:03:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667275684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:03:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 08:03:25,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 08:03:25,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596624663] [2022-12-06 08:03:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:03:25,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 08:03:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:03:25,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 08:03:25,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 08:03:25,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 08:03:25,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 756 transitions, 24380 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:25,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:03:25,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 08:03:25,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:28,713 INFO L130 PetriNetUnfolder]: 2708/5161 cut-off events. [2022-12-06 08:03:28,713 INFO L131 PetriNetUnfolder]: For 475136/475136 co-relation queries the response was YES. [2022-12-06 08:03:28,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78845 conditions, 5161 events. 2708/5161 cut-off events. For 475136/475136 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 39564 event pairs, 540 based on Foata normal form. 2/5163 useless extension candidates. Maximal degree in co-relation 78265. Up to 4820 conditions per place. [2022-12-06 08:03:28,780 INFO L137 encePairwiseOnDemand]: 20/81 looper letters, 663 selfloop transitions, 131 changer transitions 15/809 dead transitions. [2022-12-06 08:03:28,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 809 transitions, 27514 flow [2022-12-06 08:03:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 08:03:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 08:03:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-06 08:03:28,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-06 08:03:28,781 INFO L175 Difference]: Start difference. First operand has 369 places, 756 transitions, 24380 flow. Second operand 7 states and 126 transitions. [2022-12-06 08:03:28,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 809 transitions, 27514 flow [2022-12-06 08:03:31,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 809 transitions, 27316 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 08:03:31,059 INFO L231 Difference]: Finished difference. Result has 377 places, 781 transitions, 25729 flow [2022-12-06 08:03:31,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=24202, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=25729, PETRI_PLACES=377, PETRI_TRANSITIONS=781} [2022-12-06 08:03:31,060 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 356 predicate places. [2022-12-06 08:03:31,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:31,060 INFO L89 Accepts]: Start accepts. Operand has 377 places, 781 transitions, 25729 flow [2022-12-06 08:03:31,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:31,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:31,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 377 places, 781 transitions, 25729 flow [2022-12-06 08:03:31,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 781 transitions, 25729 flow [2022-12-06 08:03:31,586 INFO L130 PetriNetUnfolder]: 775/2200 cut-off events. [2022-12-06 08:03:31,586 INFO L131 PetriNetUnfolder]: For 216801/216893 co-relation queries the response was YES. [2022-12-06 08:03:31,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34682 conditions, 2200 events. 775/2200 cut-off events. For 216801/216893 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 20057 event pairs, 92 based on Foata normal form. 13/2179 useless extension candidates. Maximal degree in co-relation 34334. Up to 773 conditions per place. [2022-12-06 08:03:31,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 781 transitions, 25729 flow [2022-12-06 08:03:31,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 1892 [2022-12-06 08:03:35,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 08:03:35,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4009 [2022-12-06 08:03:35,069 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 781 transitions, 25787 flow [2022-12-06 08:03:35,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:35,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:35,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:35,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 08:03:35,070 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1214131568, now seen corresponding path program 1 times [2022-12-06 08:03:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:35,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672633770] [2022-12-06 08:03:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:03:35,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672633770] [2022-12-06 08:03:35,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672633770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:03:35,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178741685] [2022-12-06 08:03:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:03:35,130 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:03:35,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 08:03:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:35,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 08:03:35,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:03:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:35,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:03:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:35,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178741685] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:03:35,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:03:35,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 08:03:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173310020] [2022-12-06 08:03:35,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:03:35,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 08:03:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:03:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 08:03:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 08:03:35,339 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 83 [2022-12-06 08:03:35,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 781 transitions, 25787 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:35,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:03:35,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 83 [2022-12-06 08:03:35,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:39,169 INFO L130 PetriNetUnfolder]: 2746/5222 cut-off events. [2022-12-06 08:03:39,169 INFO L131 PetriNetUnfolder]: For 501438/501438 co-relation queries the response was YES. [2022-12-06 08:03:39,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81165 conditions, 5222 events. 2746/5222 cut-off events. For 501438/501438 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 39922 event pairs, 1135 based on Foata normal form. 44/5266 useless extension candidates. Maximal degree in co-relation 80424. Up to 4910 conditions per place. [2022-12-06 08:03:39,243 INFO L137 encePairwiseOnDemand]: 60/83 looper letters, 742 selfloop transitions, 80 changer transitions 3/825 dead transitions. [2022-12-06 08:03:39,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 825 transitions, 28888 flow [2022-12-06 08:03:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 08:03:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 08:03:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2022-12-06 08:03:39,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18825301204819278 [2022-12-06 08:03:39,244 INFO L175 Difference]: Start difference. First operand has 377 places, 781 transitions, 25787 flow. Second operand 8 states and 125 transitions. [2022-12-06 08:03:39,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 825 transitions, 28888 flow [2022-12-06 08:03:41,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 825 transitions, 28677 flow, removed 56 selfloop flow, removed 1 redundant places. [2022-12-06 08:03:41,639 INFO L231 Difference]: Finished difference. Result has 387 places, 785 transitions, 26157 flow [2022-12-06 08:03:41,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=25506, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=26157, PETRI_PLACES=387, PETRI_TRANSITIONS=785} [2022-12-06 08:03:41,640 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 366 predicate places. [2022-12-06 08:03:41,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:41,640 INFO L89 Accepts]: Start accepts. Operand has 387 places, 785 transitions, 26157 flow [2022-12-06 08:03:41,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:41,643 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:41,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 387 places, 785 transitions, 26157 flow [2022-12-06 08:03:41,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 386 places, 785 transitions, 26157 flow [2022-12-06 08:03:42,181 INFO L130 PetriNetUnfolder]: 787/2229 cut-off events. [2022-12-06 08:03:42,181 INFO L131 PetriNetUnfolder]: For 230921/231012 co-relation queries the response was YES. [2022-12-06 08:03:42,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35897 conditions, 2229 events. 787/2229 cut-off events. For 230921/231012 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 20298 event pairs, 92 based on Foata normal form. 13/2210 useless extension candidates. Maximal degree in co-relation 35462. Up to 783 conditions per place. [2022-12-06 08:03:42,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 386 places, 785 transitions, 26157 flow [2022-12-06 08:03:42,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-06 08:03:42,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [877] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_582| v_~f~0.base_440))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_440 (* v_~x1~0_1002 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_440 (* v_~x2~0_808 4)))) (.cse3 (select .cse2 (+ v_~f~0.offset_440 (* 4 .cse4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_440 (* .cse3 4)))) (.cse11 (select .cse2 (+ v_~f~0.offset_440 (* .cse6 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_440 (* .cse11 4)))) (.cse9 (select .cse2 (+ v_~f~0.offset_440 (* .cse0 4))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_440 (* .cse9 4)))) (.cse10 (select .cse2 (+ v_~f~0.offset_440 (* .cse5 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_440 (* .cse10 4)))) (.cse8 (select .cse2 (+ v_~f~0.offset_440 (* .cse7 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_448)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_808 v_~size~0_448) (<= 0 v_~x2~0_808)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_448)) 1 0)) (= (select .cse2 (+ v_~f~0.offset_440 (* .cse1 4))) v_~x2~0_807) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_448)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_796|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_796| 4294967295) 4294967296) (* 2 (mod v_~n~0_449 2147483648))) (not (= (ite (and (< .cse4 v_~size~0_448) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_448) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_448) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_448) (<= 0 .cse7)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604| 0)) (not (= (ite (and (<= 0 v_~x1~0_1002) (< v_~x1~0_1002 v_~size~0_448)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_588| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604|) (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_448)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_588|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_610|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_497|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_448)) 1 0) 0)) (= v_~x1~0_1000 (select .cse2 (+ v_~f~0.offset_440 (* .cse8 4)))) (not (= (ite (and (< .cse10 v_~size~0_448) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_448) (<= 0 .cse11)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_497| 0)))))))))) InVars {~x2~0=v_~x2~0_808, ~size~0=v_~size~0_448, ~f~0.base=v_~f~0.base_440, #memory_int=|v_#memory_int_582|, ~n~0=v_~n~0_449, ~x1~0=v_~x1~0_1002, ~f~0.offset=v_~f~0.offset_440} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_606|, ~x2~0=v_~x2~0_807, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_459|, ~size~0=v_~size~0_448, ~f~0.base=v_~f~0.base_440, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_463|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_610|, ~x1~0=v_~x1~0_1000, ~f~0.offset=v_~f~0.offset_440, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_497|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_588|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_796|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_604|, #memory_int=|v_#memory_int_582|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_449|, ~n~0=v_~n~0_449, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_614|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_449|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:03:43,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_541| v_~f~0.base_402))) (let ((.cse5 (select .cse2 (+ (* v_~x1~0_918 4) v_~f~0.offset_402)))) (let ((.cse6 (select .cse2 (+ (* .cse5 4) v_~f~0.offset_402)))) (let ((.cse7 (select .cse2 (+ (* .cse6 4) v_~f~0.offset_402)))) (let ((.cse4 (select .cse2 (+ (* 4 .cse7) v_~f~0.offset_402)))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_402 (* 4 .cse4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_402 (* v_~x2~0_723 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_402 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_410) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_410) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_534|) (not (= (ite (and (<= 0 v_~x1~0_918) (< v_~x1~0_918 v_~size~0_410)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_534| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_550|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_550| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_726| 4294967295) 4294967296) (* (mod v_~n~0_409 2147483648) 2)) (not (= (ite (and (<= 0 v_~x2~0_723) (< v_~x2~0_723 v_~size~0_410)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_402 (* .cse3 4))) v_~x2~0_722) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_422| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_446|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_410)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_410)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_726|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_410)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_446| 0)) (not (= (ite (and (< .cse7 v_~size~0_410) (<= 0 .cse7)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_546|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_422| (ite (and (< .cse3 v_~size~0_410) (<= 0 .cse3)) 1 0)) (= (select .cse2 (+ v_~f~0.offset_402 (* .cse1 4))) v_~x1~0_916))))))))) InVars {~x2~0=v_~x2~0_723, ~size~0=v_~size~0_410, ~f~0.base=v_~f~0.base_402, #memory_int=|v_#memory_int_541|, ~n~0=v_~n~0_409, ~x1~0=v_~x1~0_918, ~f~0.offset=v_~f~0.offset_402} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_552|, ~x2~0=v_~x2~0_722, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_408|, ~size~0=v_~size~0_410, ~f~0.base=v_~f~0.base_402, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_412|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_422|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_546|, ~x1~0=v_~x1~0_916, ~f~0.offset=v_~f~0.offset_402, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_446|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_534|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_726|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_550|, #memory_int=|v_#memory_int_541|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_398|, ~n~0=v_~n~0_409, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_560|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_398|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 08:03:44,485 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 08:03:44,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2845 [2022-12-06 08:03:44,485 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 785 transitions, 26267 flow [2022-12-06 08:03:44,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:44,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:44,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:44,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 08:03:44,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:44,686 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash 726395956, now seen corresponding path program 1 times [2022-12-06 08:03:44,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:44,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152326812] [2022-12-06 08:03:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:44,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:03:44,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152326812] [2022-12-06 08:03:44,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152326812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:03:44,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326224156] [2022-12-06 08:03:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:44,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:44,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:03:44,743 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:03:44,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-06 08:03:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:44,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 08:03:44,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:03:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:44,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:03:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:45,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326224156] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:03:45,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:03:45,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 08:03:45,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47016443] [2022-12-06 08:03:45,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:03:45,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 08:03:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:03:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 08:03:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 08:03:45,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-06 08:03:45,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 785 transitions, 26267 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:45,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:03:45,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-06 08:03:45,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:47,319 INFO L130 PetriNetUnfolder]: 2748/5215 cut-off events. [2022-12-06 08:03:47,319 INFO L131 PetriNetUnfolder]: For 522043/522043 co-relation queries the response was YES. [2022-12-06 08:03:47,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82325 conditions, 5215 events. 2748/5215 cut-off events. For 522043/522043 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 39857 event pairs, 1021 based on Foata normal form. 8/5223 useless extension candidates. Maximal degree in co-relation 81582. Up to 4528 conditions per place. [2022-12-06 08:03:47,395 INFO L137 encePairwiseOnDemand]: 32/85 looper letters, 594 selfloop transitions, 235 changer transitions 11/840 dead transitions. [2022-12-06 08:03:47,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 840 transitions, 29604 flow [2022-12-06 08:03:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 08:03:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 08:03:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2022-12-06 08:03:47,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16209150326797386 [2022-12-06 08:03:47,396 INFO L175 Difference]: Start difference. First operand has 386 places, 785 transitions, 26267 flow. Second operand 9 states and 124 transitions. [2022-12-06 08:03:47,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 840 transitions, 29604 flow [2022-12-06 08:03:50,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 840 transitions, 29292 flow, removed 148 selfloop flow, removed 3 redundant places. [2022-12-06 08:03:50,054 INFO L231 Difference]: Finished difference. Result has 393 places, 790 transitions, 26782 flow [2022-12-06 08:03:50,054 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=25951, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=26782, PETRI_PLACES=393, PETRI_TRANSITIONS=790} [2022-12-06 08:03:50,054 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 372 predicate places. [2022-12-06 08:03:50,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:50,055 INFO L89 Accepts]: Start accepts. Operand has 393 places, 790 transitions, 26782 flow [2022-12-06 08:03:50,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:50,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:50,060 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 393 places, 790 transitions, 26782 flow [2022-12-06 08:03:50,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 790 transitions, 26782 flow [2022-12-06 08:03:50,614 INFO L130 PetriNetUnfolder]: 789/2216 cut-off events. [2022-12-06 08:03:50,615 INFO L131 PetriNetUnfolder]: For 233656/233747 co-relation queries the response was YES. [2022-12-06 08:03:50,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36089 conditions, 2216 events. 789/2216 cut-off events. For 233656/233747 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 20063 event pairs, 94 based on Foata normal form. 13/2197 useless extension candidates. Maximal degree in co-relation 35647. Up to 778 conditions per place. [2022-12-06 08:03:50,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 392 places, 790 transitions, 26782 flow [2022-12-06 08:03:50,660 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 08:03:50,661 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:03:50,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 606 [2022-12-06 08:03:50,662 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 790 transitions, 26782 flow [2022-12-06 08:03:50,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:50,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:50,662 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:50,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-06 08:03:50,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-12-06 08:03:50,867 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:50,867 INFO L85 PathProgramCache]: Analyzing trace with hash 187026969, now seen corresponding path program 1 times [2022-12-06 08:03:50,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:50,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440635490] [2022-12-06 08:03:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:50,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:03:50,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:03:50,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440635490] [2022-12-06 08:03:50,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440635490] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:03:50,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832326657] [2022-12-06 08:03:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:50,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:03:50,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:03:50,929 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:03:50,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-06 08:03:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:03:51,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 08:03:51,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:03:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 08:03:51,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 08:03:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832326657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 08:03:51,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 08:03:51,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-06 08:03:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435023649] [2022-12-06 08:03:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 08:03:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 08:03:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:03:51,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 08:03:51,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 08:03:51,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-06 08:03:51,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 790 transitions, 26782 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:51,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:03:51,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-06 08:03:51,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:03:53,292 INFO L130 PetriNetUnfolder]: 2743/5200 cut-off events. [2022-12-06 08:03:53,292 INFO L131 PetriNetUnfolder]: For 517250/517250 co-relation queries the response was YES. [2022-12-06 08:03:53,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82263 conditions, 5200 events. 2743/5200 cut-off events. For 517250/517250 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 39648 event pairs, 1217 based on Foata normal form. 2/5202 useless extension candidates. Maximal degree in co-relation 81667. Up to 5192 conditions per place. [2022-12-06 08:03:53,368 INFO L137 encePairwiseOnDemand]: 82/84 looper letters, 788 selfloop transitions, 0 changer transitions 6/794 dead transitions. [2022-12-06 08:03:53,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 794 transitions, 28392 flow [2022-12-06 08:03:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 08:03:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 08:03:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-06 08:03:53,369 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 08:03:53,369 INFO L175 Difference]: Start difference. First operand has 392 places, 790 transitions, 26782 flow. Second operand 3 states and 90 transitions. [2022-12-06 08:03:53,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 794 transitions, 28392 flow [2022-12-06 08:03:55,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 794 transitions, 28041 flow, removed 90 selfloop flow, removed 7 redundant places. [2022-12-06 08:03:55,972 INFO L231 Difference]: Finished difference. Result has 387 places, 788 transitions, 26311 flow [2022-12-06 08:03:55,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=26378, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26311, PETRI_PLACES=387, PETRI_TRANSITIONS=788} [2022-12-06 08:03:55,976 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 366 predicate places. [2022-12-06 08:03:55,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:55,976 INFO L89 Accepts]: Start accepts. Operand has 387 places, 788 transitions, 26311 flow [2022-12-06 08:03:55,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:55,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:55,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 387 places, 788 transitions, 26311 flow [2022-12-06 08:03:55,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 788 transitions, 26311 flow [2022-12-06 08:03:56,530 INFO L130 PetriNetUnfolder]: 788/2209 cut-off events. [2022-12-06 08:03:56,530 INFO L131 PetriNetUnfolder]: For 222918/223040 co-relation queries the response was YES. [2022-12-06 08:03:56,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35458 conditions, 2209 events. 788/2209 cut-off events. For 222918/223040 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 19961 event pairs, 93 based on Foata normal form. 13/2187 useless extension candidates. Maximal degree in co-relation 35104. Up to 750 conditions per place. [2022-12-06 08:03:56,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 788 transitions, 26311 flow [2022-12-06 08:03:56,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 1916 [2022-12-06 08:03:56,575 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:03:56,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 600 [2022-12-06 08:03:56,576 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 788 transitions, 26311 flow [2022-12-06 08:03:56,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:03:56,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:03:56,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:03:56,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-06 08:03:56,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-06 08:03:56,781 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:03:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:03:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1586482817, now seen corresponding path program 1 times [2022-12-06 08:03:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:03:56,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798265508] [2022-12-06 08:03:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:03:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:03:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:06:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:06:29,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:06:29,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798265508] [2022-12-06 08:06:29,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798265508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:06:29,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109513385] [2022-12-06 08:06:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:06:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:06:29,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:06:29,053 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:06:29,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-06 08:06:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:06:29,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 08:06:29,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:06:29,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:06:29,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:06:29,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2022-12-06 08:06:29,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:06:29,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 08:06:29,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:06:29,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 161 treesize of output 272 [2022-12-06 08:06:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:06:30,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:06:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:06:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109513385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:06:30,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:06:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 08:06:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026928923] [2022-12-06 08:06:30,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:06:30,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 08:06:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:06:30,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 08:06:30,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=94, Unknown=1, NotChecked=0, Total=132 [2022-12-06 08:06:30,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 83 [2022-12-06 08:06:30,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 788 transitions, 26311 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:06:30,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:06:30,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 83 [2022-12-06 08:06:30,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:06:35,607 INFO L130 PetriNetUnfolder]: 2773/5253 cut-off events. [2022-12-06 08:06:35,608 INFO L131 PetriNetUnfolder]: For 513416/513416 co-relation queries the response was YES. [2022-12-06 08:06:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82315 conditions, 5253 events. 2773/5253 cut-off events. For 513416/513416 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 40169 event pairs, 1162 based on Foata normal form. 2/5255 useless extension candidates. Maximal degree in co-relation 81722. Up to 5129 conditions per place. [2022-12-06 08:06:35,680 INFO L137 encePairwiseOnDemand]: 32/83 looper letters, 723 selfloop transitions, 89 changer transitions 1/813 dead transitions. [2022-12-06 08:06:35,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 813 transitions, 28634 flow [2022-12-06 08:06:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 08:06:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 08:06:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-06 08:06:35,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22289156626506024 [2022-12-06 08:06:35,681 INFO L175 Difference]: Start difference. First operand has 385 places, 788 transitions, 26311 flow. Second operand 6 states and 111 transitions. [2022-12-06 08:06:35,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 813 transitions, 28634 flow [2022-12-06 08:06:37,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 813 transitions, 28634 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 08:06:37,930 INFO L231 Difference]: Finished difference. Result has 392 places, 796 transitions, 27022 flow [2022-12-06 08:06:37,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=26311, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=27022, PETRI_PLACES=392, PETRI_TRANSITIONS=796} [2022-12-06 08:06:37,931 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 371 predicate places. [2022-12-06 08:06:37,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:06:37,931 INFO L89 Accepts]: Start accepts. Operand has 392 places, 796 transitions, 27022 flow [2022-12-06 08:06:37,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:06:37,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:06:37,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 392 places, 796 transitions, 27022 flow [2022-12-06 08:06:37,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 796 transitions, 27022 flow [2022-12-06 08:06:38,559 INFO L130 PetriNetUnfolder]: 796/2233 cut-off events. [2022-12-06 08:06:38,559 INFO L131 PetriNetUnfolder]: For 232400/232513 co-relation queries the response was YES. [2022-12-06 08:06:38,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36306 conditions, 2233 events. 796/2233 cut-off events. For 232400/232513 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 20228 event pairs, 95 based on Foata normal form. 13/2213 useless extension candidates. Maximal degree in co-relation 35948. Up to 765 conditions per place. [2022-12-06 08:06:38,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 392 places, 796 transitions, 27022 flow [2022-12-06 08:06:38,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 1940 [2022-12-06 08:06:38,603 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:06:38,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 673 [2022-12-06 08:06:38,604 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 796 transitions, 27022 flow [2022-12-06 08:06:38,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:06:38,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:06:38,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:06:38,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-06 08:06:38,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-06 08:06:38,804 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 08:06:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:06:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash -802298614, now seen corresponding path program 1 times [2022-12-06 08:06:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:06:38,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633955862] [2022-12-06 08:06:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:06:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:06:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:07:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:07:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:07:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633955862] [2022-12-06 08:07:01,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633955862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:07:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605508731] [2022-12-06 08:07:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:07:01,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:07:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:07:01,480 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:07:01,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-06 08:07:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:07:01,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 08:07:01,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:07:01,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 08:07:01,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 266 [2022-12-06 08:07:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:07:02,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:07:07,233 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-06 08:07:07,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 30 new quantified variables, introduced 120 case distinctions, treesize of input 131 treesize of output 1152 Received shutdown request... [2022-12-06 08:07:27,470 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 08:07:27,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 08:07:27,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-06 08:07:27,506 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 08:07:27,506 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-06 08:07:27,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:07:27,672 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 12ms.. [2022-12-06 08:07:27,673 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 08:07:27,673 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 08:07:27,674 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:07:27,676 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 08:07:27,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 08:07:27,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:07:27 BasicIcfg [2022-12-06 08:07:27,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 08:07:27,677 INFO L158 Benchmark]: Toolchain (without parser) took 826998.74ms. Allocated memory was 202.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 178.6MB in the beginning and 994.8MB in the end (delta: -816.2MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 08:07:27,677 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 08:07:27,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.68ms. Allocated memory is still 202.4MB. Free memory was 178.6MB in the beginning and 167.3MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 08:07:27,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.15ms. Allocated memory is still 202.4MB. Free memory was 167.3MB in the beginning and 165.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 08:07:27,677 INFO L158 Benchmark]: Boogie Preprocessor took 32.36ms. Allocated memory is still 202.4MB. Free memory was 165.2MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 08:07:27,678 INFO L158 Benchmark]: RCFGBuilder took 423.92ms. Allocated memory is still 202.4MB. Free memory was 163.7MB in the beginning and 147.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 08:07:27,678 INFO L158 Benchmark]: TraceAbstraction took 826301.45ms. Allocated memory was 202.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 146.9MB in the beginning and 994.8MB in the end (delta: -847.9MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 08:07:27,678 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.10ms. Allocated memory is still 202.4MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.68ms. Allocated memory is still 202.4MB. Free memory was 178.6MB in the beginning and 167.3MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.15ms. Allocated memory is still 202.4MB. Free memory was 167.3MB in the beginning and 165.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.36ms. Allocated memory is still 202.4MB. Free memory was 165.2MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 423.92ms. Allocated memory is still 202.4MB. Free memory was 163.7MB in the beginning and 147.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 826301.45ms. Allocated memory was 202.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 146.9MB in the beginning and 994.8MB in the end (delta: -847.9MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 137 PlacesBefore, 21 PlacesAfterwards, 144 TransitionsBefore, 17 TransitionsAfterwards, 1942 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 47 ConcurrentYvCompositions, 11 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 1248, 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: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 0, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2121, Positive conditional cache size: 0, Positive unconditional cache size: 2121, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ 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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 36 PlacesBefore, 34 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 34, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 46 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 53, Positive conditional cache size: 31, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 48 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 57, Positive conditional cache size: 35, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 49 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 59, Positive conditional cache size: 37, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 51 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 39, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 39, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 58 PlacesBefore, 58 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 67 PlacesBefore, 67 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 66, Positive conditional cache size: 43, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 78 PlacesBefore, 78 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 71, Positive conditional cache size: 48, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 71, Positive conditional cache size: 48, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 88 PlacesBefore, 88 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 72, Positive conditional cache size: 49, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 94 PlacesBefore, 95 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 77, Positive conditional cache size: 53, Positive unconditional cache size: 24, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 110 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 129 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 91, Positive conditional cache size: 66, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 108 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 94, Positive conditional cache size: 69, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 94, Positive conditional cache size: 69, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 108 PlacesBefore, 109 PlacesAfterwards, 131 TransitionsBefore, 132 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 102, Positive conditional cache size: 77, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 102, Positive conditional cache size: 77, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 119 PlacesBefore, 120 PlacesAfterwards, 139 TransitionsBefore, 140 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 105, Positive conditional cache size: 80, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 123 PlacesBefore, 122 PlacesAfterwards, 151 TransitionsBefore, 150 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 106, Positive conditional cache size: 81, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 135 PlacesBefore, 135 PlacesAfterwards, 161 TransitionsBefore, 161 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 212, Positive conditional cache size: 183, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 140 PlacesBefore, 141 PlacesAfterwards, 166 TransitionsBefore, 167 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 215, Positive conditional cache size: 186, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 153 PlacesBefore, 151 PlacesAfterwards, 181 TransitionsBefore, 179 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 179 TransitionsBefore, 179 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 156 PlacesBefore, 156 PlacesAfterwards, 193 TransitionsBefore, 193 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 177 PlacesBefore, 177 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 251, Positive conditional cache size: 221, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 180 PlacesBefore, 180 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 252, Positive conditional cache size: 222, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 183 PlacesBefore, 183 PlacesAfterwards, 229 TransitionsBefore, 229 TransitionsAfterwards, 734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 252, Positive conditional cache size: 222, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 186 PlacesBefore, 186 PlacesAfterwards, 255 TransitionsBefore, 255 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 252, Positive conditional cache size: 222, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 209 PlacesBefore, 209 PlacesAfterwards, 272 TransitionsBefore, 272 TransitionsAfterwards, 778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 253, Positive conditional cache size: 223, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 206 PlacesBefore, 206 PlacesAfterwards, 282 TransitionsBefore, 283 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 259, Positive conditional cache size: 229, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 209 PlacesBefore, 209 PlacesAfterwards, 283 TransitionsBefore, 283 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 259, Positive conditional cache size: 229, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 223 PlacesBefore, 222 PlacesAfterwards, 295 TransitionsBefore, 294 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 261, Positive conditional cache size: 231, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 198 PlacesBefore, 198 PlacesAfterwards, 223 TransitionsBefore, 223 TransitionsAfterwards, 638 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 261, Positive conditional cache size: 231, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 191 PlacesBefore, 192 PlacesAfterwards, 231 TransitionsBefore, 236 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 65, independent conditional: 65, 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: 65, independent: 65, independent conditional: 65, 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: 65, independent: 65, independent conditional: 65, 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: 65, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 270, Positive conditional cache size: 238, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 192 PlacesBefore, 190 PlacesAfterwards, 213 TransitionsBefore, 211 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 274, Positive conditional cache size: 242, Positive unconditional cache size: 32, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 213 PlacesBefore, 211 PlacesAfterwards, 239 TransitionsBefore, 237 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 17, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 321, Positive conditional cache size: 288, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 201 PlacesBefore, 201 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 322, Positive conditional cache size: 289, Positive unconditional cache size: 33, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 212 PlacesBefore, 210 PlacesAfterwards, 269 TransitionsBefore, 267 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 330, Positive conditional cache size: 295, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 213 PlacesBefore, 213 PlacesAfterwards, 274 TransitionsBefore, 274 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 331, Positive conditional cache size: 296, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 223 PlacesBefore, 223 PlacesAfterwards, 288 TransitionsBefore, 288 TransitionsAfterwards, 806 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 331, Positive conditional cache size: 296, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 246 PlacesBefore, 246 PlacesAfterwards, 327 TransitionsBefore, 327 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 333, Positive conditional cache size: 298, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 247 PlacesBefore, 247 PlacesAfterwards, 335 TransitionsBefore, 335 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 333, Positive conditional cache size: 298, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 252 PlacesBefore, 252 PlacesAfterwards, 337 TransitionsBefore, 337 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 333, Positive conditional cache size: 298, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 263 PlacesBefore, 264 PlacesAfterwards, 371 TransitionsBefore, 371 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 336, Positive conditional cache size: 301, Positive unconditional cache size: 35, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 282 PlacesBefore, 282 PlacesAfterwards, 446 TransitionsBefore, 446 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 382, Positive conditional cache size: 346, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 282 PlacesBefore, 282 PlacesAfterwards, 345 TransitionsBefore, 345 TransitionsAfterwards, 898 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 385, Positive conditional cache size: 349, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 280 PlacesBefore, 280 PlacesAfterwards, 410 TransitionsBefore, 410 TransitionsAfterwards, 1162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 387, Positive conditional cache size: 351, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 276 PlacesBefore, 276 PlacesAfterwards, 411 TransitionsBefore, 411 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 387, Positive conditional cache size: 351, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 278 PlacesBefore, 278 PlacesAfterwards, 418 TransitionsBefore, 418 TransitionsAfterwards, 1180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 387, Positive conditional cache size: 351, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 284 PlacesBefore, 284 PlacesAfterwards, 423 TransitionsBefore, 423 TransitionsAfterwards, 1186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 387, Positive conditional cache size: 351, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 286 PlacesBefore, 286 PlacesAfterwards, 424 TransitionsBefore, 424 TransitionsAfterwards, 1190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 387, Positive conditional cache size: 351, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 308 PlacesBefore, 308 PlacesAfterwards, 455 TransitionsBefore, 455 TransitionsAfterwards, 1260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 388, Positive conditional cache size: 352, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 303 PlacesBefore, 304 PlacesAfterwards, 452 TransitionsBefore, 453 TransitionsAfterwards, 1254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 388, Positive conditional cache size: 352, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 301 PlacesBefore, 302 PlacesAfterwards, 440 TransitionsBefore, 440 TransitionsAfterwards, 1234 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 390, Positive conditional cache size: 354, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 307 PlacesBefore, 307 PlacesAfterwards, 445 TransitionsBefore, 445 TransitionsAfterwards, 1264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 393, Positive cache size: 391, Positive conditional cache size: 355, Positive unconditional cache size: 36, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 320 PlacesBefore, 320 PlacesAfterwards, 465 TransitionsBefore, 465 TransitionsAfterwards, 1324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 394, Positive conditional cache size: 357, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 346 PlacesBefore, 344 PlacesAfterwards, 556 TransitionsBefore, 554 TransitionsAfterwards, 1506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 401, Positive conditional cache size: 364, Positive unconditional cache size: 37, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 363 PlacesBefore, 360 PlacesAfterwards, 695 TransitionsBefore, 691 TransitionsAfterwards, 1744 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 28, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 461, Positive cache size: 459, Positive conditional cache size: 421, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 363 PlacesBefore, 363 PlacesAfterwards, 748 TransitionsBefore, 748 TransitionsAfterwards, 1828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 460, Positive conditional cache size: 422, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 371 PlacesBefore, 371 PlacesAfterwards, 756 TransitionsBefore, 756 TransitionsAfterwards, 1844 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 460, Positive conditional cache size: 422, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 369 PlacesBefore, 369 PlacesAfterwards, 756 TransitionsBefore, 756 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 460, Positive conditional cache size: 422, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 377 PlacesBefore, 377 PlacesAfterwards, 781 TransitionsBefore, 781 TransitionsAfterwards, 1892 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 460, Positive conditional cache size: 422, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 386 PlacesBefore, 386 PlacesAfterwards, 785 TransitionsBefore, 785 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 462, Positive conditional cache size: 424, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 392 PlacesBefore, 392 PlacesAfterwards, 790 TransitionsBefore, 790 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 462, Positive conditional cache size: 424, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 385 PlacesBefore, 385 PlacesAfterwards, 788 TransitionsBefore, 788 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 462, Positive conditional cache size: 424, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 392 PlacesBefore, 392 PlacesAfterwards, 796 TransitionsBefore, 796 TransitionsAfterwards, 1940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 462, Positive conditional cache size: 424, Positive unconditional cache size: 38, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 12ms.. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 12ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 12ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 189 locations, 3 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: 826.2s, OverallIterations: 81, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 403.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 61 mSolverCounterUnknown, 2617 SdHoareTripleChecker+Valid, 67.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2617 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 63.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 64 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26818 IncrementalHoareTripleChecker+Invalid, 29215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2272 mSolverCounterUnsat, 5 mSDtfsCounter, 26818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1568 GetRequests, 909 SyntacticMatches, 17 SemanticMatches, 642 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 265.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27022occurred in iteration=80, InterpolantAutomatonStates: 625, 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.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 274.0s InterpolantComputationTime, 1589 NumberOfCodeBlocks, 1589 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 1917 ConstructedInterpolants, 31 QuantifiedInterpolants, 51115 SizeOfPredicates, 361 NumberOfNonLiveVariables, 7518 ConjunctsInSsa, 1016 ConjunctsInUnsatCore, 155 InterpolantComputations, 45 PerfectInterpolantSequences, 60/200 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