/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:44:32,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:44:32,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:44:32,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:44:32,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:44:32,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:44:32,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:44:32,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:44:32,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:44:32,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:44:32,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:44:32,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:44:32,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:44:32,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:44:32,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:44:32,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:44:32,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:44:32,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:44:32,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:44:32,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:44:32,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:44:32,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:44:32,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:44:32,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:44:32,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:44:32,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:44:32,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:44:32,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:44:32,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:44:32,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:44:32,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:44:32,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:44:32,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:44:32,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:44:32,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:44:32,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:44:32,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:44:32,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:44:32,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:44:32,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:44:32,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:44:32,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:44:32,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:44:32,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:44:32,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:44:32,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:44:32,317 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:44:32,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:44:32,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:44:32,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:44:32,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:44:32,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:44:32,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:44:32,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:44:32,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:44:32,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:44:32,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:44:32,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:44:32,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:44:32,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:44:32,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:44:32,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:44:32,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:44:32,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:32,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:44:32,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:44:32,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:44:32,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:44:32,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:44:32,321 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:44:32,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:44:32,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:44:32,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:44:32,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:44:32,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:44:32,661 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:44:32,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-06 05:44:33,866 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:44:34,077 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:44:34,077 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2022-12-06 05:44:34,083 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243076fd5/22988b08e1ac4a8faf8c4e3f31e1760e/FLAG61c19f4c6 [2022-12-06 05:44:34,096 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243076fd5/22988b08e1ac4a8faf8c4e3f31e1760e [2022-12-06 05:44:34,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:44:34,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:44:34,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:34,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:44:34,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:44:34,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5111fd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34, skipping insertion in model container [2022-12-06 05:44:34,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:44:34,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:44:34,289 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-4.wvr.c[2572,2585] [2022-12-06 05:44:34,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:34,307 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:44:34,328 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-4.wvr.c[2572,2585] [2022-12-06 05:44:34,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:44:34,348 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:44:34,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34 WrapperNode [2022-12-06 05:44:34,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:44:34,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:34,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:44:34,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:44:34,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,411 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 154 [2022-12-06 05:44:34,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:44:34,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:44:34,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:44:34,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:44:34,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,446 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:44:34,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:44:34,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:44:34,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:44:34,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (1/1) ... [2022-12-06 05:44:34,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:44:34,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:34,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:44:34,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:44:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:44:34,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:44:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:44:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:44:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:44:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:44:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:44:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:44:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:44:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:44:34,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:44:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:44:34,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:44:34,542 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:44:34,657 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:44:34,659 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:44:34,965 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:44:34,974 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:44:34,974 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:44:34,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:34 BoogieIcfgContainer [2022-12-06 05:44:34,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:44:34,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:44:34,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:44:34,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:44:34,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:44:34" (1/3) ... [2022-12-06 05:44:34,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea05b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:34, skipping insertion in model container [2022-12-06 05:44:34,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:44:34" (2/3) ... [2022-12-06 05:44:34,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea05b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:44:34, skipping insertion in model container [2022-12-06 05:44:34,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:44:34" (3/3) ... [2022-12-06 05:44:34,984 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2022-12-06 05:44:35,019 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:44:35,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:44:35,020 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:44:35,144 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:44:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 180 transitions, 376 flow [2022-12-06 05:44:35,308 INFO L130 PetriNetUnfolder]: 16/178 cut-off events. [2022-12-06 05:44:35,309 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:35,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 16/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 05:44:35,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 180 transitions, 376 flow [2022-12-06 05:44:35,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 170 transitions, 352 flow [2022-12-06 05:44:35,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:35,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-06 05:44:35,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 170 transitions, 352 flow [2022-12-06 05:44:35,416 INFO L130 PetriNetUnfolder]: 16/170 cut-off events. [2022-12-06 05:44:35,416 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:35,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 16/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 05:44:35,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 170 transitions, 352 flow [2022-12-06 05:44:35,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 3242 [2022-12-06 05:44:41,153 INFO L203 LiptonReduction]: Total number of compositions: 153 [2022-12-06 05:44:41,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:44:41,173 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;@75b8d2a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:44:41,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:44:41,177 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:44:41,177 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:41,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:41,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:41,179 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 05:44:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash -862149159, now seen corresponding path program 1 times [2022-12-06 05:44:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:41,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265625315] [2022-12-06 05:44:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:41,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265625315] [2022-12-06 05:44:41,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265625315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:41,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:41,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:44:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898823040] [2022-12-06 05:44:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:41,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:41,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:41,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:41,521 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:44:41,522 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 05:44:41,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:41,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:44:41,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:41,592 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 05:44:41,593 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:44:41,593 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 187 event pairs, 18 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 05:44:41,595 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 05:44:41,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 05:44:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 05:44:41,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 05:44:41,608 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 05:44:41,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 05:44:41,611 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 05:44:41,612 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:41,614 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 05:44:41,618 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:44:41,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:41,619 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:41,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:41,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:41,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:41,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:41,636 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:44:41,637 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:44:41,637 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 05:44:41,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:44:41,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:44:42,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:42,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 737 [2022-12-06 05:44:42,356 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 05:44:42,356 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 05:44:42,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:42,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:42,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:44:42,356 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 05:44:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:42,357 INFO L85 PathProgramCache]: Analyzing trace with hash -552535443, now seen corresponding path program 1 times [2022-12-06 05:44:42,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:42,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085060938] [2022-12-06 05:44:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:42,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:42,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:42,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085060938] [2022-12-06 05:44:42,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085060938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:42,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:42,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:44:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891967627] [2022-12-06 05:44:42,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:42,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:42,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:42,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:42,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:44:42,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 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 05:44:42,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:42,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:44:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:42,639 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 05:44:42,639 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:44:42,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 324 event pairs, 9 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 05:44:42,646 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 05:44:42,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 05:44:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:44:42,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 05:44:42,648 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:44:42,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 05:44:42,648 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 05:44:42,649 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:42,649 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 05:44:42,650 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:44:42,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:42,650 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:42,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:42,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:42,652 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:42,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:42,656 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 05:44:42,656 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:44:42,657 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 05:44:42,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:42,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 05:44:42,658 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:42,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 05:44:42,660 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 05:44:42,661 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 05:44:42,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:42,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:42,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:44:42,661 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 05:44:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash 949209500, now seen corresponding path program 1 times [2022-12-06 05:44:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:42,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272813467] [2022-12-06 05:44:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:42,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272813467] [2022-12-06 05:44:42,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272813467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:42,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:42,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:44:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464496618] [2022-12-06 05:44:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:42,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:44:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:42,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:44:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:44:42,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:44:42,846 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 05:44:42,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:42,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:44:42,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:42,968 INFO L130 PetriNetUnfolder]: 85/169 cut-off events. [2022-12-06 05:44:42,968 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 05:44:42,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 169 events. 85/169 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 553 event pairs, 26 based on Foata normal form. 12/180 useless extension candidates. Maximal degree in co-relation 140. Up to 86 conditions per place. [2022-12-06 05:44:42,969 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 8/42 dead transitions. [2022-12-06 05:44:42,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 202 flow [2022-12-06 05:44:42,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 05:44:42,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 05:44:42,971 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 41 transitions. [2022-12-06 05:44:42,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 202 flow [2022-12-06 05:44:42,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:42,972 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:42,973 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 05:44:42,973 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:44:42,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:42,973 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:42,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:42,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:42,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 05:44:42,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 05:44:42,980 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-06 05:44:42,980 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-06 05:44:42,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 38 events. 7/38 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-12-06 05:44:42,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 05:44:42,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:44:43,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:43,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 05:44:43,167 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 05:44:43,167 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 05:44:43,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:43,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:43,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:44:43,168 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 05:44:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1910570962, now seen corresponding path program 1 times [2022-12-06 05:44:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:43,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695231137] [2022-12-06 05:44:43,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:43,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695231137] [2022-12-06 05:44:43,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695231137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:43,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:43,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424108605] [2022-12-06 05:44:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:43,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:43,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:43,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:43,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:43,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 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 05:44:43,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:43,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:43,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:43,371 INFO L130 PetriNetUnfolder]: 64/123 cut-off events. [2022-12-06 05:44:43,371 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-06 05:44:43,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 123 events. 64/123 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 351 event pairs, 11 based on Foata normal form. 10/132 useless extension candidates. Maximal degree in co-relation 331. Up to 72 conditions per place. [2022-12-06 05:44:43,382 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-06 05:44:43,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 195 flow [2022-12-06 05:44:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 05:44:43,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 05:44:43,384 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 4 states and 36 transitions. [2022-12-06 05:44:43,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 195 flow [2022-12-06 05:44:43,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 174 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:43,389 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 92 flow [2022-12-06 05:44:43,389 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=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 05:44:43,390 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:44:43,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:43,391 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 92 flow [2022-12-06 05:44:43,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:43,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:43,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 92 flow [2022-12-06 05:44:43,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 92 flow [2022-12-06 05:44:43,397 INFO L130 PetriNetUnfolder]: 7/28 cut-off events. [2022-12-06 05:44:43,397 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:44:43,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 28 events. 7/28 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 42. Up to 11 conditions per place. [2022-12-06 05:44:43,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 92 flow [2022-12-06 05:44:43,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 05:44:43,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:43,410 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:44:43,410 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 73 flow [2022-12-06 05:44:43,410 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 05:44:43,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:43,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:43,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:44:43,411 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 05:44:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1277300122, now seen corresponding path program 2 times [2022-12-06 05:44:43,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:43,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380978857] [2022-12-06 05:44:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:43,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:43,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380978857] [2022-12-06 05:44:43,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380978857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:43,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:43,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836008116] [2022-12-06 05:44:43,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:43,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:43,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:43,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:44:43,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 73 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 05:44:43,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:43,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:44:43,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:43,574 INFO L130 PetriNetUnfolder]: 53/107 cut-off events. [2022-12-06 05:44:43,574 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2022-12-06 05:44:43,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 107 events. 53/107 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 266 event pairs, 14 based on Foata normal form. 4/110 useless extension candidates. Maximal degree in co-relation 120. Up to 64 conditions per place. [2022-12-06 05:44:43,575 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 27 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2022-12-06 05:44:43,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 181 flow [2022-12-06 05:44:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 05:44:43,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 05:44:43,577 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 73 flow. Second operand 4 states and 33 transitions. [2022-12-06 05:44:43,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 181 flow [2022-12-06 05:44:43,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 164 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:44:43,578 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 80 flow [2022-12-06 05:44:43,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 05:44:43,579 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 05:44:43,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:43,579 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 80 flow [2022-12-06 05:44:43,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:43,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:43,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 80 flow [2022-12-06 05:44:43,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 80 flow [2022-12-06 05:44:43,584 INFO L130 PetriNetUnfolder]: 5/28 cut-off events. [2022-12-06 05:44:43,584 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:44:43,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 28 events. 5/28 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 42. Up to 8 conditions per place. [2022-12-06 05:44:43,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 80 flow [2022-12-06 05:44:43,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:44:43,585 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:43,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 05:44:43,586 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 80 flow [2022-12-06 05:44:43,586 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 05:44:43,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:43,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:44:43,587 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 05:44:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2031968726, now seen corresponding path program 3 times [2022-12-06 05:44:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:43,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915241444] [2022-12-06 05:44:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:43,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915241444] [2022-12-06 05:44:43,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915241444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:43,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:43,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:44:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494262445] [2022-12-06 05:44:43,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:43,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:44:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:44:43,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:44:43,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:44:43,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 80 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 05:44:43,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:43,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:44:43,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:43,704 INFO L130 PetriNetUnfolder]: 39/79 cut-off events. [2022-12-06 05:44:43,704 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 05:44:43,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 79 events. 39/79 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 14 based on Foata normal form. 6/84 useless extension candidates. Maximal degree in co-relation 118. Up to 64 conditions per place. [2022-12-06 05:44:43,705 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 2/26 dead transitions. [2022-12-06 05:44:43,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 156 flow [2022-12-06 05:44:43,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:44:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:44:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 05:44:43,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-06 05:44:43,706 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 80 flow. Second operand 4 states and 27 transitions. [2022-12-06 05:44:43,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 156 flow [2022-12-06 05:44:43,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 140 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:44:43,708 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 66 flow [2022-12-06 05:44:43,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-06 05:44:43,708 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 05:44:43,709 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:43,709 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 66 flow [2022-12-06 05:44:43,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:43,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:43,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 66 flow [2022-12-06 05:44:43,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 66 flow [2022-12-06 05:44:43,713 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-06 05:44:43,713 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:44:43,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 19 events. 4/19 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 6 conditions per place. [2022-12-06 05:44:43,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 66 flow [2022-12-06 05:44:43,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 05:44:43,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L59-2: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] and [711] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 1) (= (select (select |v_#memory_int_158| v_~f~0.base_90) (+ v_~f~0.offset_90 (* v_~x1~0_71 4))) v_~x1~0_70) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967295) 4294967296) (* (mod v_~n~0_76 1073741824) 4)) (= (ite (and (<= 0 v_~x1~0_71) (< v_~x1~0_71 v_~size~0_100)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|)) InVars {~size~0=v_~size~0_100, ~f~0.base=v_~f~0.base_90, #memory_int=|v_#memory_int_158|, ~n~0=v_~n~0_76, ~x1~0=v_~x1~0_71, ~f~0.offset=v_~f~0.offset_90} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_23|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~size~0=v_~size~0_100, ~f~0.base=v_~f~0.base_90, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, #memory_int=|v_#memory_int_158|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, ~n~0=v_~n~0_76, ~x1~0=v_~x1~0_70, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_33|, ~f~0.offset=v_~f~0.offset_90} 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 05:44:43,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:43,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 05:44:43,774 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2022-12-06 05:44:43,774 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 05:44:43,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:43,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:43,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:44:43,775 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 05:44:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1157667799, now seen corresponding path program 1 times [2022-12-06 05:44:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:43,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507158057] [2022-12-06 05:44:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:43,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507158057] [2022-12-06 05:44:43,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507158057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:44:43,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:44:43,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:44:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654453939] [2022-12-06 05:44:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:44:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:44:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:44:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:44:43,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:44:43,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 05:44:43,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:43,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:44:43,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:43,947 INFO L130 PetriNetUnfolder]: 36/68 cut-off events. [2022-12-06 05:44:43,947 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 05:44:43,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 68 events. 36/68 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 6 based on Foata normal form. 6/73 useless extension candidates. Maximal degree in co-relation 150. Up to 58 conditions per place. [2022-12-06 05:44:43,948 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2022-12-06 05:44:43,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 128 flow [2022-12-06 05:44:43,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:44:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:44:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-06 05:44:43,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 05:44:43,949 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 62 flow. Second operand 3 states and 21 transitions. [2022-12-06 05:44:43,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 128 flow [2022-12-06 05:44:43,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 117 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:43,952 INFO L231 Difference]: Finished difference. Result has 23 places, 18 transitions, 67 flow [2022-12-06 05:44:43,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=20, 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=67, PETRI_PLACES=23, PETRI_TRANSITIONS=18} [2022-12-06 05:44:43,953 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 05:44:43,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:43,953 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 67 flow [2022-12-06 05:44:43,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:43,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:43,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 67 flow [2022-12-06 05:44:43,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 67 flow [2022-12-06 05:44:43,960 INFO L130 PetriNetUnfolder]: 6/23 cut-off events. [2022-12-06 05:44:43,960 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:44:43,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 23 events. 6/23 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 1 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2022-12-06 05:44:43,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 67 flow [2022-12-06 05:44:43,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 05:44:43,963 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:44:43,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:44:43,964 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 18 transitions, 67 flow [2022-12-06 05:44:43,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 05:44:43,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:43,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:43,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:44:43,964 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 05:44:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2039327826, now seen corresponding path program 1 times [2022-12-06 05:44:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:43,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485479621] [2022-12-06 05:44:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:44,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485479621] [2022-12-06 05:44:44,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485479621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:44,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663732447] [2022-12-06 05:44:44,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:44,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:44,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:44,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:44:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:44,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:44:44,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:44,542 INFO L321 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2022-12-06 05:44:44,542 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 103 treesize of output 40 [2022-12-06 05:44:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:44,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:44,827 INFO L321 Elim1Store]: treesize reduction 10, result has 93.6 percent of original size [2022-12-06 05:44:44,827 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 146 treesize of output 196 [2022-12-06 05:44:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:45,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663732447] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:45,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:45,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 05:44:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208002474] [2022-12-06 05:44:45,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:45,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:44:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:45,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:44:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:44:45,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:44:45,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 67 flow. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:45,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:45,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:44:45,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:46,263 INFO L130 PetriNetUnfolder]: 101/184 cut-off events. [2022-12-06 05:44:46,263 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-06 05:44:46,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 184 events. 101/184 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 0 based on Foata normal form. 13/195 useless extension candidates. Maximal degree in co-relation 141. Up to 93 conditions per place. [2022-12-06 05:44:46,264 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 23 selfloop transitions, 11 changer transitions 30/64 dead transitions. [2022-12-06 05:44:46,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 387 flow [2022-12-06 05:44:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:44:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:44:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2022-12-06 05:44:46,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27232142857142855 [2022-12-06 05:44:46,266 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 67 flow. Second operand 14 states and 61 transitions. [2022-12-06 05:44:46,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 387 flow [2022-12-06 05:44:46,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 361 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:46,268 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 160 flow [2022-12-06 05:44:46,268 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=160, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2022-12-06 05:44:46,269 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 05:44:46,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:46,269 INFO L89 Accepts]: Start accepts. Operand has 43 places, 26 transitions, 160 flow [2022-12-06 05:44:46,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:46,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:46,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 26 transitions, 160 flow [2022-12-06 05:44:46,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 160 flow [2022-12-06 05:44:46,276 INFO L130 PetriNetUnfolder]: 10/35 cut-off events. [2022-12-06 05:44:46,276 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 05:44:46,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 35 events. 10/35 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 113. Up to 17 conditions per place. [2022-12-06 05:44:46,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 160 flow [2022-12-06 05:44:46,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 05:44:46,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [714] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_55| 1) (= (select (select |v_#memory_int_162| v_~f~0.base_94) (+ v_~f~0.offset_94 (* v_~x1~0_79 4))) v_~x1~0_78) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= (ite (and (< v_~x1~0_79 v_~size~0_104) (<= 0 v_~x1~0_79)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|) (= |v_thread2Thread1of1ForFork1_~i~1#1_165| 0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_55| 4294967295) 4294967296) (* (mod v_~n~0_82 1073741824) 4))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_94, #memory_int=|v_#memory_int_162|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_79, ~f~0.offset=v_~f~0.offset_94} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_94, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, #memory_int=|v_#memory_int_162|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_165|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~f~0.offset=v_~f~0.offset_94} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:44:48,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [717] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_168| v_~f~0.base_99))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_99 (* v_~x2~0_184 4))))) (let ((.cse1 (select .cse2 (+ (* .cse3 4) v_~f~0.offset_99)))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_99 (* .cse1 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_93) (< v_~x1~0_93 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_46| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|) (= (ite (and (< .cse0 v_~size~0_108) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_46| 0)) (not (= (ite (and (< v_~x2~0_184 v_~size~0_108) (<= 0 v_~x2~0_184)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_172| 4) (not (= (ite (and (< .cse1 v_~size~0_108) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* (mod v_~n~0_86 1073741824) 4)) (= v_~x2~0_183 (select .cse2 (+ v_~f~0.offset_99 (* 4 .cse0)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_108)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139| 0)) (= v_~x1~0_92 (select .cse2 (+ v_~f~0.offset_99 (* v_~x1~0_93 4))))))))) InVars {~x2~0=v_~x2~0_184, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_168|, ~n~0=v_~n~0_86, ~x1~0=v_~x1~0_93, ~f~0.offset=v_~f~0.offset_99} OutVars{~x2~0=v_~x2~0_183, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_33|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_51|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_99, 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_99|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_172|, ~x1~0=v_~x1~0_92, ~f~0.offset=v_~f~0.offset_99, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_42|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_33|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, #memory_int=|v_#memory_int_168|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_46|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_45|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_47|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_46|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:44:48,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_176| v_~f~0.base_103))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_190 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_103 (* .cse1 4))))) (let ((.cse2 (* (mod v_~n~0_90 1073741824) 4)) (.cse4 (select .cse0 (+ v_~f~0.offset_103 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141| 0)) (= (select .cse0 (+ v_~f~0.offset_103 (* v_~x1~0_99 4))) v_~x1~0_98) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_112)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_66| 4294967295) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (not (= (ite (and (< .cse3 v_~size~0_112) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_112)) 1 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= |v_thread2Thread1of1ForFork1_~i~1#1_176| 4) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_176| 4294967296) .cse2)) (= v_~x2~0_189 (select .cse0 (+ v_~f~0.offset_103 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_66| 1) (not (= (ite (and (< v_~x2~0_190 v_~size~0_112) (<= 0 v_~x2~0_190)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_99) (< v_~x1~0_99 v_~size~0_112)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|)))))) InVars {~x2~0=v_~x2~0_190, ~size~0=v_~size~0_112, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_176|, ~n~0=v_~n~0_90, ~x1~0=v_~x1~0_99, ~f~0.offset=v_~f~0.offset_103} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_38|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_35|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_53|, ~f~0.base=v_~f~0.base_103, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, 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_101|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_176|, ~x1~0=v_~x1~0_98, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_47|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, ~x2~0=v_~x2~0_189, ~size~0=v_~size~0_112, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_33|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_66|, #memory_int=|v_#memory_int_176|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_47|, ~n~0=v_~n~0_90, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_48|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, 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_#t~mem9#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:44:49,392 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:44:49,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3124 [2022-12-06 05:44:49,393 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 184 flow [2022-12-06 05:44:49,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:49,393 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:49,393 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:49,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:44:49,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:49,598 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 05:44:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1871161492, now seen corresponding path program 1 times [2022-12-06 05:44:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:49,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870385325] [2022-12-06 05:44:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:44:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870385325] [2022-12-06 05:44:49,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870385325] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:49,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637766610] [2022-12-06 05:44:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:49,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:49,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:49,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:49,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:44:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:49,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:44:49,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:44:49,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:44:49,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637766610] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:49,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:49,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:44:49,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037069915] [2022-12-06 05:44:49,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:49,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:44:49,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:49,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:44:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:44:49,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:44:49,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:49,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:49,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:44:49,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:50,072 INFO L130 PetriNetUnfolder]: 65/115 cut-off events. [2022-12-06 05:44:50,073 INFO L131 PetriNetUnfolder]: For 288/288 co-relation queries the response was YES. [2022-12-06 05:44:50,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 115 events. 65/115 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 264 event pairs, 6 based on Foata normal form. 10/120 useless extension candidates. Maximal degree in co-relation 567. Up to 63 conditions per place. [2022-12-06 05:44:50,074 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 30 selfloop transitions, 8 changer transitions 2/40 dead transitions. [2022-12-06 05:44:50,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 380 flow [2022-12-06 05:44:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:44:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:44:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 05:44:50,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2022-12-06 05:44:50,078 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 184 flow. Second operand 6 states and 39 transitions. [2022-12-06 05:44:50,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 380 flow [2022-12-06 05:44:50,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 296 flow, removed 37 selfloop flow, removed 7 redundant places. [2022-12-06 05:44:50,081 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 146 flow [2022-12-06 05:44:50,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-06 05:44:50,082 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 05:44:50,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:50,082 INFO L89 Accepts]: Start accepts. Operand has 35 places, 24 transitions, 146 flow [2022-12-06 05:44:50,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:50,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:50,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 146 flow [2022-12-06 05:44:50,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 146 flow [2022-12-06 05:44:50,093 INFO L130 PetriNetUnfolder]: 15/44 cut-off events. [2022-12-06 05:44:50,093 INFO L131 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2022-12-06 05:44:50,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 44 events. 15/44 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 139. Up to 24 conditions per place. [2022-12-06 05:44:50,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 146 flow [2022-12-06 05:44:50,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:44:50,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:44:50,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 525 [2022-12-06 05:44:50,607 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 149 flow [2022-12-06 05:44:50,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:50,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:50,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:50,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 05:44:50,808 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 05:44:50,808 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 05:44:50,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash -781138648, now seen corresponding path program 1 times [2022-12-06 05:44:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:50,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521087383] [2022-12-06 05:44:50,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:53,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521087383] [2022-12-06 05:44:53,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521087383] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:53,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472731968] [2022-12-06 05:44:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:53,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:53,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:53,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:44:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:53,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:44:53,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:53,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:44:53,260 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 05:44:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:53,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:53,741 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 05:44:53,741 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 05:44:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:54,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472731968] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:54,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:54,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 2] total 9 [2022-12-06 05:44:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184015480] [2022-12-06 05:44:54,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:54,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:44:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:54,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:44:54,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:44:54,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:44:54,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 149 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:54,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:54,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:44:54,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:55,026 INFO L130 PetriNetUnfolder]: 92/165 cut-off events. [2022-12-06 05:44:55,026 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-12-06 05:44:55,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 165 events. 92/165 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 456 event pairs, 2 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 702. Up to 119 conditions per place. [2022-12-06 05:44:55,027 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 28 selfloop transitions, 18 changer transitions 4/50 dead transitions. [2022-12-06 05:44:55,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 407 flow [2022-12-06 05:44:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:44:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:44:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-06 05:44:55,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3233082706766917 [2022-12-06 05:44:55,029 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 149 flow. Second operand 7 states and 43 transitions. [2022-12-06 05:44:55,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 407 flow [2022-12-06 05:44:55,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 331 flow, removed 29 selfloop flow, removed 5 redundant places. [2022-12-06 05:44:55,031 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 262 flow [2022-12-06 05:44:55,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2022-12-06 05:44:55,032 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-06 05:44:55,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:55,032 INFO L89 Accepts]: Start accepts. Operand has 37 places, 37 transitions, 262 flow [2022-12-06 05:44:55,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:55,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:55,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 37 transitions, 262 flow [2022-12-06 05:44:55,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 262 flow [2022-12-06 05:44:55,042 INFO L130 PetriNetUnfolder]: 21/66 cut-off events. [2022-12-06 05:44:55,042 INFO L131 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2022-12-06 05:44:55,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 66 events. 21/66 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 164 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 159. Up to 34 conditions per place. [2022-12-06 05:44:55,043 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 37 transitions, 262 flow [2022-12-06 05:44:55,043 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 05:44:56,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_166| v_~f~0.base_97))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_97 (* v_~x1~0_88 4))))) (and (not (= (ite (and (< v_~x1~0_88 v_~size~0_106) (<= 0 v_~x1~0_88)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_106) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 4 (mod v_~n~0_84 1073741824))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= |v_thread1Thread1of1ForFork0_~i~0#1_60| 2) (= v_~x1~0_86 (select .cse1 (+ v_~f~0.offset_97 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_170| 0)))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_166|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_32|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_60|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_170|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_86, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|, ~f~0.offset=v_~f~0.offset_97} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:44:57,279 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:44:57,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2248 [2022-12-06 05:44:57,280 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 260 flow [2022-12-06 05:44:57,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:57,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:44:57,281 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:44:57,286 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 05:44:57,481 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 05:44:57,482 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 05:44:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:44:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 97247192, now seen corresponding path program 1 times [2022-12-06 05:44:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:44:57,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405868368] [2022-12-06 05:44:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:44:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:44:57,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405868368] [2022-12-06 05:44:57,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405868368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:44:57,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555347575] [2022-12-06 05:44:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:44:57,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:44:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:44:57,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:44:57,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:44:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:44:57,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:44:57,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:44:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:57,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:44:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:44:57,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555347575] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:44:57,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:44:57,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 05:44:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414002090] [2022-12-06 05:44:57,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:44:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:44:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:44:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:44:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:44:57,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:44:57,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:44:57,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:44:57,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:44:57,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:44:57,956 INFO L130 PetriNetUnfolder]: 90/162 cut-off events. [2022-12-06 05:44:57,956 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-06 05:44:57,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 162 events. 90/162 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 437 event pairs, 27 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 476. Up to 120 conditions per place. [2022-12-06 05:44:57,957 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 35 selfloop transitions, 1 changer transitions 9/45 dead transitions. [2022-12-06 05:44:57,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 377 flow [2022-12-06 05:44:57,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:44:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:44:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-06 05:44:57,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3047619047619048 [2022-12-06 05:44:57,960 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 260 flow. Second operand 5 states and 32 transitions. [2022-12-06 05:44:57,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 377 flow [2022-12-06 05:44:57,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 355 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 05:44:57,963 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 200 flow [2022-12-06 05:44:57,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-06 05:44:57,964 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2022-12-06 05:44:57,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:44:57,964 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 200 flow [2022-12-06 05:44:57,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:44:57,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:44:57,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 200 flow [2022-12-06 05:44:57,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 200 flow [2022-12-06 05:44:57,973 INFO L130 PetriNetUnfolder]: 18/52 cut-off events. [2022-12-06 05:44:57,973 INFO L131 PetriNetUnfolder]: For 60/64 co-relation queries the response was YES. [2022-12-06 05:44:57,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 52 events. 18/52 cut-off events. For 60/64 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 104 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 145. Up to 23 conditions per place. [2022-12-06 05:44:57,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 200 flow [2022-12-06 05:44:57,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 05:44:57,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_178| v_~f~0.base_105))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_105 (* v_~x2~0_195 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_105 (* .cse0 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_105 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_105 (* .cse7 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_105 (* 4 .cse5))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_105 (* .cse4 4))))) (let ((.cse2 (select .cse1 (+ (* .cse6 4) v_~f~0.offset_105)))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_68| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_178| 8) (= (select .cse1 (+ v_~f~0.offset_105 (* .cse2 4))) v_~x2~0_193) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (and (< .cse2 v_~size~0_114) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_195) (< v_~x2~0_195 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_114)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_178|) 4294967296) (* (mod v_~n~0_92 1073741824) 4)) (not (= (ite (and (< .cse6 v_~size~0_114) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|) (= (select .cse1 (+ (* v_~x1~0_103 4) v_~f~0.offset_105)) v_~x1~0_102) (not (= (ite (and (< .cse7 v_~size~0_114) (<= 0 .cse7)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_103) (< v_~x1~0_103 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|)))))))))) InVars {~x2~0=v_~x2~0_195, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, #memory_int=|v_#memory_int_178|, ~n~0=v_~n~0_92, ~x1~0=v_~x1~0_103, ~f~0.offset=v_~f~0.offset_105} OutVars{~x2~0=v_~x2~0_193, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_40|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_37|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_55|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_178|, ~x1~0=v_~x1~0_102, ~f~0.offset=v_~f~0.offset_105, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_37|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_35|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_178|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_92, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_50|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:44:59,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_204| v_~f~0.base_124))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_124 (* v_~x2~0_229 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_124 (* 4 .cse7))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_124 (* .cse0 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_124 (* .cse9 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_124 (* .cse3 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_124 (* .cse6 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_124 (* .cse11 4))))) (let ((.cse4 (select .cse1 (+ (* .cse5 4) v_~f~0.offset_124)))) (let ((.cse8 (select .cse1 (+ (* .cse4 4) v_~f~0.offset_124)))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_124 (* .cse8 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_124 (* .cse10 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_130) (<= 0 .cse0)) 1 0) 0)) (= v_~x2~0_227 (select .cse1 (+ v_~f~0.offset_124 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_98| 1) (not (= (ite (and (< .cse3 v_~size~0_130) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_199| 12) (not (= 0 (ite (and (< .cse4 v_~size~0_130) (<= 0 .cse4)) 1 0))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_130)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_229 v_~size~0_130) (<= 0 v_~x2~0_229)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_130)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_130)) 1 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_130)) 1 0) 0)) (< 8 (* (mod v_~n~0_108 1073741824) 4)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_130)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_124 (* v_~x1~0_148 4))) v_~x1~0_147) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_130)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_130)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (< .cse11 v_~size~0_130) (<= 0 .cse11)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (ite (and (< v_~x1~0_148 v_~size~0_130) (<= 0 v_~x1~0_148)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|)))))))))))))) InVars {~x2~0=v_~x2~0_229, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_124, #memory_int=|v_#memory_int_204|, ~n~0=v_~n~0_108, ~x1~0=v_~x1~0_148, ~f~0.offset=v_~f~0.offset_124} OutVars{~x2~0=v_~x2~0_227, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_55|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_73|, ~size~0=v_~size~0_130, ~f~0.base=v_~f~0.base_124, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_61|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_199|, ~x1~0=v_~x1~0_147, ~f~0.offset=v_~f~0.offset_124, 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_74|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_55|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_53|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_98|, #memory_int=|v_#memory_int_204|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_67|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_67|, ~n~0=v_~n~0_108, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_69|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_78|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:45:00,392 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:00,393 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2429 [2022-12-06 05:45:00,393 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 216 flow [2022-12-06 05:45:00,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:00,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:00,394 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:00,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:00,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:00,598 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 05:45:00,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash -127990386, now seen corresponding path program 1 times [2022-12-06 05:45:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:00,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368313047] [2022-12-06 05:45:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:02,165 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 05:45:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:02,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368313047] [2022-12-06 05:45:02,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368313047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:02,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264181122] [2022-12-06 05:45:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:02,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:02,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:02,168 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:02,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:45:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:02,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:45:02,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:02,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:02,565 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 05:45:02,601 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 05:45:02,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:02,994 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 05:45:02,994 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 05:45:04,040 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 05:45:04,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264181122] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:04,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:04,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:45:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123142657] [2022-12-06 05:45:04,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:04,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:45:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:45:04,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:45:04,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:45:04,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 216 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 05:45:04,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:04,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:45:04,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:04,514 INFO L130 PetriNetUnfolder]: 145/255 cut-off events. [2022-12-06 05:45:04,515 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-12-06 05:45:04,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 255 events. 145/255 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 857 event pairs, 6 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 790. Up to 121 conditions per place. [2022-12-06 05:45:04,517 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 42 selfloop transitions, 23 changer transitions 2/67 dead transitions. [2022-12-06 05:45:04,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 526 flow [2022-12-06 05:45:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:45:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:45:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-12-06 05:45:04,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29292929292929293 [2022-12-06 05:45:04,518 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 216 flow. Second operand 9 states and 58 transitions. [2022-12-06 05:45:04,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 526 flow [2022-12-06 05:45:04,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 503 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 05:45:04,521 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 359 flow [2022-12-06 05:45:04,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2022-12-06 05:45:04,522 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 05:45:04,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:04,522 INFO L89 Accepts]: Start accepts. Operand has 46 places, 43 transitions, 359 flow [2022-12-06 05:45:04,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:04,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:04,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 43 transitions, 359 flow [2022-12-06 05:45:04,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 359 flow [2022-12-06 05:45:04,534 INFO L130 PetriNetUnfolder]: 25/76 cut-off events. [2022-12-06 05:45:04,535 INFO L131 PetriNetUnfolder]: For 133/138 co-relation queries the response was YES. [2022-12-06 05:45:04,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 76 events. 25/76 cut-off events. For 133/138 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 226 event pairs, 1 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 268. Up to 38 conditions per place. [2022-12-06 05:45:04,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 359 flow [2022-12-06 05:45:04,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 05:45:04,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:04,917 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:04,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 396 [2022-12-06 05:45:04,918 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 359 flow [2022-12-06 05:45:04,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 05:45:04,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:04,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:04,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:05,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 05:45:05,128 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 05:45:05,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1600915337, now seen corresponding path program 1 times [2022-12-06 05:45:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:05,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291926729] [2022-12-06 05:45:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:05,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291926729] [2022-12-06 05:45:05,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291926729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:05,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12139238] [2022-12-06 05:45:05,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:05,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:05,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:05,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:05,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:45:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:05,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:45:05,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:05,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:05,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12139238] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:05,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:05,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 05:45:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264759428] [2022-12-06 05:45:05,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:05,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:45:05,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:45:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:45:05,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:45:05,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 359 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 05:45:05,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:05,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:45:05,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:05,645 INFO L130 PetriNetUnfolder]: 171/291 cut-off events. [2022-12-06 05:45:05,645 INFO L131 PetriNetUnfolder]: For 768/768 co-relation queries the response was YES. [2022-12-06 05:45:05,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 291 events. 171/291 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 980 event pairs, 10 based on Foata normal form. 28/314 useless extension candidates. Maximal degree in co-relation 1324. Up to 149 conditions per place. [2022-12-06 05:45:05,647 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 44 selfloop transitions, 28 changer transitions 0/72 dead transitions. [2022-12-06 05:45:05,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 719 flow [2022-12-06 05:45:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:45:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:45:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-12-06 05:45:05,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-06 05:45:05,648 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 359 flow. Second operand 8 states and 52 transitions. [2022-12-06 05:45:05,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 719 flow [2022-12-06 05:45:05,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 628 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:05,652 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 485 flow [2022-12-06 05:45:05,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=485, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2022-12-06 05:45:05,653 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:45:05,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:05,653 INFO L89 Accepts]: Start accepts. Operand has 53 places, 51 transitions, 485 flow [2022-12-06 05:45:05,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:05,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:05,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions, 485 flow [2022-12-06 05:45:05,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 485 flow [2022-12-06 05:45:05,668 INFO L130 PetriNetUnfolder]: 32/90 cut-off events. [2022-12-06 05:45:05,668 INFO L131 PetriNetUnfolder]: For 254/262 co-relation queries the response was YES. [2022-12-06 05:45:05,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 90 events. 32/90 cut-off events. For 254/262 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 279 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 299. Up to 37 conditions per place. [2022-12-06 05:45:05,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 51 transitions, 485 flow [2022-12-06 05:45:05,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 05:45:05,669 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:05,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:45:05,670 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 485 flow [2022-12-06 05:45:05,670 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 05:45:05,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:05,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:05,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:05,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:05,878 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 05:45:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1384627034, now seen corresponding path program 1 times [2022-12-06 05:45:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:05,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296591812] [2022-12-06 05:45:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:05,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:05,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296591812] [2022-12-06 05:45:05,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296591812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:05,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612837597] [2022-12-06 05:45:05,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:05,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:05,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:05,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:05,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:45:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:06,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:45:06,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:06,164 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 05:45:06,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:06,231 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 05:45:06,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612837597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:06,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:06,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:45:06,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924711082] [2022-12-06 05:45:06,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:06,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:45:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:06,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:45:06,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:45:06,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:45:06,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 485 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:06,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:06,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:45:06,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:06,739 INFO L130 PetriNetUnfolder]: 228/393 cut-off events. [2022-12-06 05:45:06,739 INFO L131 PetriNetUnfolder]: For 1625/1625 co-relation queries the response was YES. [2022-12-06 05:45:06,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 393 events. 228/393 cut-off events. For 1625/1625 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1466 event pairs, 11 based on Foata normal form. 14/404 useless extension candidates. Maximal degree in co-relation 1339. Up to 149 conditions per place. [2022-12-06 05:45:06,743 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 61 selfloop transitions, 35 changer transitions 2/98 dead transitions. [2022-12-06 05:45:06,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 982 flow [2022-12-06 05:45:06,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:45:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:45:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-12-06 05:45:06,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465277777777778 [2022-12-06 05:45:06,744 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 485 flow. Second operand 12 states and 71 transitions. [2022-12-06 05:45:06,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 982 flow [2022-12-06 05:45:06,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 98 transitions, 923 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:06,751 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 623 flow [2022-12-06 05:45:06,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=623, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2022-12-06 05:45:06,752 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 44 predicate places. [2022-12-06 05:45:06,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:06,752 INFO L89 Accepts]: Start accepts. Operand has 65 places, 60 transitions, 623 flow [2022-12-06 05:45:06,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:06,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:06,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 60 transitions, 623 flow [2022-12-06 05:45:06,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 623 flow [2022-12-06 05:45:06,772 INFO L130 PetriNetUnfolder]: 41/122 cut-off events. [2022-12-06 05:45:06,772 INFO L131 PetriNetUnfolder]: For 361/372 co-relation queries the response was YES. [2022-12-06 05:45:06,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 122 events. 41/122 cut-off events. For 361/372 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 450 event pairs, 1 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 493. Up to 50 conditions per place. [2022-12-06 05:45:06,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 60 transitions, 623 flow [2022-12-06 05:45:06,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-06 05:45:06,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:45:07,382 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:45:07,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 631 [2022-12-06 05:45:07,383 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 635 flow [2022-12-06 05:45:07,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:07,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:07,383 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:07,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 05:45:07,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:07,584 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 05:45:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1481718263, now seen corresponding path program 1 times [2022-12-06 05:45:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:07,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220359079] [2022-12-06 05:45:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:07,721 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 05:45:07,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:07,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220359079] [2022-12-06 05:45:07,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220359079] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:07,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240429825] [2022-12-06 05:45:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:07,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:07,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:07,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:45:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:07,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:45:07,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:07,917 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 05:45:07,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:07,968 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 05:45:07,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240429825] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:07,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:07,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 05:45:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779040244] [2022-12-06 05:45:07,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:07,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:45:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:45:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:45:07,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:45:07,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 635 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:07,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:07,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:45:07,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:08,299 INFO L130 PetriNetUnfolder]: 263/454 cut-off events. [2022-12-06 05:45:08,299 INFO L131 PetriNetUnfolder]: For 1861/1861 co-relation queries the response was YES. [2022-12-06 05:45:08,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 454 events. 263/454 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1848 event pairs, 34 based on Foata normal form. 20/471 useless extension candidates. Maximal degree in co-relation 2037. Up to 195 conditions per place. [2022-12-06 05:45:08,304 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 59 selfloop transitions, 40 changer transitions 0/99 dead transitions. [2022-12-06 05:45:08,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 1111 flow [2022-12-06 05:45:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:45:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:45:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 68 transitions. [2022-12-06 05:45:08,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22077922077922077 [2022-12-06 05:45:08,305 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 635 flow. Second operand 11 states and 68 transitions. [2022-12-06 05:45:08,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 1111 flow [2022-12-06 05:45:08,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 1013 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:08,313 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 778 flow [2022-12-06 05:45:08,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=778, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2022-12-06 05:45:08,314 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 54 predicate places. [2022-12-06 05:45:08,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:08,314 INFO L89 Accepts]: Start accepts. Operand has 75 places, 68 transitions, 778 flow [2022-12-06 05:45:08,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:08,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:08,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 68 transitions, 778 flow [2022-12-06 05:45:08,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 68 transitions, 778 flow [2022-12-06 05:45:08,335 INFO L130 PetriNetUnfolder]: 50/139 cut-off events. [2022-12-06 05:45:08,335 INFO L131 PetriNetUnfolder]: For 546/560 co-relation queries the response was YES. [2022-12-06 05:45:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 139 events. 50/139 cut-off events. For 546/560 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 555 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 586. Up to 67 conditions per place. [2022-12-06 05:45:08,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 68 transitions, 778 flow [2022-12-06 05:45:08,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 05:45:08,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_178| v_~f~0.base_105))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_105 (* v_~x2~0_195 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_105 (* .cse0 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_105 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_105 (* .cse7 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_105 (* 4 .cse5))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_105 (* .cse4 4))))) (let ((.cse2 (select .cse1 (+ (* .cse6 4) v_~f~0.offset_105)))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_68| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_178| 8) (= (select .cse1 (+ v_~f~0.offset_105 (* .cse2 4))) v_~x2~0_193) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (and (< .cse2 v_~size~0_114) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_195) (< v_~x2~0_195 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_114)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_114)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_114)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_178|) 4294967296) (* (mod v_~n~0_92 1073741824) 4)) (not (= (ite (and (< .cse6 v_~size~0_114) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|) (= (select .cse1 (+ (* v_~x1~0_103 4) v_~f~0.offset_105)) v_~x1~0_102) (not (= (ite (and (< .cse7 v_~size~0_114) (<= 0 .cse7)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_103) (< v_~x1~0_103 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|)))))))))) InVars {~x2~0=v_~x2~0_195, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, #memory_int=|v_#memory_int_178|, ~n~0=v_~n~0_92, ~x1~0=v_~x1~0_103, ~f~0.offset=v_~f~0.offset_105} OutVars{~x2~0=v_~x2~0_193, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_40|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_37|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_55|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_105, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_178|, ~x1~0=v_~x1~0_102, ~f~0.offset=v_~f~0.offset_105, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_143|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_37|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_35|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_68|, #memory_int=|v_#memory_int_178|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_92, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_50|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:45:09,747 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:45:09,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1434 [2022-12-06 05:45:09,748 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 802 flow [2022-12-06 05:45:09,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:09,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:09,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:09,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:09,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:45:09,952 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 05:45:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2145938201, now seen corresponding path program 1 times [2022-12-06 05:45:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610336560] [2022-12-06 05:45:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:10,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610336560] [2022-12-06 05:45:10,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610336560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:10,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:10,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137180119] [2022-12-06 05:45:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:10,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:10,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:10,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:10,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:10,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:45:10,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 802 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 05:45:10,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:10,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:45:10,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:10,218 INFO L130 PetriNetUnfolder]: 256/454 cut-off events. [2022-12-06 05:45:10,218 INFO L131 PetriNetUnfolder]: For 2284/2284 co-relation queries the response was YES. [2022-12-06 05:45:10,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 454 events. 256/454 cut-off events. For 2284/2284 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1852 event pairs, 114 based on Foata normal form. 4/455 useless extension candidates. Maximal degree in co-relation 2234. Up to 410 conditions per place. [2022-12-06 05:45:10,223 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 10 changer transitions 3/79 dead transitions. [2022-12-06 05:45:10,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 1041 flow [2022-12-06 05:45:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 05:45:10,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 05:45:10,225 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 802 flow. Second operand 4 states and 42 transitions. [2022-12-06 05:45:10,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 1041 flow [2022-12-06 05:45:10,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 939 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 05:45:10,239 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 692 flow [2022-12-06 05:45:10,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=692, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2022-12-06 05:45:10,241 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2022-12-06 05:45:10,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:10,241 INFO L89 Accepts]: Start accepts. Operand has 74 places, 66 transitions, 692 flow [2022-12-06 05:45:10,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:10,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:10,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 66 transitions, 692 flow [2022-12-06 05:45:10,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 66 transitions, 692 flow [2022-12-06 05:45:10,261 INFO L130 PetriNetUnfolder]: 47/133 cut-off events. [2022-12-06 05:45:10,261 INFO L131 PetriNetUnfolder]: For 514/529 co-relation queries the response was YES. [2022-12-06 05:45:10,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 133 events. 47/133 cut-off events. For 514/529 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 511 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 553. Up to 64 conditions per place. [2022-12-06 05:45:10,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 66 transitions, 692 flow [2022-12-06 05:45:10,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 05:45:10,263 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:10,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:45:10,264 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 692 flow [2022-12-06 05:45:10,264 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 05:45:10,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:10,265 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:10,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:45:10,265 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 05:45:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1563093600, now seen corresponding path program 1 times [2022-12-06 05:45:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:10,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859547496] [2022-12-06 05:45:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:10,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859547496] [2022-12-06 05:45:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859547496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301395350] [2022-12-06 05:45:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:10,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:10,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:45:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:10,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:45:10,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:10,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:10,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301395350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:10,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:10,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:45:10,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257854726] [2022-12-06 05:45:10,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:10,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:45:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:10,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:45:10,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:45:10,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:45:10,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 692 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 05:45:10,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:10,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:45:10,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:11,010 INFO L130 PetriNetUnfolder]: 300/531 cut-off events. [2022-12-06 05:45:11,011 INFO L131 PetriNetUnfolder]: For 2392/2392 co-relation queries the response was YES. [2022-12-06 05:45:11,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2790 conditions, 531 events. 300/531 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2251 event pairs, 96 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 2460. Up to 347 conditions per place. [2022-12-06 05:45:11,017 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 78 selfloop transitions, 20 changer transitions 8/106 dead transitions. [2022-12-06 05:45:11,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 106 transitions, 1184 flow [2022-12-06 05:45:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:45:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:45:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-12-06 05:45:11,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23412698412698413 [2022-12-06 05:45:11,019 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 692 flow. Second operand 9 states and 59 transitions. [2022-12-06 05:45:11,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 106 transitions, 1184 flow [2022-12-06 05:45:11,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 1148 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:11,031 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 795 flow [2022-12-06 05:45:11,031 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=795, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2022-12-06 05:45:11,032 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 59 predicate places. [2022-12-06 05:45:11,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:11,032 INFO L89 Accepts]: Start accepts. Operand has 80 places, 73 transitions, 795 flow [2022-12-06 05:45:11,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:11,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:11,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 73 transitions, 795 flow [2022-12-06 05:45:11,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 73 transitions, 795 flow [2022-12-06 05:45:11,058 INFO L130 PetriNetUnfolder]: 55/155 cut-off events. [2022-12-06 05:45:11,058 INFO L131 PetriNetUnfolder]: For 847/895 co-relation queries the response was YES. [2022-12-06 05:45:11,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 155 events. 55/155 cut-off events. For 847/895 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 611 event pairs, 4 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 719. Up to 75 conditions per place. [2022-12-06 05:45:11,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 73 transitions, 795 flow [2022-12-06 05:45:11,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 05:45:11,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:11,252 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:11,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 05:45:11,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:11,650 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:11,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 618 [2022-12-06 05:45:11,650 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 879 flow [2022-12-06 05:45:11,650 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 05:45:11,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:11,651 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:11,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:11,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:45:11,855 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 05:45:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -719104254, now seen corresponding path program 1 times [2022-12-06 05:45:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:11,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498459279] [2022-12-06 05:45:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:14,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498459279] [2022-12-06 05:45:14,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498459279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:14,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245617561] [2022-12-06 05:45:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:14,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:14,119 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:14,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:45:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:14,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:45:14,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:14,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:14,347 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 05:45:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:14,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:14,771 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 05:45:14,772 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 05:45:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:15,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245617561] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:15,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:15,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 14 [2022-12-06 05:45:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091844180] [2022-12-06 05:45:15,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:15,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:45:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:15,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:45:15,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:45:15,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 05:45:15,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 879 flow. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:15,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:15,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 05:45:15,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:17,234 INFO L130 PetriNetUnfolder]: 387/691 cut-off events. [2022-12-06 05:45:17,234 INFO L131 PetriNetUnfolder]: For 4697/4697 co-relation queries the response was YES. [2022-12-06 05:45:17,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4108 conditions, 691 events. 387/691 cut-off events. For 4697/4697 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3161 event pairs, 32 based on Foata normal form. 2/690 useless extension candidates. Maximal degree in co-relation 3727. Up to 367 conditions per place. [2022-12-06 05:45:17,243 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 77 selfloop transitions, 49 changer transitions 18/144 dead transitions. [2022-12-06 05:45:17,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 144 transitions, 1799 flow [2022-12-06 05:45:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:45:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:45:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 100 transitions. [2022-12-06 05:45:17,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2304147465437788 [2022-12-06 05:45:17,244 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 879 flow. Second operand 14 states and 100 transitions. [2022-12-06 05:45:17,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 144 transitions, 1799 flow [2022-12-06 05:45:17,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 144 transitions, 1732 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 05:45:17,258 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 1246 flow [2022-12-06 05:45:17,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1246, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2022-12-06 05:45:17,259 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2022-12-06 05:45:17,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:17,259 INFO L89 Accepts]: Start accepts. Operand has 90 places, 95 transitions, 1246 flow [2022-12-06 05:45:17,260 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:17,260 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:17,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 95 transitions, 1246 flow [2022-12-06 05:45:17,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 95 transitions, 1246 flow [2022-12-06 05:45:17,290 INFO L130 PetriNetUnfolder]: 67/212 cut-off events. [2022-12-06 05:45:17,290 INFO L131 PetriNetUnfolder]: For 1597/1667 co-relation queries the response was YES. [2022-12-06 05:45:17,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 212 events. 67/212 cut-off events. For 1597/1667 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1051 event pairs, 2 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 1053. Up to 97 conditions per place. [2022-12-06 05:45:17,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 95 transitions, 1246 flow [2022-12-06 05:45:17,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 05:45:17,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:17,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_166| v_~f~0.base_97))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_97 (* v_~x1~0_88 4))))) (and (not (= (ite (and (< v_~x1~0_88 v_~size~0_106) (<= 0 v_~x1~0_88)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_106) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 4 (mod v_~n~0_84 1073741824))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= |v_thread1Thread1of1ForFork0_~i~0#1_60| 2) (= v_~x1~0_86 (select .cse1 (+ v_~f~0.offset_97 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_170| 0)))) InVars {~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_166|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_32|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~size~0=v_~size~0_106, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_60|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_170|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_86, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|, ~f~0.offset=v_~f~0.offset_97} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:18,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [756] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_238| v_~f~0.base_156))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_156 (* v_~x1~0_237 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_156 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|) (= (select .cse0 (+ v_~f~0.offset_156 (* .cse1 4))) v_~x1~0_235) (= |v_thread2Thread1of1ForFork1_~i~1#1_248| 0) (< 0 (* (mod v_~n~0_142 1073741824) 4)) (not (= (ite (and (< v_~x1~0_237 v_~size~0_162) (<= 0 v_~x1~0_237)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132| (ite (and (< .cse1 v_~size~0_162) (<= 0 .cse1)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_162)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_187| 3))))) InVars {~size~0=v_~size~0_162, ~f~0.base=v_~f~0.base_156, #memory_int=|v_#memory_int_238|, ~n~0=v_~n~0_142, ~x1~0=v_~x1~0_237, ~f~0.offset=v_~f~0.offset_156} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_126|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_132|, ~size~0=v_~size~0_162, ~f~0.base=v_~f~0.base_156, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_187|, #memory_int=|v_#memory_int_238|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_136|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_248|, ~n~0=v_~n~0_142, ~x1~0=v_~x1~0_235, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_136|, ~f~0.offset=v_~f~0.offset_156} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:18,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [758] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_240| v_~f~0.base_158))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_158 (* v_~x1~0_243 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_158 (* .cse3 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_158 (* .cse1 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_140|) (= |v_thread2Thread1of1ForFork1_~i~1#1_250| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_191| 4) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_164)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|) (not (= (ite (and (< v_~x1~0_243 v_~size~0_164) (<= 0 v_~x1~0_243)) 1 0) 0)) (< 0 (* (mod v_~n~0_144 1073741824) 4)) (not (= (ite (and (< .cse1 v_~size~0_164) (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_158 (* .cse0 4))) v_~x1~0_241) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_164)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_140| 0))))))) InVars {~size~0=v_~size~0_164, ~f~0.base=v_~f~0.base_158, #memory_int=|v_#memory_int_240|, ~n~0=v_~n~0_144, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_158} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_130|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, ~size~0=v_~size~0_164, ~f~0.base=v_~f~0.base_158, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_191|, #memory_int=|v_#memory_int_240|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_250|, ~n~0=v_~n~0_144, ~x1~0=v_~x1~0_241, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_140|, ~f~0.offset=v_~f~0.offset_158} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:45:19,311 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:45:19,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2056 [2022-12-06 05:45:19,315 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1314 flow [2022-12-06 05:45:19,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:19,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:19,315 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:19,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:19,520 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,SelfDestructingSolverStorable17 [2022-12-06 05:45:19,520 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 05:45:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1906459602, now seen corresponding path program 1 times [2022-12-06 05:45:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:19,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121274233] [2022-12-06 05:45:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121274233] [2022-12-06 05:45:19,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121274233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:19,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755138582] [2022-12-06 05:45:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:19,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:19,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:19,643 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:19,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 05:45:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:19,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:45:19,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:19,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:19,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755138582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:19,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:19,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:45:19,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341041564] [2022-12-06 05:45:19,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:19,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:45:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:19,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:45:19,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:45:19,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:45:19,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 1314 flow. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:19,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:19,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:45:19,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:22,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:45:22,923 INFO L130 PetriNetUnfolder]: 686/1187 cut-off events. [2022-12-06 05:45:22,923 INFO L131 PetriNetUnfolder]: For 11195/11195 co-relation queries the response was YES. [2022-12-06 05:45:22,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7800 conditions, 1187 events. 686/1187 cut-off events. For 11195/11195 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5929 event pairs, 43 based on Foata normal form. 104/1278 useless extension candidates. Maximal degree in co-relation 7282. Up to 537 conditions per place. [2022-12-06 05:45:22,936 INFO L137 encePairwiseOnDemand]: 15/39 looper letters, 133 selfloop transitions, 91 changer transitions 6/230 dead transitions. [2022-12-06 05:45:22,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 230 transitions, 3420 flow [2022-12-06 05:45:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:45:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:45:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 143 transitions. [2022-12-06 05:45:22,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19298245614035087 [2022-12-06 05:45:22,941 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1314 flow. Second operand 19 states and 143 transitions. [2022-12-06 05:45:22,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 230 transitions, 3420 flow [2022-12-06 05:45:22,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 230 transitions, 3093 flow, removed 147 selfloop flow, removed 5 redundant places. [2022-12-06 05:45:22,969 INFO L231 Difference]: Finished difference. Result has 110 places, 132 transitions, 2043 flow [2022-12-06 05:45:22,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2043, PETRI_PLACES=110, PETRI_TRANSITIONS=132} [2022-12-06 05:45:22,970 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:45:22,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:22,970 INFO L89 Accepts]: Start accepts. Operand has 110 places, 132 transitions, 2043 flow [2022-12-06 05:45:22,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:22,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:22,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 132 transitions, 2043 flow [2022-12-06 05:45:22,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 132 transitions, 2043 flow [2022-12-06 05:45:23,022 INFO L130 PetriNetUnfolder]: 114/314 cut-off events. [2022-12-06 05:45:23,023 INFO L131 PetriNetUnfolder]: For 2975/3111 co-relation queries the response was YES. [2022-12-06 05:45:23,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 314 events. 114/314 cut-off events. For 2975/3111 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1617 event pairs, 2 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 1761. Up to 144 conditions per place. [2022-12-06 05:45:23,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 132 transitions, 2043 flow [2022-12-06 05:45:23,028 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 05:45:23,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:23,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 931 [2022-12-06 05:45:23,901 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 132 transitions, 2047 flow [2022-12-06 05:45:23,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:23,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:23,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:23,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:24,102 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 05:45:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -5261297, now seen corresponding path program 1 times [2022-12-06 05:45:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:24,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704013538] [2022-12-06 05:45:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:25,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 05:45:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:25,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704013538] [2022-12-06 05:45:25,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704013538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:25,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4159742] [2022-12-06 05:45:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:25,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:25,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:25,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:25,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 05:45:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:25,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:45:25,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:25,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:45:25,824 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 05:45:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:25,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:26,232 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 05:45:26,232 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 05:45:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:27,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4159742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:27,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:27,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 05:45:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97409925] [2022-12-06 05:45:27,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:27,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:45:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:45:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:45:27,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:45:27,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 132 transitions, 2047 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:27,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:27,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:45:27,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:27,812 INFO L130 PetriNetUnfolder]: 723/1234 cut-off events. [2022-12-06 05:45:27,813 INFO L131 PetriNetUnfolder]: For 13002/13002 co-relation queries the response was YES. [2022-12-06 05:45:27,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8572 conditions, 1234 events. 723/1234 cut-off events. For 13002/13002 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6181 event pairs, 128 based on Foata normal form. 1/1232 useless extension candidates. Maximal degree in co-relation 7583. Up to 1152 conditions per place. [2022-12-06 05:45:27,828 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 123 selfloop transitions, 27 changer transitions 1/151 dead transitions. [2022-12-06 05:45:27,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 151 transitions, 2522 flow [2022-12-06 05:45:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:45:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:45:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 05:45:27,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24561403508771928 [2022-12-06 05:45:27,829 INFO L175 Difference]: Start difference. First operand has 107 places, 132 transitions, 2047 flow. Second operand 6 states and 56 transitions. [2022-12-06 05:45:27,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 151 transitions, 2522 flow [2022-12-06 05:45:27,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 151 transitions, 2177 flow, removed 155 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:27,880 INFO L231 Difference]: Finished difference. Result has 110 places, 139 transitions, 1896 flow [2022-12-06 05:45:27,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1713, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1896, PETRI_PLACES=110, PETRI_TRANSITIONS=139} [2022-12-06 05:45:27,880 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 05:45:27,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:27,881 INFO L89 Accepts]: Start accepts. Operand has 110 places, 139 transitions, 1896 flow [2022-12-06 05:45:27,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:27,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:27,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 139 transitions, 1896 flow [2022-12-06 05:45:27,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 139 transitions, 1896 flow [2022-12-06 05:45:27,931 INFO L130 PetriNetUnfolder]: 118/330 cut-off events. [2022-12-06 05:45:27,931 INFO L131 PetriNetUnfolder]: For 3051/3188 co-relation queries the response was YES. [2022-12-06 05:45:27,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1994 conditions, 330 events. 118/330 cut-off events. For 3051/3188 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1809 event pairs, 2 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 1748. Up to 152 conditions per place. [2022-12-06 05:45:27,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 139 transitions, 1896 flow [2022-12-06 05:45:27,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-06 05:45:28,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_242| v_~f~0.base_160))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_160 (* v_~x2~0_280 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_160 (* .cse4 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_160 (* v_~x1~0_248 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_160 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_160 (* .cse2 4))))) (and (= v_~x1~0_247 (select .cse0 (+ v_~f~0.offset_160 (* .cse1 4)))) (= |v_thread2Thread1of1ForFork1_~i~1#1_252| 4) (not (= (ite (and (< .cse2 v_~size~0_166) (<= 0 .cse2)) 1 0) 0)) (not (= 0 (ite (and (< v_~x2~0_280 v_~size~0_166) (<= 0 v_~x2~0_280)) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_144| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193| 0)) (not (= (ite (and (< .cse3 v_~size~0_166) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| 3) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_166)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_166)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_144|) (not (= (ite (and (< v_~x1~0_248 v_~size~0_166) (<= 0 v_~x1~0_248)) 1 0) 0)) (< 0 (* (mod v_~n~0_146 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_166)) 1 0)) (= (select .cse0 (+ (* .cse5 4) v_~f~0.offset_160)) v_~x2~0_279)))))) InVars {~x2~0=v_~x2~0_280, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, #memory_int=|v_#memory_int_242|, ~n~0=v_~n~0_146, ~x1~0=v_~x1~0_248, ~f~0.offset=v_~f~0.offset_160} OutVars{~x2~0=v_~x2~0_279, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_134|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_87|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_93|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_252|, ~x1~0=v_~x1~0_247, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_87|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_85|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, #memory_int=|v_#memory_int_242|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_144|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_99|, ~n~0=v_~n~0_146, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_101|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_144|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:45:28,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:28,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1097 [2022-12-06 05:45:28,977 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 139 transitions, 1916 flow [2022-12-06 05:45:28,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:28,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:28,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:28,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:29,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:29,178 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 05:45:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1660388292, now seen corresponding path program 1 times [2022-12-06 05:45:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:29,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012963263] [2022-12-06 05:45:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:29,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 05:45:29,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:29,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012963263] [2022-12-06 05:45:29,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012963263] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:29,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240800706] [2022-12-06 05:45:29,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:29,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:29,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:29,284 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:29,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 05:45:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:29,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 05:45:29,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:29,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:29,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:45:29,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:29,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:29,794 INFO L321 Elim1Store]: treesize reduction 185, result has 17.8 percent of original size [2022-12-06 05:45:29,794 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 244 treesize of output 102 [2022-12-06 05:45:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:29,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:30,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240800706] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:30,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:30,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 05:45:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053124460] [2022-12-06 05:45:30,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:30,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:45:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:30,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:45:30,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=116, Unknown=3, NotChecked=0, Total=156 [2022-12-06 05:45:30,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:45:30,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 139 transitions, 1916 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 05:45:30,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:30,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:45:30,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:49,280 WARN L233 SmtUtils]: Spent 18.61s on a formula simplification. DAG size of input: 160 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:18,022 WARN L233 SmtUtils]: Spent 28.61s on a formula simplification. DAG size of input: 147 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:46:20,145 INFO L130 PetriNetUnfolder]: 757/1292 cut-off events. [2022-12-06 05:46:20,145 INFO L131 PetriNetUnfolder]: For 13295/13295 co-relation queries the response was YES. [2022-12-06 05:46:20,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8364 conditions, 1292 events. 757/1292 cut-off events. For 13295/13295 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6590 event pairs, 80 based on Foata normal form. 8/1297 useless extension candidates. Maximal degree in co-relation 7352. Up to 1094 conditions per place. [2022-12-06 05:46:20,159 INFO L137 encePairwiseOnDemand]: 16/40 looper letters, 126 selfloop transitions, 48 changer transitions 4/178 dead transitions. [2022-12-06 05:46:20,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 178 transitions, 2595 flow [2022-12-06 05:46:20,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:46:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:46:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2022-12-06 05:46:20,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.175 [2022-12-06 05:46:20,160 INFO L175 Difference]: Start difference. First operand has 110 places, 139 transitions, 1916 flow. Second operand 12 states and 84 transitions. [2022-12-06 05:46:20,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 178 transitions, 2595 flow [2022-12-06 05:46:20,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 178 transitions, 2529 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:20,210 INFO L231 Difference]: Finished difference. Result has 122 places, 147 transitions, 2106 flow [2022-12-06 05:46:20,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2106, PETRI_PLACES=122, PETRI_TRANSITIONS=147} [2022-12-06 05:46:20,211 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2022-12-06 05:46:20,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:20,211 INFO L89 Accepts]: Start accepts. Operand has 122 places, 147 transitions, 2106 flow [2022-12-06 05:46:20,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:20,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:20,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 147 transitions, 2106 flow [2022-12-06 05:46:20,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 147 transitions, 2106 flow [2022-12-06 05:46:20,270 INFO L130 PetriNetUnfolder]: 127/346 cut-off events. [2022-12-06 05:46:20,270 INFO L131 PetriNetUnfolder]: For 3917/4063 co-relation queries the response was YES. [2022-12-06 05:46:20,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 346 events. 127/346 cut-off events. For 3917/4063 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1900 event pairs, 2 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 2087. Up to 166 conditions per place. [2022-12-06 05:46:20,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 147 transitions, 2106 flow [2022-12-06 05:46:20,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-06 05:46:22,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_253| v_~f~0.base_170))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_170 (* v_~x2~0_296 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_170 (* 4 .cse3))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_170 (* .cse9 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_170 (* .cse7 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_170 (* .cse6 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_170 (* v_~x1~0_282 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_170 (* .cse2 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_170 (* .cse4 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_170 (* .cse8 4))))) (and (= v_~x1~0_281 (select .cse0 (+ v_~f~0.offset_170 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167| 0)) (not (= (ite (and (< .cse2 v_~size~0_176) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_176)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_269|) 4294967296) (* (mod v_~n~0_156 1073741824) 4)) (not (= (ite (and (<= 0 v_~x1~0_282) (< v_~x1~0_282 v_~size~0_176)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_176)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_269| 8) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162| (ite (and (< .cse5 v_~size~0_176) (<= 0 .cse5)) 1 0)) (= v_~x2~0_294 (select .cse0 (+ v_~f~0.offset_170 (* .cse5 4)))) (not (= (ite (and (< .cse6 v_~size~0_176) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_176) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (= (ite (and (< .cse1 v_~size~0_176) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|) (not (= (ite (and (<= 0 v_~x2~0_296) (< v_~x2~0_296 v_~size~0_176)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (not (= 0 (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_176)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_225| 3) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_176)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_296, ~size~0=v_~size~0_176, ~f~0.base=v_~f~0.base_170, #memory_int=|v_#memory_int_253|, ~n~0=v_~n~0_156, ~x1~0=v_~x1~0_282, ~f~0.offset=v_~f~0.offset_170} OutVars{~x2~0=v_~x2~0_294, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_157|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_96|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_114|, ~size~0=v_~size~0_176, ~f~0.base=v_~f~0.base_170, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_102|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_269|, ~x1~0=v_~x1~0_281, ~f~0.offset=v_~f~0.offset_170, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_96|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_94|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_225|, #memory_int=|v_#memory_int_253|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_167|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_108|, ~n~0=v_~n~0_156, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_110|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_167|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:46:24,125 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:24,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3915 [2022-12-06 05:46:24,126 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 147 transitions, 2174 flow [2022-12-06 05:46:24,127 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 05:46:24,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:24,127 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:24,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:24,331 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,SelfDestructingSolverStorable20 [2022-12-06 05:46:24,331 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 05:46:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash -324503891, now seen corresponding path program 1 times [2022-12-06 05:46:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:24,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503613167] [2022-12-06 05:46:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:25,940 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 05:46:25,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:25,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503613167] [2022-12-06 05:46:25,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503613167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:25,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809764212] [2022-12-06 05:46:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:25,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:25,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:25,944 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 05:46:25,950 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 05:46:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:26,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:46:26,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:26,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:46:26,143 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 05:46:26,191 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 05:46:26,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:26,547 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 05:46:26,547 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 05:46:27,543 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 05:46:27,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809764212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:27,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:27,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 11 [2022-12-06 05:46:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355475822] [2022-12-06 05:46:27,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:27,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:46:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:46:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:46:27,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:46:27,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 147 transitions, 2174 flow. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:27,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:27,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:46:27,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:28,868 INFO L130 PetriNetUnfolder]: 827/1416 cut-off events. [2022-12-06 05:46:28,868 INFO L131 PetriNetUnfolder]: For 17207/17207 co-relation queries the response was YES. [2022-12-06 05:46:28,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9682 conditions, 1416 events. 827/1416 cut-off events. For 17207/17207 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7472 event pairs, 122 based on Foata normal form. 3/1416 useless extension candidates. Maximal degree in co-relation 9118. Up to 934 conditions per place. [2022-12-06 05:46:28,881 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 110 selfloop transitions, 69 changer transitions 7/186 dead transitions. [2022-12-06 05:46:28,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 186 transitions, 2977 flow [2022-12-06 05:46:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:46:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:46:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-12-06 05:46:28,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1937984496124031 [2022-12-06 05:46:28,888 INFO L175 Difference]: Start difference. First operand has 120 places, 147 transitions, 2174 flow. Second operand 9 states and 75 transitions. [2022-12-06 05:46:28,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 186 transitions, 2977 flow [2022-12-06 05:46:28,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 186 transitions, 2794 flow, removed 70 selfloop flow, removed 4 redundant places. [2022-12-06 05:46:28,948 INFO L231 Difference]: Finished difference. Result has 127 places, 159 transitions, 2445 flow [2022-12-06 05:46:28,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2445, PETRI_PLACES=127, PETRI_TRANSITIONS=159} [2022-12-06 05:46:28,948 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 106 predicate places. [2022-12-06 05:46:28,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:28,948 INFO L89 Accepts]: Start accepts. Operand has 127 places, 159 transitions, 2445 flow [2022-12-06 05:46:28,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:28,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:28,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 159 transitions, 2445 flow [2022-12-06 05:46:28,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 159 transitions, 2445 flow [2022-12-06 05:46:28,994 INFO L130 PetriNetUnfolder]: 136/376 cut-off events. [2022-12-06 05:46:28,994 INFO L131 PetriNetUnfolder]: For 5479/5636 co-relation queries the response was YES. [2022-12-06 05:46:28,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 376 events. 136/376 cut-off events. For 5479/5636 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2191 event pairs, 2 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 2456. Up to 174 conditions per place. [2022-12-06 05:46:28,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 159 transitions, 2445 flow [2022-12-06 05:46:28,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 05:46:29,005 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_209| v_~f~0.base_128))) (let ((.cse2 (* (mod v_~n~0_112 1073741824) 4)) (.cse1 (select .cse0 (+ v_~f~0.offset_128 (* v_~x1~0_165 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= (select .cse0 (+ v_~f~0.offset_128 (* .cse1 4))) v_~x1~0_163) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_84|) (not (= (ite (and (<= 0 v_~x1~0_165) (< v_~x1~0_165 v_~size~0_134)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_134)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_84|)))) InVars {~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_209|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_165, ~f~0.offset=v_~f~0.offset_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_78|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_84|, ~size~0=v_~size~0_134, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, #memory_int=|v_#memory_int_209|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_88|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ~f~0.offset=v_~f~0.offset_128} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:29,271 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_270| v_~f~0.base_184))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_184 (* v_~x2~0_320 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_184 (* .cse5 4))))) (let ((.cse13 (select .cse1 (+ v_~f~0.offset_184 (* .cse8 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_184 (* .cse13 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_184 (* .cse11 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_184 (* .cse10 4))))) (let ((.cse12 (select .cse1 (+ v_~f~0.offset_184 (* .cse3 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_184 (* .cse12 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_184 (* 4 .cse9))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_184 (* 4 .cse6)))) (.cse4 (select .cse1 (+ v_~f~0.offset_184 (* v_~x1~0_326 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_184 (* .cse4 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_184 (* .cse0 4))))) (and (not (= (ite (and (<= 0 v_~x1~0_326) (< v_~x1~0_326 v_~size~0_190)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_190)) 1 0) 0)) (= v_~x1~0_325 (select .cse1 (+ v_~f~0.offset_184 (* .cse2 4)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_190)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_190)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_190) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_190)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| (ite (and (< .cse7 v_~size~0_190) (<= 0 .cse7)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_291| 12) (not (= (ite (and (< .cse8 v_~size~0_190) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_190)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_190) (<= 0 .cse10)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| (ite (and (< .cse2 v_~size~0_190) (<= 0 .cse2)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_184 (* .cse7 4))) v_~x2~0_318) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_190)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_216| 0)) (not (= (ite (and (< .cse12 v_~size~0_190) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_190) (<= 0 .cse13)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_254| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|) (not (= (ite (and (< v_~x2~0_320 v_~size~0_190) (<= 0 v_~x2~0_320)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_291|) 4294967296) (* (mod v_~n~0_170 1073741824) 4))))))))))))))) InVars {~x2~0=v_~x2~0_320, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_184, #memory_int=|v_#memory_int_270|, ~n~0=v_~n~0_170, ~x1~0=v_~x1~0_326, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_318, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_110|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_128|, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_116|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_291|, ~x1~0=v_~x1~0_325, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_216|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_192|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_110|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_108|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_254|, #memory_int=|v_#memory_int_270|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_122|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_122|, ~n~0=v_~n~0_170, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_124|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_196|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:46:30,467 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:30,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1520 [2022-12-06 05:46:30,468 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 158 transitions, 2444 flow [2022-12-06 05:46:30,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:30,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:30,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:30,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:30,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:30,676 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 05:46:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:30,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1263582363, now seen corresponding path program 1 times [2022-12-06 05:46:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:30,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006382374] [2022-12-06 05:46:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:30,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:30,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006382374] [2022-12-06 05:46:30,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006382374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:30,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437103931] [2022-12-06 05:46:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:30,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:30,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:30,775 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 05:46:30,807 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 05:46:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:30,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:46:30,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:30,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:31,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437103931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:31,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:31,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:46:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008467565] [2022-12-06 05:46:31,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:31,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:46:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:31,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:46:31,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:46:31,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:46:31,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 158 transitions, 2444 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 05:46:31,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:31,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:46:31,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:31,703 INFO L130 PetriNetUnfolder]: 996/1703 cut-off events. [2022-12-06 05:46:31,703 INFO L131 PetriNetUnfolder]: For 24487/24487 co-relation queries the response was YES. [2022-12-06 05:46:31,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12317 conditions, 1703 events. 996/1703 cut-off events. For 24487/24487 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9228 event pairs, 401 based on Foata normal form. 126/1826 useless extension candidates. Maximal degree in co-relation 11492. Up to 1444 conditions per place. [2022-12-06 05:46:31,726 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 200 selfloop transitions, 31 changer transitions 4/235 dead transitions. [2022-12-06 05:46:31,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 235 transitions, 3854 flow [2022-12-06 05:46:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:46:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:46:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-06 05:46:31,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21188630490956073 [2022-12-06 05:46:31,728 INFO L175 Difference]: Start difference. First operand has 125 places, 158 transitions, 2444 flow. Second operand 9 states and 82 transitions. [2022-12-06 05:46:31,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 235 transitions, 3854 flow [2022-12-06 05:46:31,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 235 transitions, 3765 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-06 05:46:31,783 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 2805 flow [2022-12-06 05:46:31,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2805, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2022-12-06 05:46:31,783 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-06 05:46:31,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:31,784 INFO L89 Accepts]: Start accepts. Operand has 133 places, 179 transitions, 2805 flow [2022-12-06 05:46:31,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:31,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:31,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 179 transitions, 2805 flow [2022-12-06 05:46:31,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 179 transitions, 2805 flow [2022-12-06 05:46:31,842 INFO L130 PetriNetUnfolder]: 169/470 cut-off events. [2022-12-06 05:46:31,842 INFO L131 PetriNetUnfolder]: For 6940/7101 co-relation queries the response was YES. [2022-12-06 05:46:31,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 470 events. 169/470 cut-off events. For 6940/7101 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2916 event pairs, 5 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 3227. Up to 236 conditions per place. [2022-12-06 05:46:31,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 179 transitions, 2805 flow [2022-12-06 05:46:31,848 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 05:46:31,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_260| v_~f~0.base_174))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_174 (* v_~x1~0_297 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_174 (* .cse0 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_174 (* .cse6 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_174 (* .cse3 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_174 (* .cse8 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_174 (* .cse4 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_174 (* .cse7 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_174 (* 4 .cse5))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_277| 0) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_180)) 1 0) 0)) (= v_~x1~0_295 (select .cse1 (+ v_~f~0.offset_174 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|) (not (= (ite (and (< .cse3 v_~size~0_180) (<= 0 .cse3)) 1 0) 0)) (= (ite (and (< .cse2 v_~size~0_180) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_234| 4294967295) 4294967296) (* (mod v_~n~0_160 1073741824) 4)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_180)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_180) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_234| 9) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176| 0)) (not (= (ite (and (<= 0 v_~x1~0_297) (< v_~x1~0_297 v_~size~0_180)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_180)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_180) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_180) (<= 0 .cse8)) 1 0) 0)))))))))))) InVars {~size~0=v_~size~0_180, ~f~0.base=v_~f~0.base_174, #memory_int=|v_#memory_int_260|, ~n~0=v_~n~0_160, ~x1~0=v_~x1~0_297, ~f~0.offset=v_~f~0.offset_174} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, ~size~0=v_~size~0_180, ~f~0.base=v_~f~0.base_174, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_234|, #memory_int=|v_#memory_int_260|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_176|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_277|, ~n~0=v_~n~0_160, ~x1~0=v_~x1~0_295, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_176|, ~f~0.offset=v_~f~0.offset_174} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:34,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_262| v_~f~0.base_176))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_176 (* v_~x1~0_303 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_176 (* .cse4 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_176 (* .cse5 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_176 (* .cse6 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_176 (* .cse1 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_176 (* .cse2 4))))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_182)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176|) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_238|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_182)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|) (not (= (ite (and (<= 0 v_~x1~0_303) (< v_~x1~0_303 v_~size~0_182)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180| 0)) (< 5 (* 4 (mod v_~n~0_162 1073741824))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_182)) 1 0) 0)) (= v_~x1~0_301 (select .cse3 (+ v_~f~0.offset_176 (* 4 .cse0)))) (not (= (ite (and (< .cse4 v_~size~0_182) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_182)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_279| 0) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_182)) 1 0) 0)))))))))) InVars {~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_176, #memory_int=|v_#memory_int_262|, ~n~0=v_~n~0_162, ~x1~0=v_~x1~0_303, ~f~0.offset=v_~f~0.offset_176} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_170|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176|, ~size~0=v_~size~0_182, ~f~0.base=v_~f~0.base_176, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_238|, #memory_int=|v_#memory_int_262|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_279|, ~n~0=v_~n~0_162, ~x1~0=v_~x1~0_301, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_180|, ~f~0.offset=v_~f~0.offset_176} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:34,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_244| v_~f~0.base_162))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_162 (* v_~x1~0_253 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_162 (* .cse1 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_162 (* 4 .cse3))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_162 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_142| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_168)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_197| 5) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_142| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_146|) (not (= (ite (and (<= 0 v_~x1~0_253) (< v_~x1~0_253 v_~size~0_168)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_168)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_197| 4294967295) 4294967296) (* (mod v_~n~0_148 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_~i~1#1_256| 0) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_168)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_168)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_162 (* .cse0 4))) v_~x1~0_251) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_146| 0)))))))) InVars {~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_162, #memory_int=|v_#memory_int_244|, ~n~0=v_~n~0_148, ~x1~0=v_~x1~0_253, ~f~0.offset=v_~f~0.offset_162} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_136|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_142|, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_162, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_197|, #memory_int=|v_#memory_int_244|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_146|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_256|, ~n~0=v_~n~0_148, ~x1~0=v_~x1~0_251, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_146|, ~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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:36,337 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:46:36,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4555 [2022-12-06 05:46:36,338 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 178 transitions, 2858 flow [2022-12-06 05:46:36,338 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 05:46:36,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:36,338 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:36,344 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 05:46:36,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:36,543 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 05:46:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1772704836, now seen corresponding path program 1 times [2022-12-06 05:46:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639950875] [2022-12-06 05:46:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:40,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639950875] [2022-12-06 05:46:40,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639950875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:40,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87512056] [2022-12-06 05:46:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:40,226 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 05:46:40,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 05:46:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:40,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 05:46:40,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:40,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:46:40,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:46:40,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 05:46:40,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:46:40,836 INFO L321 Elim1Store]: treesize reduction 185, result has 17.8 percent of original size [2022-12-06 05:46:40,836 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 99 [2022-12-06 05:46:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:46:40,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:42,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87512056] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:42,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:42,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 17 [2022-12-06 05:46:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651167079] [2022-12-06 05:46:42,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:42,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:46:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:46:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=271, Unknown=3, NotChecked=0, Total=342 [2022-12-06 05:46:42,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:46:42,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 178 transitions, 2858 flow. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:42,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:42,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:46:42,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:47,726 INFO L130 PetriNetUnfolder]: 1423/2463 cut-off events. [2022-12-06 05:46:47,727 INFO L131 PetriNetUnfolder]: For 40244/40244 co-relation queries the response was YES. [2022-12-06 05:46:47,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19411 conditions, 2463 events. 1423/2463 cut-off events. For 40244/40244 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14310 event pairs, 198 based on Foata normal form. 7/2463 useless extension candidates. Maximal degree in co-relation 18005. Up to 1045 conditions per place. [2022-12-06 05:46:47,744 INFO L137 encePairwiseOnDemand]: 15/47 looper letters, 132 selfloop transitions, 162 changer transitions 23/317 dead transitions. [2022-12-06 05:46:47,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 317 transitions, 5371 flow [2022-12-06 05:46:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:46:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:46:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-12-06 05:46:47,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20035460992907803 [2022-12-06 05:46:47,747 INFO L175 Difference]: Start difference. First operand has 132 places, 178 transitions, 2858 flow. Second operand 12 states and 113 transitions. [2022-12-06 05:46:47,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 317 transitions, 5371 flow [2022-12-06 05:46:47,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 317 transitions, 4979 flow, removed 188 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:47,853 INFO L231 Difference]: Finished difference. Result has 148 places, 248 transitions, 4287 flow [2022-12-06 05:46:47,854 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4287, PETRI_PLACES=148, PETRI_TRANSITIONS=248} [2022-12-06 05:46:47,854 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2022-12-06 05:46:47,854 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:47,854 INFO L89 Accepts]: Start accepts. Operand has 148 places, 248 transitions, 4287 flow [2022-12-06 05:46:47,856 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:47,856 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:47,856 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 248 transitions, 4287 flow [2022-12-06 05:46:47,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 248 transitions, 4287 flow [2022-12-06 05:46:47,948 INFO L130 PetriNetUnfolder]: 225/671 cut-off events. [2022-12-06 05:46:47,948 INFO L131 PetriNetUnfolder]: For 11677/11936 co-relation queries the response was YES. [2022-12-06 05:46:47,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5138 conditions, 671 events. 225/671 cut-off events. For 11677/11936 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4657 event pairs, 2 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 4778. Up to 333 conditions per place. [2022-12-06 05:46:47,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 248 transitions, 4287 flow [2022-12-06 05:46:47,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 05:46:50,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [788] $Ultimate##0-->L49-2: Formula: (let ((.cse8 (select |v_#memory_int_281| v_~f~0.base_194))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_194 (* v_~x1~0_359 4))))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_194 (* .cse6 4))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_194 (* .cse1 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_194 (* .cse0 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_194 (* .cse5 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_194 (* .cse4 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_194 (* .cse2 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_194 (* 4 .cse9))))) (let ((.cse10 (select .cse8 (+ v_~f~0.offset_194 (* .cse7 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_194 (* .cse10 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_200)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_200)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_277| 4294967293) 4294967296) (* (mod v_~n~0_180 1073741824) 4)) (not (= (ite (and (< .cse4 v_~size~0_200) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_314| 0) (not (= (ite (and (<= 0 v_~x1~0_359) (< v_~x1~0_359 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_200)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_200) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_200)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_277| 11) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216| 0)) (= (select .cse8 (+ v_~f~0.offset_194 (* .cse3 4))) v_~x1~0_357) (not (= (ite (and (< .cse9 v_~size~0_200) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_200)) 1 0) 0)))))))))))))) InVars {~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_194, #memory_int=|v_#memory_int_281|, ~n~0=v_~n~0_180, ~x1~0=v_~x1~0_359, ~f~0.offset=v_~f~0.offset_194} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_212|, ~size~0=v_~size~0_200, ~f~0.base=v_~f~0.base_194, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_277|, #memory_int=|v_#memory_int_281|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_314|, ~n~0=v_~n~0_180, ~x1~0=v_~x1~0_357, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_216|, ~f~0.offset=v_~f~0.offset_194} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:51,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_285| v_~f~0.base_198))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_198 (* v_~x1~0_368 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_198 (* .cse7 4)))) (.cse5 (select .cse4 (+ v_~f~0.offset_198 (* v_~x2~0_348 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_198 (* .cse5 4)))) (.cse1 (select .cse4 (+ v_~f~0.offset_198 (* .cse6 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_198 (* .cse1 4)))) (.cse0 (select .cse4 (+ v_~f~0.offset_198 (* .cse3 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_283| 4294967295) 4294967296) (* (mod v_~n~0_184 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_193| (ite (and (< .cse0 v_~size~0_204) (<= 0 .cse0)) 1 0)) (not (= (ite (and (< .cse1 v_~size~0_204) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_368 v_~size~0_204) (<= 0 v_~x1~0_368)) 1 0) 0)) (= (ite (and (< .cse2 v_~size~0_204) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|) (not (= (ite (and (< .cse3 v_~size~0_204) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_222|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_193| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_233|) (= v_~x1~0_367 (select .cse4 (+ v_~f~0.offset_198 (* .cse2 4)))) (= v_~x2~0_347 (select .cse4 (+ v_~f~0.offset_198 (* .cse0 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_222| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_233| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_283| 5) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_204)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_204) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_204)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_320| 4) (not (= (ite (and (< v_~x2~0_348 v_~size~0_204) (<= 0 v_~x2~0_348)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_348, ~size~0=v_~size~0_204, ~f~0.base=v_~f~0.base_198, #memory_int=|v_#memory_int_285|, ~n~0=v_~n~0_184, ~x1~0=v_~x1~0_368, ~f~0.offset=v_~f~0.offset_198} OutVars{~x2~0=v_~x2~0_347, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_127|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_145|, ~size~0=v_~size~0_204, ~f~0.base=v_~f~0.base_198, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_193|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_320|, ~x1~0=v_~x1~0_367, ~f~0.offset=v_~f~0.offset_198, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_233|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_127|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_125|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_283|, #memory_int=|v_#memory_int_285|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_222|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_139|, ~n~0=v_~n~0_184, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_141|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_222|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:46:51,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_283| v_~f~0.base_196))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_196 (* v_~x1~0_364 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_196 (* .cse8 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_196 (* .cse4 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_196 (* .cse7 4)))) (.cse6 (select .cse1 (+ v_~f~0.offset_196 (* v_~x2~0_344 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_196 (* .cse6 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_196 (* .cse9 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_196 (* .cse5 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_196 (* .cse3 4))))) (and (= (ite (and (< .cse0 v_~size~0_202) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220|) (= (select .cse1 (+ v_~f~0.offset_196 (* .cse2 4))) v_~x2~0_343) (not (= (ite (and (<= 0 v_~x2~0_344) (< v_~x2~0_344 v_~size~0_202)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_202) (<= 0 .cse3)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_196 (* .cse0 4))) v_~x1~0_363) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_191| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_202)) 1 0)) (not (= (ite (and (< v_~x1~0_364 v_~size~0_202) (<= 0 v_~x1~0_364)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_202) (<= 0 .cse4)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_281|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_202)) 1 0) 0)) (< 5 (* (mod v_~n~0_182 1073741824) 4)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220| 0)) (not (= 0 (ite (and (< .cse6 v_~size~0_202) (<= 0 .cse6)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231| 0)) (not (= (ite (and (< .cse7 v_~size~0_202) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_316| 4) (not (= (ite (and (< .cse8 v_~size~0_202) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_191| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_202)) 1 0) 0)))))))))) InVars {~x2~0=v_~x2~0_344, ~size~0=v_~size~0_202, ~f~0.base=v_~f~0.base_196, #memory_int=|v_#memory_int_283|, ~n~0=v_~n~0_182, ~x1~0=v_~x1~0_364, ~f~0.offset=v_~f~0.offset_196} OutVars{~x2~0=v_~x2~0_343, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_210|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_125|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_143|, ~size~0=v_~size~0_202, ~f~0.base=v_~f~0.base_196, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_131|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_191|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_316|, ~x1~0=v_~x1~0_363, ~f~0.offset=v_~f~0.offset_196, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_216|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_281|, #memory_int=|v_#memory_int_283|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_137|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_220|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_137|, ~n~0=v_~n~0_182, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_139|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:46:52,368 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:46:52,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4515 [2022-12-06 05:46:52,369 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 248 transitions, 4360 flow [2022-12-06 05:46:52,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:52,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:52,369 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:52,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:52,570 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,SelfDestructingSolverStorable23 [2022-12-06 05:46:52,570 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 05:46:52,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1420432038, now seen corresponding path program 1 times [2022-12-06 05:46:52,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:52,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327162278] [2022-12-06 05:46:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:46:52,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:52,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327162278] [2022-12-06 05:46:52,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327162278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:52,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:52,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:46:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684577134] [2022-12-06 05:46:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:52,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 05:46:52,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:52,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 05:46:52,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 05:46:52,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:46:52,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 248 transitions, 4360 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 05:46:52,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:52,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:46:52,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:53,061 INFO L130 PetriNetUnfolder]: 1411/2445 cut-off events. [2022-12-06 05:46:53,061 INFO L131 PetriNetUnfolder]: For 42768/42768 co-relation queries the response was YES. [2022-12-06 05:46:53,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 2445 events. 1411/2445 cut-off events. For 42768/42768 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14179 event pairs, 732 based on Foata normal form. 2/2442 useless extension candidates. Maximal degree in co-relation 18457. Up to 2446 conditions per place. [2022-12-06 05:46:53,082 INFO L137 encePairwiseOnDemand]: 50/51 looper letters, 245 selfloop transitions, 0 changer transitions 1/246 dead transitions. [2022-12-06 05:46:53,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 246 transitions, 4803 flow [2022-12-06 05:46:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 05:46:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 05:46:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2022-12-06 05:46:53,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:46:53,084 INFO L175 Difference]: Start difference. First operand has 147 places, 248 transitions, 4360 flow. Second operand 2 states and 51 transitions. [2022-12-06 05:46:53,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 246 transitions, 4803 flow [2022-12-06 05:46:53,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 246 transitions, 4640 flow, removed 64 selfloop flow, removed 4 redundant places. [2022-12-06 05:46:53,271 INFO L231 Difference]: Finished difference. Result has 144 places, 245 transitions, 4129 flow [2022-12-06 05:46:53,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4148, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=4129, PETRI_PLACES=144, PETRI_TRANSITIONS=245} [2022-12-06 05:46:53,272 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-06 05:46:53,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:53,272 INFO L89 Accepts]: Start accepts. Operand has 144 places, 245 transitions, 4129 flow [2022-12-06 05:46:53,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:53,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:53,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 245 transitions, 4129 flow [2022-12-06 05:46:53,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 245 transitions, 4129 flow [2022-12-06 05:46:53,367 INFO L130 PetriNetUnfolder]: 225/665 cut-off events. [2022-12-06 05:46:53,367 INFO L131 PetriNetUnfolder]: For 11389/11646 co-relation queries the response was YES. [2022-12-06 05:46:53,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5031 conditions, 665 events. 225/665 cut-off events. For 11389/11646 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4577 event pairs, 4 based on Foata normal form. 2/654 useless extension candidates. Maximal degree in co-relation 4857. Up to 329 conditions per place. [2022-12-06 05:46:53,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 245 transitions, 4129 flow [2022-12-06 05:46:53,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-06 05:46:54,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [798] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_298| v_~f~0.base_208))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_208 (* v_~x1~0_398 4))))) (let ((.cse4 (select .cse10 (+ (* .cse2 4) v_~f~0.offset_208)))) (let ((.cse3 (select .cse10 (+ v_~f~0.offset_208 (* .cse4 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_208 (* .cse3 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_208 (* .cse6 4))))) (let ((.cse12 (select .cse10 (+ v_~f~0.offset_208 (* .cse1 4))))) (let ((.cse0 (select .cse10 (+ v_~f~0.offset_208 (* 4 .cse12))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_208 (* .cse0 4)))) (.cse8 (select .cse10 (+ v_~f~0.offset_208 (* v_~x2~0_370 4))))) (let ((.cse9 (select .cse10 (+ v_~f~0.offset_208 (* .cse8 4)))) (.cse5 (select .cse10 (+ v_~f~0.offset_208 (* .cse13 4))))) (let ((.cse7 (select .cse10 (+ (* 4 .cse5) v_~f~0.offset_208))) (.cse11 (select .cse10 (+ v_~f~0.offset_208 (* 4 .cse9))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_214)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_214) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_214) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_214) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_214) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246| 0)) (not (= (ite (and (< .cse5 v_~size~0_214) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_214)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_341| 4) (= (ite (and (< .cse7 v_~size~0_214) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|) (not (= (ite (and (< .cse8 v_~size~0_214) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_214) (<= 0 .cse9)) 1 0) 0)) (= (select .cse10 (+ (* .cse7 4) v_~f~0.offset_208)) v_~x1~0_397) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_214)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246|) (= (select .cse10 (+ v_~f~0.offset_208 (* .cse11 4))) v_~x2~0_369) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_214)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_214) (<= 0 .cse13)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|) (= |v_thread1Thread1of1ForFork0_~i~0#1_301| 11) (not (= (ite (and (<= 0 v_~x1~0_398) (< v_~x1~0_398 v_~size~0_214)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_301| 4294967293) 4294967296) (* (mod v_~n~0_194 1073741824) 4)) (not (= (ite (and (<= 0 v_~x2~0_370) (< v_~x2~0_370 v_~size~0_214)) 1 0) 0)))))))))))))) InVars {~x2~0=v_~x2~0_370, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_208, #memory_int=|v_#memory_int_298|, ~n~0=v_~n~0_194, ~x1~0=v_~x1~0_398, ~f~0.offset=v_~f~0.offset_208} OutVars{~x2~0=v_~x2~0_369, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_230|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_140|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_208, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_146|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_341|, ~x1~0=v_~x1~0_397, ~f~0.offset=v_~f~0.offset_208, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_236|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_140|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_138|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_301|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_152|, ~n~0=v_~n~0_194, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_154|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_240|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:46:56,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:56,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2729 [2022-12-06 05:46:56,001 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 245 transitions, 4153 flow [2022-12-06 05:46:56,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 05:46:56,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:56,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:56,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:46:56,002 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 05:46:56,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash 339381868, now seen corresponding path program 1 times [2022-12-06 05:46:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:56,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144790687] [2022-12-06 05:46:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:56,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:56,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144790687] [2022-12-06 05:46:56,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144790687] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:56,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2253711] [2022-12-06 05:46:56,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:56,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:56,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:56,140 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 05:46:56,146 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 05:46:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:56,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:46:56,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:56,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:46:56,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2253711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:56,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:46:56,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-06 05:46:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861262604] [2022-12-06 05:46:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:56,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:46:56,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:46:56,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 245 transitions, 4153 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 05:46:56,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:56,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:46:56,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:56,946 INFO L130 PetriNetUnfolder]: 1409/2443 cut-off events. [2022-12-06 05:46:56,946 INFO L131 PetriNetUnfolder]: For 41970/41970 co-relation queries the response was YES. [2022-12-06 05:46:56,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19690 conditions, 2443 events. 1409/2443 cut-off events. For 41970/41970 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14113 event pairs, 708 based on Foata normal form. 4/2442 useless extension candidates. Maximal degree in co-relation 19360. Up to 2436 conditions per place. [2022-12-06 05:46:56,967 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 244 selfloop transitions, 3 changer transitions 5/252 dead transitions. [2022-12-06 05:46:56,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 252 transitions, 4715 flow [2022-12-06 05:46:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 05:46:56,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28921568627450983 [2022-12-06 05:46:56,968 INFO L175 Difference]: Start difference. First operand has 142 places, 245 transitions, 4153 flow. Second operand 4 states and 59 transitions. [2022-12-06 05:46:56,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 252 transitions, 4715 flow [2022-12-06 05:46:57,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 252 transitions, 4699 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 05:46:57,151 INFO L231 Difference]: Finished difference. Result has 146 places, 246 transitions, 4173 flow [2022-12-06 05:46:57,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4137, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4173, PETRI_PLACES=146, PETRI_TRANSITIONS=246} [2022-12-06 05:46:57,152 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2022-12-06 05:46:57,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:57,152 INFO L89 Accepts]: Start accepts. Operand has 146 places, 246 transitions, 4173 flow [2022-12-06 05:46:57,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:57,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:57,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 246 transitions, 4173 flow [2022-12-06 05:46:57,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 246 transitions, 4173 flow [2022-12-06 05:46:57,265 INFO L130 PetriNetUnfolder]: 227/669 cut-off events. [2022-12-06 05:46:57,265 INFO L131 PetriNetUnfolder]: For 11704/11955 co-relation queries the response was YES. [2022-12-06 05:46:57,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 669 events. 227/669 cut-off events. For 11704/11955 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4565 event pairs, 3 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 4975. Up to 332 conditions per place. [2022-12-06 05:46:57,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 246 transitions, 4173 flow [2022-12-06 05:46:57,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 914 [2022-12-06 05:46:57,302 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_304| v_~f~0.base_214))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_214 (* v_~x1~0_414 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_214 (* .cse3 4))))) (let ((.cse10 (select .cse6 (+ v_~f~0.offset_214 (* .cse0 4))))) (let ((.cse17 (select .cse6 (+ v_~f~0.offset_214 (* v_~x2~0_383 4)))) (.cse9 (select .cse6 (+ v_~f~0.offset_214 (* .cse10 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_214 (* .cse9 4)))) (.cse13 (select .cse6 (+ v_~f~0.offset_214 (* 4 .cse17))))) (let ((.cse15 (select .cse6 (+ v_~f~0.offset_214 (* .cse13 4)))) (.cse1 (select .cse6 (+ v_~f~0.offset_214 (* .cse4 4))))) (let ((.cse16 (select .cse6 (+ v_~f~0.offset_214 (* .cse1 4)))) (.cse11 (select .cse6 (+ v_~f~0.offset_214 (* .cse15 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_214 (* .cse11 4)))) (.cse12 (select .cse6 (+ v_~f~0.offset_214 (* .cse16 4))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_214 (* .cse12 4)))) (.cse2 (select .cse6 (+ v_~f~0.offset_214 (* .cse8 4))))) (let ((.cse7 (select .cse6 (+ v_~f~0.offset_214 (* .cse2 4)))) (.cse14 (select .cse6 (+ v_~f~0.offset_214 (* .cse5 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_220) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_220) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_220)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250| 0)) (not (= (ite (and (< .cse4 v_~size~0_220) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_414) (< v_~x1~0_414 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_349| 8) (= v_~x2~0_381 (select .cse6 (+ v_~f~0.offset_214 (* .cse7 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_220) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_220) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_220)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_220)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_311| 4294967293) 4294967296) (* (mod v_~n~0_200 1073741824) 4)) (not (= (ite (and (< v_~x2~0_383 v_~size~0_220) (<= 0 v_~x2~0_383)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_311| 11) (= (select .cse6 (+ v_~f~0.offset_214 (* .cse14 4))) v_~x1~0_413) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|) (not (= (ite (and (< .cse15 v_~size~0_220) (<= 0 .cse15)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| (ite (and (< .cse7 v_~size~0_220) (<= 0 .cse7)) 1 0)) (not (= (ite (and (< .cse16 v_~size~0_220) (<= 0 .cse16)) 1 0) 0)) (= (ite (and (< .cse14 v_~size~0_220) (<= 0 .cse14)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246|) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_220)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252| 0)))))))))))))) InVars {~x2~0=v_~x2~0_383, ~size~0=v_~size~0_220, ~f~0.base=v_~f~0.base_214, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_200, ~x1~0=v_~x1~0_414, ~f~0.offset=v_~f~0.offset_214} OutVars{~x2~0=v_~x2~0_381, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_240|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_146|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_220, ~f~0.base=v_~f~0.base_214, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_152|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_349|, ~x1~0=v_~x1~0_413, ~f~0.offset=v_~f~0.offset_214, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_246|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_146|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_144|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_311|, #memory_int=|v_#memory_int_304|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_158|, ~n~0=v_~n~0_200, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_160|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_250|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:47:01,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:01,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4049 [2022-12-06 05:47:01,201 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 246 transitions, 4189 flow [2022-12-06 05:47:01,201 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 05:47:01,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:01,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:01,207 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 05:47:01,407 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,SelfDestructingSolverStorable25 [2022-12-06 05:47:01,407 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 05:47:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2102858552, now seen corresponding path program 1 times [2022-12-06 05:47:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:01,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260443806] [2022-12-06 05:47:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260443806] [2022-12-06 05:47:01,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260443806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:01,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:01,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558341841] [2022-12-06 05:47:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:01,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:01,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:01,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:01,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:47:01,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 246 transitions, 4189 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 05:47:01,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:01,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:47:01,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:02,049 INFO L130 PetriNetUnfolder]: 1424/2460 cut-off events. [2022-12-06 05:47:02,049 INFO L131 PetriNetUnfolder]: For 43688/43688 co-relation queries the response was YES. [2022-12-06 05:47:02,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20062 conditions, 2460 events. 1424/2460 cut-off events. For 43688/43688 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14214 event pairs, 692 based on Foata normal form. 4/2459 useless extension candidates. Maximal degree in co-relation 19443. Up to 2394 conditions per place. [2022-12-06 05:47:02,068 INFO L137 encePairwiseOnDemand]: 44/52 looper letters, 244 selfloop transitions, 13 changer transitions 1/258 dead transitions. [2022-12-06 05:47:02,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 258 transitions, 4894 flow [2022-12-06 05:47:02,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 05:47:02,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-06 05:47:02,069 INFO L175 Difference]: Start difference. First operand has 144 places, 246 transitions, 4189 flow. Second operand 3 states and 57 transitions. [2022-12-06 05:47:02,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 258 transitions, 4894 flow [2022-12-06 05:47:02,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 258 transitions, 4861 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:02,208 INFO L231 Difference]: Finished difference. Result has 145 places, 249 transitions, 4259 flow [2022-12-06 05:47:02,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=4158, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4259, PETRI_PLACES=145, PETRI_TRANSITIONS=249} [2022-12-06 05:47:02,208 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 124 predicate places. [2022-12-06 05:47:02,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:02,208 INFO L89 Accepts]: Start accepts. Operand has 145 places, 249 transitions, 4259 flow [2022-12-06 05:47:02,209 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:02,209 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:02,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 249 transitions, 4259 flow [2022-12-06 05:47:02,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 249 transitions, 4259 flow [2022-12-06 05:47:02,296 INFO L130 PetriNetUnfolder]: 230/677 cut-off events. [2022-12-06 05:47:02,296 INFO L131 PetriNetUnfolder]: For 12055/12306 co-relation queries the response was YES. [2022-12-06 05:47:02,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5257 conditions, 677 events. 230/677 cut-off events. For 12055/12306 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4675 event pairs, 4 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 4883. Up to 337 conditions per place. [2022-12-06 05:47:02,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 249 transitions, 4259 flow [2022-12-06 05:47:02,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 926 [2022-12-06 05:47:02,306 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:02,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 05:47:02,307 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 249 transitions, 4259 flow [2022-12-06 05:47:02,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 05:47:02,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:02,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:02,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:47:02,307 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 05:47:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash 652083889, now seen corresponding path program 1 times [2022-12-06 05:47:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:02,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28771244] [2022-12-06 05:47:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:07,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28771244] [2022-12-06 05:47:07,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28771244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:07,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582270456] [2022-12-06 05:47:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:07,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:07,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:07,984 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 05:47:07,986 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 05:47:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:08,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 05:47:08,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:08,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:08,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:47:08,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:08,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:08,838 INFO L321 Elim1Store]: treesize reduction 477, result has 9.8 percent of original size [2022-12-06 05:47:08,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 23 new quantified variables, introduced 66 case distinctions, treesize of input 651 treesize of output 149 [2022-12-06 05:47:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:08,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:14,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582270456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:14,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:47:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197819632] [2022-12-06 05:47:14,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:47:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:47:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=126, Unknown=1, NotChecked=0, Total=182 [2022-12-06 05:47:14,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:47:14,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 249 transitions, 4259 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 05:47:14,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:14,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:47:14,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:19,591 INFO L130 PetriNetUnfolder]: 1493/2582 cut-off events. [2022-12-06 05:47:19,591 INFO L131 PetriNetUnfolder]: For 45238/45238 co-relation queries the response was YES. [2022-12-06 05:47:19,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21210 conditions, 2582 events. 1493/2582 cut-off events. For 45238/45238 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15144 event pairs, 226 based on Foata normal form. 1/2578 useless extension candidates. Maximal degree in co-relation 19868. Up to 2153 conditions per place. [2022-12-06 05:47:19,611 INFO L137 encePairwiseOnDemand]: 20/51 looper letters, 207 selfloop transitions, 60 changer transitions 5/272 dead transitions. [2022-12-06 05:47:19,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 272 transitions, 5082 flow [2022-12-06 05:47:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:47:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:47:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-06 05:47:19,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21568627450980393 [2022-12-06 05:47:19,612 INFO L175 Difference]: Start difference. First operand has 144 places, 249 transitions, 4259 flow. Second operand 6 states and 66 transitions. [2022-12-06 05:47:19,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 272 transitions, 5082 flow [2022-12-06 05:47:19,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 272 transitions, 5063 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:19,753 INFO L231 Difference]: Finished difference. Result has 149 places, 253 transitions, 4492 flow [2022-12-06 05:47:19,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4240, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4492, PETRI_PLACES=149, PETRI_TRANSITIONS=253} [2022-12-06 05:47:19,754 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2022-12-06 05:47:19,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:19,754 INFO L89 Accepts]: Start accepts. Operand has 149 places, 253 transitions, 4492 flow [2022-12-06 05:47:19,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:19,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:19,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 253 transitions, 4492 flow [2022-12-06 05:47:19,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 253 transitions, 4492 flow [2022-12-06 05:47:19,854 INFO L130 PetriNetUnfolder]: 238/705 cut-off events. [2022-12-06 05:47:19,854 INFO L131 PetriNetUnfolder]: For 13212/13472 co-relation queries the response was YES. [2022-12-06 05:47:19,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5569 conditions, 705 events. 238/705 cut-off events. For 13212/13472 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4954 event pairs, 7 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 5142. Up to 351 conditions per place. [2022-12-06 05:47:19,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 253 transitions, 4492 flow [2022-12-06 05:47:19,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 942 [2022-12-06 05:47:19,862 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:19,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-06 05:47:19,863 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 253 transitions, 4492 flow [2022-12-06 05:47:19,863 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 05:47:19,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:19,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:19,869 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 05:47:20,065 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,SelfDestructingSolverStorable27 [2022-12-06 05:47:20,066 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 05:47:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash 101167995, now seen corresponding path program 1 times [2022-12-06 05:47:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:20,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404404676] [2022-12-06 05:47:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:28,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 05:47:28,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:28,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404404676] [2022-12-06 05:47:28,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404404676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:28,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108927542] [2022-12-06 05:47:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:28,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:28,864 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 05:47:28,869 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 05:47:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:28,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-06 05:47:28,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:29,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:29,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:47:29,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:29,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:29,732 INFO L321 Elim1Store]: treesize reduction 477, result has 9.8 percent of original size [2022-12-06 05:47:29,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 23 new quantified variables, introduced 66 case distinctions, treesize of input 321 treesize of output 131 [2022-12-06 05:47:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:29,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:34,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108927542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:34,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:34,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:47:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88338713] [2022-12-06 05:47:34,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:34,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:47:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:47:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=129, Unknown=1, NotChecked=0, Total=182 [2022-12-06 05:47:34,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:47:34,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 253 transitions, 4492 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 05:47:34,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:34,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:47:34,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:41,733 INFO L130 PetriNetUnfolder]: 1564/2708 cut-off events. [2022-12-06 05:47:41,733 INFO L131 PetriNetUnfolder]: For 49370/49370 co-relation queries the response was YES. [2022-12-06 05:47:41,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22643 conditions, 2708 events. 1564/2708 cut-off events. For 49370/49370 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 16203 event pairs, 230 based on Foata normal form. 1/2704 useless extension candidates. Maximal degree in co-relation 21190. Up to 2418 conditions per place. [2022-12-06 05:47:41,754 INFO L137 encePairwiseOnDemand]: 19/51 looper letters, 205 selfloop transitions, 76 changer transitions 2/283 dead transitions. [2022-12-06 05:47:41,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 283 transitions, 5493 flow [2022-12-06 05:47:41,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:47:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:47:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-06 05:47:41,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22549019607843138 [2022-12-06 05:47:41,755 INFO L175 Difference]: Start difference. First operand has 149 places, 253 transitions, 4492 flow. Second operand 6 states and 69 transitions. [2022-12-06 05:47:41,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 283 transitions, 5493 flow [2022-12-06 05:47:41,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 283 transitions, 5423 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:41,919 INFO L231 Difference]: Finished difference. Result has 152 places, 265 transitions, 4900 flow [2022-12-06 05:47:41,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4424, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4900, PETRI_PLACES=152, PETRI_TRANSITIONS=265} [2022-12-06 05:47:41,920 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-06 05:47:41,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:41,920 INFO L89 Accepts]: Start accepts. Operand has 152 places, 265 transitions, 4900 flow [2022-12-06 05:47:41,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:41,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:41,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 265 transitions, 4900 flow [2022-12-06 05:47:41,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 265 transitions, 4900 flow [2022-12-06 05:47:42,021 INFO L130 PetriNetUnfolder]: 250/733 cut-off events. [2022-12-06 05:47:42,021 INFO L131 PetriNetUnfolder]: For 15133/15406 co-relation queries the response was YES. [2022-12-06 05:47:42,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 733 events. 250/733 cut-off events. For 15133/15406 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5234 event pairs, 5 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 5560. Up to 370 conditions per place. [2022-12-06 05:47:42,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 265 transitions, 4900 flow [2022-12-06 05:47:42,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 996 [2022-12-06 05:47:42,030 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:42,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 05:47:42,031 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 265 transitions, 4900 flow [2022-12-06 05:47:42,031 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 05:47:42,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:42,031 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:42,039 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 05:47:42,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 05:47:42,232 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 05:47:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash -131812946, now seen corresponding path program 2 times [2022-12-06 05:47:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:42,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665616022] [2022-12-06 05:47:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:42,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665616022] [2022-12-06 05:47:42,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665616022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:42,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333969101] [2022-12-06 05:47:42,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:47:42,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:42,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:42,351 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 05:47:42,358 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 05:47:42,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:47:42,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:47:42,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:47:42,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:42,601 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 05:47:42,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:42,665 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 05:47:42,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333969101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:42,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:42,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:47:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097489756] [2022-12-06 05:47:42,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:42,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:47:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:47:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:47:42,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:47:42,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 265 transitions, 4900 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:42,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:42,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:47:42,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:45,338 INFO L130 PetriNetUnfolder]: 1944/3380 cut-off events. [2022-12-06 05:47:45,339 INFO L131 PetriNetUnfolder]: For 69350/69350 co-relation queries the response was YES. [2022-12-06 05:47:45,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28880 conditions, 3380 events. 1944/3380 cut-off events. For 69350/69350 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21119 event pairs, 167 based on Foata normal form. 164/3539 useless extension candidates. Maximal degree in co-relation 27258. Up to 1485 conditions per place. [2022-12-06 05:47:45,368 INFO L137 encePairwiseOnDemand]: 13/51 looper letters, 241 selfloop transitions, 238 changer transitions 52/531 dead transitions. [2022-12-06 05:47:45,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 531 transitions, 10053 flow [2022-12-06 05:47:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 05:47:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 05:47:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 195 transitions. [2022-12-06 05:47:45,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13655462184873948 [2022-12-06 05:47:45,370 INFO L175 Difference]: Start difference. First operand has 152 places, 265 transitions, 4900 flow. Second operand 28 states and 195 transitions. [2022-12-06 05:47:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 531 transitions, 10053 flow [2022-12-06 05:47:45,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 531 transitions, 9909 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:45,615 INFO L231 Difference]: Finished difference. Result has 187 places, 351 transitions, 7264 flow [2022-12-06 05:47:45,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=4817, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=7264, PETRI_PLACES=187, PETRI_TRANSITIONS=351} [2022-12-06 05:47:45,616 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-06 05:47:45,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:45,616 INFO L89 Accepts]: Start accepts. Operand has 187 places, 351 transitions, 7264 flow [2022-12-06 05:47:45,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:45,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:45,618 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 351 transitions, 7264 flow [2022-12-06 05:47:45,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 351 transitions, 7264 flow [2022-12-06 05:47:45,765 INFO L130 PetriNetUnfolder]: 340/957 cut-off events. [2022-12-06 05:47:45,765 INFO L131 PetriNetUnfolder]: For 32263/32899 co-relation queries the response was YES. [2022-12-06 05:47:45,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9536 conditions, 957 events. 340/957 cut-off events. For 32263/32899 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6902 event pairs, 10 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 9166. Up to 515 conditions per place. [2022-12-06 05:47:45,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 351 transitions, 7264 flow [2022-12-06 05:47:45,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 1146 [2022-12-06 05:47:49,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:49,819 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:49,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4204 [2022-12-06 05:47:49,820 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 350 transitions, 7271 flow [2022-12-06 05:47:49,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:49,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:49,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:49,830 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 05:47:50,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:50,027 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 05:47:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash -80322943, now seen corresponding path program 1 times [2022-12-06 05:47:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:50,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174463939] [2022-12-06 05:47:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174463939] [2022-12-06 05:47:50,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174463939] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:50,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742747445] [2022-12-06 05:47:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:50,106 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 05:47:50,110 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 05:47:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:50,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:47:50,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:50,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:50,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742747445] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:50,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:50,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:47:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72710487] [2022-12-06 05:47:50,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:50,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:47:50,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:47:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:47:50,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:47:50,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 350 transitions, 7271 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:50,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:50,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:47:50,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:51,698 INFO L130 PetriNetUnfolder]: 2375/4098 cut-off events. [2022-12-06 05:47:51,698 INFO L131 PetriNetUnfolder]: For 141017/141017 co-relation queries the response was YES. [2022-12-06 05:47:51,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43826 conditions, 4098 events. 2375/4098 cut-off events. For 141017/141017 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 25758 event pairs, 602 based on Foata normal form. 2/4097 useless extension candidates. Maximal degree in co-relation 42326. Up to 2620 conditions per place. [2022-12-06 05:47:51,740 INFO L137 encePairwiseOnDemand]: 29/53 looper letters, 286 selfloop transitions, 182 changer transitions 1/469 dead transitions. [2022-12-06 05:47:51,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 469 transitions, 10404 flow [2022-12-06 05:47:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:47:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:47:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2022-12-06 05:47:51,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23180592991913745 [2022-12-06 05:47:51,741 INFO L175 Difference]: Start difference. First operand has 184 places, 350 transitions, 7271 flow. Second operand 7 states and 86 transitions. [2022-12-06 05:47:51,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 469 transitions, 10404 flow [2022-12-06 05:47:52,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 469 transitions, 9226 flow, removed 536 selfloop flow, removed 7 redundant places. [2022-12-06 05:47:52,193 INFO L231 Difference]: Finished difference. Result has 185 places, 434 transitions, 8478 flow [2022-12-06 05:47:52,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=6217, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8478, PETRI_PLACES=185, PETRI_TRANSITIONS=434} [2022-12-06 05:47:52,193 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2022-12-06 05:47:52,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:52,194 INFO L89 Accepts]: Start accepts. Operand has 185 places, 434 transitions, 8478 flow [2022-12-06 05:47:52,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:52,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:52,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 434 transitions, 8478 flow [2022-12-06 05:47:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 434 transitions, 8478 flow [2022-12-06 05:47:52,383 INFO L130 PetriNetUnfolder]: 422/1175 cut-off events. [2022-12-06 05:47:52,383 INFO L131 PetriNetUnfolder]: For 48071/49192 co-relation queries the response was YES. [2022-12-06 05:47:52,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12231 conditions, 1175 events. 422/1175 cut-off events. For 48071/49192 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8739 event pairs, 10 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 11355. Up to 588 conditions per place. [2022-12-06 05:47:52,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 434 transitions, 8478 flow [2022-12-06 05:47:52,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 1474 [2022-12-06 05:47:52,552 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:52,923 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:52,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 730 [2022-12-06 05:47:52,924 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 434 transitions, 8496 flow [2022-12-06 05:47:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:52,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:52,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:52,930 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 05:47:53,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:53,131 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 05:47:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash -650431766, now seen corresponding path program 1 times [2022-12-06 05:47:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:53,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826639100] [2022-12-06 05:47:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:53,247 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 05:47:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:53,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826639100] [2022-12-06 05:47:53,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826639100] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:53,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330168994] [2022-12-06 05:47:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:53,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:53,249 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 05:47:53,251 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 05:47:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:53,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 88 conjunts are in the unsatisfiable core [2022-12-06 05:47:53,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:53,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:53,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:47:53,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:53,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:56,164 INFO L321 Elim1Store]: treesize reduction 1496, result has 4.0 percent of original size [2022-12-06 05:47:56,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 38 new quantified variables, introduced 190 case distinctions, treesize of input 328 treesize of output 192 [2022-12-06 05:47:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:47:56,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:02,858 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_~x2~0_427 Int) (v_ArrVal_1001 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1001) c_~f~0.base))) (let ((.cse7 (select .cse8 (+ (* c_~x2~0 4) c_~f~0.offset)))) (let ((.cse27 (select .cse8 (+ (* .cse7 4) c_~f~0.offset)))) (let ((.cse11 (select .cse8 (+ c_~f~0.offset (* .cse27 4))))) (let ((.cse28 (select .cse8 (+ c_~f~0.offset (* .cse11 4))))) (let ((.cse5 (select .cse8 (+ (* .cse28 4) c_~f~0.offset)))) (let ((.cse0 (select .cse8 (+ (* c_~x1~0 4) c_~f~0.offset))) (.cse6 (select .cse8 (+ c_~f~0.offset (* .cse5 4))))) (let ((.cse16 (select .cse8 (+ c_~f~0.offset (* .cse6 4)))) (.cse18 (select .cse8 (+ (* .cse0 4) c_~f~0.offset)))) (let ((.cse25 (select .cse8 (+ (* (select .cse8 (+ c_~f~0.offset (* .cse18 4))) 4) c_~f~0.offset))) (.cse26 (select .cse8 (+ c_~f~0.offset (* .cse16 4))))) (let ((.cse17 (select .cse8 (+ c_~f~0.offset (* .cse26 4)))) (.cse12 (select .cse8 (+ (* .cse25 4) c_~f~0.offset)))) (let ((.cse20 (select .cse8 (+ c_~f~0.offset (* 4 .cse12)))) (.cse1 (select .cse8 (+ c_~f~0.offset (* .cse17 4))))) (let ((.cse15 (select .cse8 (+ (* .cse1 4) c_~f~0.offset))) (.cse14 (select .cse8 (+ c_~f~0.offset (* 4 .cse20))))) (let ((.cse10 (select .cse8 (+ c_~f~0.offset (* .cse14 4)))) (.cse21 (select .cse8 (+ c_~f~0.offset (* .cse15 4))))) (let ((.cse13 (select .cse8 (+ c_~f~0.offset (* .cse21 4)))) (.cse22 (select .cse8 (+ c_~f~0.offset (* .cse10 4)))) (.cse4 (select .cse8 (+ c_~f~0.offset (* v_~x2~0_427 4))))) (let ((.cse23 (select .cse8 (+ (* 4 .cse4) c_~f~0.offset))) (.cse2 (select .cse8 (+ (* .cse22 4) c_~f~0.offset))) (.cse24 (select .cse8 (+ (* .cse13 4) c_~f~0.offset)))) (let ((.cse19 (select .cse8 (+ c_~f~0.offset (* .cse24 4)))) (.cse3 (select .cse8 (+ (* .cse2 4) c_~f~0.offset))) (.cse9 (select .cse8 (+ c_~f~0.offset (* .cse23 4))))) (or (not (< .cse0 c_~size~0)) (not (<= 0 .cse1)) (< .cse2 0) (<= c_~size~0 .cse3) (not (< .cse4 c_~size~0)) (not (<= 0 .cse5)) (not (<= 0 .cse6)) (not (< .cse7 c_~size~0)) (= (select .cse8 (+ c_~f~0.offset (* .cse3 4))) (select .cse8 (+ (* .cse9 4) c_~f~0.offset))) (not (<= 0 .cse10)) (< .cse9 0) (not (< .cse5 c_~size~0)) (not (<= 0 .cse11)) (not (< .cse12 c_~size~0)) (not (<= 0 .cse13)) (not (< .cse14 c_~size~0)) (not (< v_~x2~0_427 c_~size~0)) (not (<= 0 .cse15)) (not (< .cse6 c_~size~0)) (not (<= 0 .cse16)) (not (<= 0 .cse17)) (not (<= 0 .cse18)) (not (<= 0 .cse7)) (< .cse19 0) (not (< .cse17 c_~size~0)) (not (<= 0 .cse14)) (not (<= 0 .cse20)) (not (<= 0 .cse12)) (not (<= 0 .cse21)) (not (<= 0 .cse22)) (not (< .cse10 c_~size~0)) (not (< .cse21 c_~size~0)) (not (< .cse23 c_~size~0)) (<= c_~size~0 .cse2) (not (< .cse24 c_~size~0)) (not (<= 0 v_~x2~0_427)) (<= c_~size~0 .cse19) (not (< .cse16 c_~size~0)) (not (<= 0 .cse4)) (not (< .cse11 c_~size~0)) (not (<= 0 .cse25)) (not (< .cse25 c_~size~0)) (not (< .cse26 c_~size~0)) (not (< .cse18 c_~size~0)) (not (<= v_~x2~0_427 (select .cse8 (+ c_~f~0.offset (* .cse19 4))))) (not (<= 0 .cse23)) (not (<= 0 .cse27)) (< .cse3 0) (not (<= 0 .cse26)) (not (< .cse1 c_~size~0)) (not (<= 0 .cse28)) (not (< .cse20 c_~size~0)) (not (< .cse28 c_~size~0)) (not (< .cse13 c_~size~0)) (not (< .cse27 c_~size~0)) (not (<= 0 .cse24)) (not (<= 0 .cse0)) (not (< .cse22 c_~size~0)) (<= c_~size~0 .cse9) (not (< .cse15 c_~size~0)))))))))))))))))))) is different from false [2022-12-06 05:48:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:04,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330168994] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:04,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:04,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 05:48:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266674330] [2022-12-06 05:48:04,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:04,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:48:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:48:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=147, Unknown=1, NotChecked=24, Total=210 [2022-12-06 05:48:04,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:48:04,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 434 transitions, 8496 flow. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 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 05:48:04,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:04,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:48:04,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:26,720 INFO L130 PetriNetUnfolder]: 2633/4564 cut-off events. [2022-12-06 05:48:26,720 INFO L131 PetriNetUnfolder]: For 162325/162325 co-relation queries the response was YES. [2022-12-06 05:48:26,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48279 conditions, 4564 events. 2633/4564 cut-off events. For 162325/162325 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 29109 event pairs, 258 based on Foata normal form. 13/4574 useless extension candidates. Maximal degree in co-relation 45505. Up to 1927 conditions per place. [2022-12-06 05:48:26,760 INFO L137 encePairwiseOnDemand]: 19/55 looper letters, 212 selfloop transitions, 290 changer transitions 30/532 dead transitions. [2022-12-06 05:48:26,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 532 transitions, 11304 flow [2022-12-06 05:48:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:48:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:48:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-12-06 05:48:26,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15272727272727274 [2022-12-06 05:48:26,761 INFO L175 Difference]: Start difference. First operand has 185 places, 434 transitions, 8496 flow. Second operand 15 states and 126 transitions. [2022-12-06 05:48:26,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 532 transitions, 11304 flow [2022-12-06 05:48:27,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 532 transitions, 11152 flow, removed 74 selfloop flow, removed 1 redundant places. [2022-12-06 05:48:27,099 INFO L231 Difference]: Finished difference. Result has 201 places, 458 transitions, 9869 flow [2022-12-06 05:48:27,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=8362, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9869, PETRI_PLACES=201, PETRI_TRANSITIONS=458} [2022-12-06 05:48:27,100 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 180 predicate places. [2022-12-06 05:48:27,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:27,100 INFO L89 Accepts]: Start accepts. Operand has 201 places, 458 transitions, 9869 flow [2022-12-06 05:48:27,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:27,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:27,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 458 transitions, 9869 flow [2022-12-06 05:48:27,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 458 transitions, 9869 flow [2022-12-06 05:48:27,320 INFO L130 PetriNetUnfolder]: 454/1283 cut-off events. [2022-12-06 05:48:27,320 INFO L131 PetriNetUnfolder]: For 56198/57380 co-relation queries the response was YES. [2022-12-06 05:48:27,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14343 conditions, 1283 events. 454/1283 cut-off events. For 56198/57380 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9808 event pairs, 9 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 13411. Up to 645 conditions per place. [2022-12-06 05:48:27,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 458 transitions, 9869 flow [2022-12-06 05:48:27,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-06 05:48:27,353 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:27,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [809] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_310| v_~f~0.base_220))) (let ((.cse7 (select .cse5 (+ v_~f~0.offset_220 (* v_~x2~0_397 4))))) (let ((.cse12 (select .cse5 (+ v_~f~0.offset_220 (* v_~x1~0_430 4)))) (.cse10 (select .cse5 (+ v_~f~0.offset_220 (* .cse7 4))))) (let ((.cse20 (select .cse5 (+ v_~f~0.offset_220 (* .cse10 4)))) (.cse18 (select .cse5 (+ v_~f~0.offset_220 (* .cse12 4))))) (let ((.cse15 (select .cse5 (+ v_~f~0.offset_220 (* .cse18 4)))) (.cse9 (select .cse5 (+ v_~f~0.offset_220 (* .cse20 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_220 (* .cse9 4)))) (.cse13 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse15))))) (let ((.cse8 (select .cse5 (+ v_~f~0.offset_220 (* .cse13 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_220 (* .cse3 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_220 (* .cse1 4)))) (.cse16 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse8))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_220 (* .cse16 4)))) (.cse19 (select .cse5 (+ v_~f~0.offset_220 (* .cse4 4))))) (let ((.cse11 (select .cse5 (+ v_~f~0.offset_220 (* .cse19 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_220 (* .cse2 4))))) (let ((.cse21 (select .cse5 (+ v_~f~0.offset_220 (* .cse0 4)))) (.cse14 (select .cse5 (+ v_~f~0.offset_220 (* .cse11 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_220 (* .cse14 4)))) (.cse17 (select .cse5 (+ v_~f~0.offset_220 (* .cse21 4))))) (and (not (= (ite (and (< v_~x2~0_397 v_~size~0_226) (<= 0 v_~x2~0_397)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_226) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_226) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< v_~x1~0_430 v_~size~0_226) (<= 0 v_~x1~0_430)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_226)) 1 0))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_226)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_321| 11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse6 4))) v_~x2~0_395) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_226) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|) (= |v_thread2Thread1of1ForFork1_~i~1#1_358| 12) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_226)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_226)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite (and (< .cse6 v_~size~0_226) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse15 v_~size~0_226) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_226) (<= 0 .cse16)) 1 0) 0)) (= (ite (and (< .cse17 v_~size~0_226) (<= 0 .cse17)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|) (not (= (ite (and (< .cse18 v_~size~0_226) (<= 0 .cse18)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_226)) 1 0) 0)) (not (= 0 (ite (and (< .cse21 v_~size~0_226) (<= 0 .cse21)) 1 0))) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse17 4))) v_~x1~0_429) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_321| 4294967293) 4294967296) (* (mod v_~n~0_206 1073741824) 4))))))))))))))) InVars {~x2~0=v_~x2~0_397, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, #memory_int=|v_#memory_int_310|, ~n~0=v_~n~0_206, ~x1~0=v_~x1~0_430, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_395, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_250|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_172|, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_160|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_358|, ~x1~0=v_~x1~0_429, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_154|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_152|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_321|, #memory_int=|v_#memory_int_310|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_166|, ~n~0=v_~n~0_206, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_168|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_260|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [815] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_324| v_~f~0.base_228))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_228 (* v_~x2~0_421 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_228 (* .cse3 4))))) (let ((.cse0 (* (mod v_~n~0_214 1073741824) 4)) (.cse4 (select .cse1 (+ v_~f~0.offset_228 (* 4 .cse2))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_347| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_278| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_379| 4294967296) .cse0) (= v_~x1~0_454 (select .cse1 (+ v_~f~0.offset_228 (* v_~x1~0_455 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_234)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_421 v_~size~0_234) (<= 0 v_~x2~0_421)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_379| 4) |v_thread2Thread1of1ForFork1_~i~1#1_378|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_274| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_278|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_274| (ite (and (< v_~x1~0_455 v_~size~0_234) (<= 0 v_~x1~0_455)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|) (not (= (ite (and (< .cse3 v_~size~0_234) (<= 0 .cse3)) 1 0) 0)) (= v_~x2~0_420 (select .cse1 (+ v_~f~0.offset_228 (* .cse4 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_346| (+ |v_thread1Thread1of1ForFork0_~i~0#1_347| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| (ite (and (< .cse4 v_~size~0_234) (<= 0 .cse4)) 1 0))))))) InVars {~x2~0=v_~x2~0_421, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_228, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_347|, #memory_int=|v_#memory_int_324|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_379|, ~n~0=v_~n~0_214, ~x1~0=v_~x1~0_455, ~f~0.offset=v_~f~0.offset_228} OutVars{~x2~0=v_~x2~0_420, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_268|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_172|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_190|, ~size~0=v_~size~0_234, ~f~0.base=v_~f~0.base_228, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_178|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_378|, ~x1~0=v_~x1~0_454, ~f~0.offset=v_~f~0.offset_228, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_278|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_274|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_172|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_170|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_346|, #memory_int=|v_#memory_int_324|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_184|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_278|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_184|, ~n~0=v_~n~0_214, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_186|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_278|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:31,584 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:48:31,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4485 [2022-12-06 05:48:31,585 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 458 transitions, 9894 flow [2022-12-06 05:48:31,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 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 05:48:31,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:31,585 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:31,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 05:48:31,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:31,792 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 05:48:31,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1416216302, now seen corresponding path program 1 times [2022-12-06 05:48:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:31,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488613712] [2022-12-06 05:48:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:31,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:31,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488613712] [2022-12-06 05:48:31,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488613712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:31,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073778006] [2022-12-06 05:48:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:31,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:31,920 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 05:48:31,923 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 05:48:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:32,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:48:32,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:48:32,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:48:32,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073778006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:32,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:32,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-12-06 05:48:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003356603] [2022-12-06 05:48:32,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:32,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:48:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:48:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:48:32,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 05:48:32,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 458 transitions, 9894 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:32,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:32,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 05:48:32,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:33,497 INFO L130 PetriNetUnfolder]: 2548/4406 cut-off events. [2022-12-06 05:48:33,498 INFO L131 PetriNetUnfolder]: For 173821/173821 co-relation queries the response was YES. [2022-12-06 05:48:33,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49366 conditions, 4406 events. 2548/4406 cut-off events. For 173821/173821 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27602 event pairs, 1179 based on Foata normal form. 30/4433 useless extension candidates. Maximal degree in co-relation 46155. Up to 4085 conditions per place. [2022-12-06 05:48:33,538 INFO L137 encePairwiseOnDemand]: 36/57 looper letters, 393 selfloop transitions, 105 changer transitions 1/499 dead transitions. [2022-12-06 05:48:33,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 499 transitions, 11428 flow [2022-12-06 05:48:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:48:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:48:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-06 05:48:33,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13630229419703105 [2022-12-06 05:48:33,540 INFO L175 Difference]: Start difference. First operand has 197 places, 458 transitions, 9894 flow. Second operand 13 states and 101 transitions. [2022-12-06 05:48:33,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 499 transitions, 11428 flow [2022-12-06 05:48:33,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 499 transitions, 11237 flow, removed 77 selfloop flow, removed 5 redundant places. [2022-12-06 05:48:33,950 INFO L231 Difference]: Finished difference. Result has 207 places, 461 transitions, 10118 flow [2022-12-06 05:48:33,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=9725, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10118, PETRI_PLACES=207, PETRI_TRANSITIONS=461} [2022-12-06 05:48:33,950 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 186 predicate places. [2022-12-06 05:48:33,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:33,950 INFO L89 Accepts]: Start accepts. Operand has 207 places, 461 transitions, 10118 flow [2022-12-06 05:48:33,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:33,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:33,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 461 transitions, 10118 flow [2022-12-06 05:48:33,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 461 transitions, 10118 flow [2022-12-06 05:48:34,225 INFO L130 PetriNetUnfolder]: 451/1268 cut-off events. [2022-12-06 05:48:34,225 INFO L131 PetriNetUnfolder]: For 54750/55896 co-relation queries the response was YES. [2022-12-06 05:48:34,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14469 conditions, 1268 events. 451/1268 cut-off events. For 54750/55896 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9640 event pairs, 9 based on Foata normal form. 0/1247 useless extension candidates. Maximal degree in co-relation 13428. Up to 648 conditions per place. [2022-12-06 05:48:34,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 461 transitions, 10118 flow [2022-12-06 05:48:34,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-06 05:48:34,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:36,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_287| v_~f~0.base_200))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_200 (* v_~x1~0_372 4)))) (.cse0 (select .cse10 (+ v_~f~0.offset_200 (* v_~x2~0_353 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse0)))) (.cse9 (select .cse10 (+ v_~f~0.offset_200 (* .cse4 4))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse9)))) (.cse5 (select .cse10 (+ v_~f~0.offset_200 (* .cse6 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse5)))) (.cse12 (select .cse10 (+ v_~f~0.offset_200 (* .cse13 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_200 (* .cse12 4)))) (.cse14 (select .cse10 (+ v_~f~0.offset_200 (* .cse2 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_200 (* .cse14 4)))) (.cse3 (select .cse10 (+ v_~f~0.offset_200 (* .cse8 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_200 (* .cse3 4)))) (.cse11 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse1))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_285| 8) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_206)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_372 v_~size~0_206) (<= 0 v_~x1~0_372)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (not (= (ite (and (< .cse4 v_~size~0_206) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_324| 8) (not (= (ite (and (<= 0 v_~x2~0_353) (< v_~x2~0_353 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_206) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (not (= (ite (and (< .cse6 v_~size~0_206) (<= 0 .cse6)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_206) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_206)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 4294967295) 4294967296) (* (mod v_~n~0_186 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_206)) 1 0) 0)) (= v_~x1~0_371 (select .cse10 (+ v_~f~0.offset_200 (* .cse7 4)))) (= v_~x2~0_351 (select .cse10 (+ v_~f~0.offset_200 (* .cse11 4)))) (not (= (ite (and (< .cse12 v_~size~0_206) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_206) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| (ite (and (< .cse11 v_~size~0_206) (<= 0 .cse11)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_353, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, #memory_int=|v_#memory_int_287|, ~n~0=v_~n~0_186, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_200} OutVars{~x2~0=v_~x2~0_351, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_129|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_135|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_324|, ~x1~0=v_~x1~0_371, ~f~0.offset=v_~f~0.offset_200, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_129|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_127|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_287|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_141|, ~n~0=v_~n~0_186, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_143|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_224|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:37,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_287| v_~f~0.base_200))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_200 (* v_~x1~0_372 4)))) (.cse0 (select .cse10 (+ v_~f~0.offset_200 (* v_~x2~0_353 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse0)))) (.cse9 (select .cse10 (+ v_~f~0.offset_200 (* .cse4 4))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse9)))) (.cse5 (select .cse10 (+ v_~f~0.offset_200 (* .cse6 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse5)))) (.cse12 (select .cse10 (+ v_~f~0.offset_200 (* .cse13 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_200 (* .cse12 4)))) (.cse14 (select .cse10 (+ v_~f~0.offset_200 (* .cse2 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_200 (* .cse14 4)))) (.cse3 (select .cse10 (+ v_~f~0.offset_200 (* .cse8 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_200 (* .cse3 4)))) (.cse11 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse1))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_285| 8) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_206)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_372 v_~size~0_206) (<= 0 v_~x1~0_372)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (not (= (ite (and (< .cse4 v_~size~0_206) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_324| 8) (not (= (ite (and (<= 0 v_~x2~0_353) (< v_~x2~0_353 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_206) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (not (= (ite (and (< .cse6 v_~size~0_206) (<= 0 .cse6)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_206) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_206)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 4294967295) 4294967296) (* (mod v_~n~0_186 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_206)) 1 0) 0)) (= v_~x1~0_371 (select .cse10 (+ v_~f~0.offset_200 (* .cse7 4)))) (= v_~x2~0_351 (select .cse10 (+ v_~f~0.offset_200 (* .cse11 4)))) (not (= (ite (and (< .cse12 v_~size~0_206) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_206) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| (ite (and (< .cse11 v_~size~0_206) (<= 0 .cse11)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_353, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, #memory_int=|v_#memory_int_287|, ~n~0=v_~n~0_186, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_200} OutVars{~x2~0=v_~x2~0_351, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_129|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_135|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_324|, ~x1~0=v_~x1~0_371, ~f~0.offset=v_~f~0.offset_200, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_129|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_127|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_287|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_141|, ~n~0=v_~n~0_186, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_143|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_224|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [824] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_337| v_~f~0.base_238))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_238 (* v_~x1~0_490 4)))) (.cse1 (* (mod v_~n~0_224 1073741824) 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| (ite (and (< .cse0 v_~size~0_244) (<= 0 .cse0)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_379| 1) 4294967296) .cse1) (= |v_thread1Thread1of1ForFork0_~i~0#1_377| (+ |v_thread1Thread1of1ForFork0_~i~0#1_379| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|) (= (select .cse2 (+ v_~f~0.offset_238 (* .cse0 4))) v_~x1~0_488) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_379| 4294967296) .cse1) (not (= (ite (and (< v_~x1~0_490 v_~size~0_244) (<= 0 v_~x1~0_490)) 1 0) 0))))) InVars {~size~0=v_~size~0_244, ~f~0.base=v_~f~0.base_238, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_379|, #memory_int=|v_#memory_int_337|, ~n~0=v_~n~0_224, ~x1~0=v_~x1~0_490, ~f~0.offset=v_~f~0.offset_238} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_291|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297|, ~size~0=v_~size~0_244, ~f~0.base=v_~f~0.base_238, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_377|, #memory_int=|v_#memory_int_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|, ~n~0=v_~n~0_224, ~x1~0=v_~x1~0_488, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_301|, ~f~0.offset=v_~f~0.offset_238} 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 05:48:39,216 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_287| v_~f~0.base_200))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_200 (* v_~x1~0_372 4)))) (.cse0 (select .cse10 (+ v_~f~0.offset_200 (* v_~x2~0_353 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse0)))) (.cse9 (select .cse10 (+ v_~f~0.offset_200 (* .cse4 4))))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse9)))) (.cse5 (select .cse10 (+ v_~f~0.offset_200 (* .cse6 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse5)))) (.cse12 (select .cse10 (+ v_~f~0.offset_200 (* .cse13 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_200 (* .cse12 4)))) (.cse14 (select .cse10 (+ v_~f~0.offset_200 (* .cse2 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_200 (* .cse14 4)))) (.cse3 (select .cse10 (+ v_~f~0.offset_200 (* .cse8 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_200 (* .cse3 4)))) (.cse11 (select .cse10 (+ v_~f~0.offset_200 (* 4 .cse1))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_285| 8) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_206)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_372 v_~size~0_206) (<= 0 v_~x1~0_372)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (not (= (ite (and (< .cse4 v_~size~0_206) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_324| 8) (not (= (ite (and (<= 0 v_~x2~0_353) (< v_~x2~0_353 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_206) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (not (= (ite (and (< .cse6 v_~size~0_206) (<= 0 .cse6)) 1 0) 0)) (= (ite (and (< .cse7 v_~size~0_206) (<= 0 .cse7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_206)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_285| 4294967295) 4294967296) (* (mod v_~n~0_186 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_206)) 1 0) 0)) (= v_~x1~0_371 (select .cse10 (+ v_~f~0.offset_200 (* .cse7 4)))) (= v_~x2~0_351 (select .cse10 (+ v_~f~0.offset_200 (* .cse11 4)))) (not (= (ite (and (< .cse12 v_~size~0_206) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_206)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_206) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195| (ite (and (< .cse11 v_~size~0_206) (<= 0 .cse11)) 1 0))))))))))) InVars {~x2~0=v_~x2~0_353, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, #memory_int=|v_#memory_int_287|, ~n~0=v_~n~0_186, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_200} OutVars{~x2~0=v_~x2~0_351, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_214|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_129|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_200, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_135|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_324|, ~x1~0=v_~x1~0_371, ~f~0.offset=v_~f~0.offset_200, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_129|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_127|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_285|, #memory_int=|v_#memory_int_287|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_141|, ~n~0=v_~n~0_186, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_143|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_224|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [825] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_339| v_~f~0.base_240))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_240 (* v_~x2~0_440 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_240 (* .cse2 4))))) (let ((.cse0 (* 4 (mod v_~n~0_226 1073741824))) (.cse4 (select .cse3 (+ v_~f~0.offset_240 (* .cse1 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_384| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| (ite (and (<= 0 v_~x1~0_495) (< v_~x1~0_495 v_~size~0_246)) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_384| 1) |v_thread1Thread1of1ForFork0_~i~0#1_383|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|) (= |v_thread2Thread1of1ForFork1_~i~1#1_394| (+ |v_thread2Thread1of1ForFork1_~i~1#1_395| 4)) (not (= (ite (and (<= 0 v_~x2~0_440) (< v_~x2~0_440 v_~size~0_246)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_246)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_395| 4294967296) .cse0) (not (= (ite (and (< .cse2 v_~size~0_246) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_439 (select .cse3 (+ v_~f~0.offset_240 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250| (ite (and (< .cse4 v_~size~0_246) (<= 0 .cse4)) 1 0)) (= v_~x1~0_494 (select .cse3 (+ v_~f~0.offset_240 (* v_~x1~0_495 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|)))))) InVars {~x2~0=v_~x2~0_440, ~size~0=v_~size~0_246, ~f~0.base=v_~f~0.base_240, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_384|, #memory_int=|v_#memory_int_339|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_395|, ~n~0=v_~n~0_226, ~x1~0=v_~x1~0_495, ~f~0.offset=v_~f~0.offset_240} OutVars{~x2~0=v_~x2~0_439, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_295|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_184|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_202|, ~size~0=v_~size~0_246, ~f~0.base=v_~f~0.base_240, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_190|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_394|, ~x1~0=v_~x1~0_494, ~f~0.offset=v_~f~0.offset_240, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_184|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_182|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, #memory_int=|v_#memory_int_339|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_196|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_305|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_196|, ~n~0=v_~n~0_226, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_198|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_305|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:41,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [784] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_277| v_~f~0.base_190))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_190 (* v_~x1~0_348 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse6))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_190 (* .cse9 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_190 (* .cse4 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse3))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_190 (* v_~x2~0_336 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_190 (* .cse5 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_190 (* .cse7 4)))) (.cse10 (select .cse0 (+ v_~f~0.offset_190 (* .cse8 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_190 (* .cse10 4)))) (.cse2 (select .cse0 (+ (* 4 .cse11) v_~f~0.offset_190)))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_306| 4) (= (select .cse0 (+ (* 4 .cse1) v_~f~0.offset_190)) v_~x2~0_335) (not (= (ite (and (< v_~x1~0_348 v_~size~0_196) (<= 0 v_~x1~0_348)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_196)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_196)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_196)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_187| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_196)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_196) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_196)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (not (= (ite (and (< .cse7 v_~size~0_196) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_196)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_271| 9) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_187| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227|) (= (select .cse0 (+ v_~f~0.offset_190 (* .cse2 4))) v_~x1~0_347) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_196)) 1 0))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_271| 4294967295) 4294967296) (* (mod v_~n~0_176 1073741824) 4)) (not (= (ite (and (< .cse10 v_~size~0_196) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_196)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_336 v_~size~0_196) (<= 0 v_~x2~0_336)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_336, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_190, #memory_int=|v_#memory_int_277|, ~n~0=v_~n~0_176, ~x1~0=v_~x1~0_348, ~f~0.offset=v_~f~0.offset_190} OutVars{~x2~0=v_~x2~0_335, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_200|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_121|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_139|, ~size~0=v_~size~0_196, ~f~0.base=v_~f~0.base_190, 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_187|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_306|, ~x1~0=v_~x1~0_347, ~f~0.offset=v_~f~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_227|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_206|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_121|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_119|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_271|, #memory_int=|v_#memory_int_277|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_133|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_133|, ~n~0=v_~n~0_176, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_135|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_210|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:43,929 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:48:43,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9979 [2022-12-06 05:48:43,929 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 460 transitions, 10230 flow [2022-12-06 05:48:43,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:43,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:43,930 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:43,935 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 05:48:44,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:44,130 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 05:48:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1229519749, now seen corresponding path program 1 times [2022-12-06 05:48:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:44,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822520603] [2022-12-06 05:48:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:44,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822520603] [2022-12-06 05:48:44,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822520603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:44,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455276157] [2022-12-06 05:48:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:44,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:44,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:44,264 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 05:48:44,266 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 05:48:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:44,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:48:44,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:44,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:44,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455276157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:44,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:44,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 05:48:44,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386505725] [2022-12-06 05:48:44,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:44,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:48:44,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:44,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:48:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:48:44,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 05:48:44,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 460 transitions, 10230 flow. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:44,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:44,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 05:48:44,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:47,186 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 05:48:48,699 INFO L130 PetriNetUnfolder]: 2898/5050 cut-off events. [2022-12-06 05:48:48,699 INFO L131 PetriNetUnfolder]: For 216638/216638 co-relation queries the response was YES. [2022-12-06 05:48:48,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58769 conditions, 5050 events. 2898/5050 cut-off events. For 216638/216638 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33172 event pairs, 627 based on Foata normal form. 84/5131 useless extension candidates. Maximal degree in co-relation 55009. Up to 2899 conditions per place. [2022-12-06 05:48:48,748 INFO L137 encePairwiseOnDemand]: 20/63 looper letters, 351 selfloop transitions, 355 changer transitions 4/710 dead transitions. [2022-12-06 05:48:48,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 710 transitions, 17830 flow [2022-12-06 05:48:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:48:48,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:48:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 133 transitions. [2022-12-06 05:48:48,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11728395061728394 [2022-12-06 05:48:48,749 INFO L175 Difference]: Start difference. First operand has 205 places, 460 transitions, 10230 flow. Second operand 18 states and 133 transitions. [2022-12-06 05:48:48,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 710 transitions, 17830 flow [2022-12-06 05:48:49,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 710 transitions, 17500 flow, removed 119 selfloop flow, removed 2 redundant places. [2022-12-06 05:48:49,389 INFO L231 Difference]: Finished difference. Result has 227 places, 620 transitions, 15084 flow [2022-12-06 05:48:49,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=9919, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=15084, PETRI_PLACES=227, PETRI_TRANSITIONS=620} [2022-12-06 05:48:49,389 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2022-12-06 05:48:49,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:49,389 INFO L89 Accepts]: Start accepts. Operand has 227 places, 620 transitions, 15084 flow [2022-12-06 05:48:49,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:49,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:49,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 620 transitions, 15084 flow [2022-12-06 05:48:49,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 620 transitions, 15084 flow [2022-12-06 05:48:49,733 INFO L130 PetriNetUnfolder]: 701/1783 cut-off events. [2022-12-06 05:48:49,733 INFO L131 PetriNetUnfolder]: For 88745/89440 co-relation queries the response was YES. [2022-12-06 05:48:49,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22978 conditions, 1783 events. 701/1783 cut-off events. For 88745/89440 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13725 event pairs, 24 based on Foata normal form. 3/1748 useless extension candidates. Maximal degree in co-relation 22211. Up to 989 conditions per place. [2022-12-06 05:48:49,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 620 transitions, 15084 flow [2022-12-06 05:48:49,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 1708 [2022-12-06 05:48:51,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,463 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:51,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,492 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:52,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:53,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,482 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:54,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,263 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:48:55,733 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:48:55,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6345 [2022-12-06 05:48:55,734 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 620 transitions, 16760 flow [2022-12-06 05:48:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:55,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:55,734 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:55,739 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 05:48:55,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:55,935 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 05:48:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash -518979359, now seen corresponding path program 1 times [2022-12-06 05:48:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:55,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618697123] [2022-12-06 05:48:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:48:56,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:56,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618697123] [2022-12-06 05:48:56,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618697123] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:56,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910260877] [2022-12-06 05:48:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:56,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:56,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:56,004 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 05:48:56,005 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 05:48:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:56,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:48:56,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:48:56,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-06 05:48:56,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910260877] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:56,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:56,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:48:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603909768] [2022-12-06 05:48:56,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:56,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:48:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:48:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:48:56,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 05:48:56,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 620 transitions, 16760 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:56,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:56,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 05:48:56,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:58,205 INFO L130 PetriNetUnfolder]: 2856/4961 cut-off events. [2022-12-06 05:48:58,205 INFO L131 PetriNetUnfolder]: For 270056/270056 co-relation queries the response was YES. [2022-12-06 05:48:58,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63810 conditions, 4961 events. 2856/4961 cut-off events. For 270056/270056 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 32251 event pairs, 1017 based on Foata normal form. 18/4976 useless extension candidates. Maximal degree in co-relation 61577. Up to 4291 conditions per place. [2022-12-06 05:48:58,261 INFO L137 encePairwiseOnDemand]: 80/110 looper letters, 549 selfloop transitions, 114 changer transitions 6/669 dead transitions. [2022-12-06 05:48:58,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 669 transitions, 18932 flow [2022-12-06 05:48:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:48:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:48:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-06 05:48:58,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2106060606060606 [2022-12-06 05:48:58,262 INFO L175 Difference]: Start difference. First operand has 224 places, 620 transitions, 16760 flow. Second operand 6 states and 139 transitions. [2022-12-06 05:48:58,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 669 transitions, 18932 flow [2022-12-06 05:48:59,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 669 transitions, 17871 flow, removed 313 selfloop flow, removed 9 redundant places. [2022-12-06 05:48:59,071 INFO L231 Difference]: Finished difference. Result has 223 places, 620 transitions, 16095 flow [2022-12-06 05:48:59,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15723, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16095, PETRI_PLACES=223, PETRI_TRANSITIONS=620} [2022-12-06 05:48:59,072 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2022-12-06 05:48:59,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:59,072 INFO L89 Accepts]: Start accepts. Operand has 223 places, 620 transitions, 16095 flow [2022-12-06 05:48:59,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:59,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:59,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 620 transitions, 16095 flow [2022-12-06 05:48:59,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 620 transitions, 16095 flow [2022-12-06 05:48:59,417 INFO L130 PetriNetUnfolder]: 689/1714 cut-off events. [2022-12-06 05:48:59,417 INFO L131 PetriNetUnfolder]: For 85742/86427 co-relation queries the response was YES. [2022-12-06 05:48:59,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22281 conditions, 1714 events. 689/1714 cut-off events. For 85742/86427 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 12851 event pairs, 26 based on Foata normal form. 3/1682 useless extension candidates. Maximal degree in co-relation 21780. Up to 980 conditions per place. [2022-12-06 05:48:59,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 620 transitions, 16095 flow [2022-12-06 05:48:59,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 1718 [2022-12-06 05:48:59,443 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:48:59,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 372 [2022-12-06 05:48:59,444 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 620 transitions, 16095 flow [2022-12-06 05:48:59,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:59,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:59,444 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:59,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 05:48:59,644 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,SelfDestructingSolverStorable34 [2022-12-06 05:48:59,645 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 05:48:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash 823000551, now seen corresponding path program 1 times [2022-12-06 05:48:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:59,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917767784] [2022-12-06 05:48:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:19,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917767784] [2022-12-06 05:49:19,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917767784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:19,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082660266] [2022-12-06 05:49:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:19,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:19,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:19,481 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 05:49:19,483 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 05:49:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:19,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 102 conjunts are in the unsatisfiable core [2022-12-06 05:49:19,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:19,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:49:19,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:49:19,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:49:19,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:49:21,472 INFO L321 Elim1Store]: treesize reduction 910, result has 5.3 percent of original size [2022-12-06 05:49:21,472 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 31 new quantified variables, introduced 120 case distinctions, treesize of input 381 treesize of output 150 [2022-12-06 05:49:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:49:21,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:49:36,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082660266] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:36,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:36,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 18 [2022-12-06 05:49:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060736811] [2022-12-06 05:49:36,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:36,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 05:49:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:36,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 05:49:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=296, Unknown=1, NotChecked=0, Total=380 [2022-12-06 05:49:36,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 05:49:36,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 620 transitions, 16095 flow. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:36,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:36,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 05:49:36,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:11,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:50:20,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:50:23,366 INFO L130 PetriNetUnfolder]: 3029/5209 cut-off events. [2022-12-06 05:50:23,366 INFO L131 PetriNetUnfolder]: For 269418/269418 co-relation queries the response was YES. [2022-12-06 05:50:23,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66382 conditions, 5209 events. 3029/5209 cut-off events. For 269418/269418 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 33481 event pairs, 218 based on Foata normal form. 4/5210 useless extension candidates. Maximal degree in co-relation 64231. Up to 2535 conditions per place. [2022-12-06 05:50:23,416 INFO L137 encePairwiseOnDemand]: 30/110 looper letters, 331 selfloop transitions, 388 changer transitions 12/731 dead transitions. [2022-12-06 05:50:23,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 731 transitions, 19692 flow [2022-12-06 05:50:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:50:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:50:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2022-12-06 05:50:23,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15289256198347106 [2022-12-06 05:50:23,419 INFO L175 Difference]: Start difference. First operand has 222 places, 620 transitions, 16095 flow. Second operand 11 states and 185 transitions. [2022-12-06 05:50:23,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 731 transitions, 19692 flow [2022-12-06 05:50:24,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 731 transitions, 19527 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-06 05:50:24,104 INFO L231 Difference]: Finished difference. Result has 237 places, 652 transitions, 18460 flow [2022-12-06 05:50:24,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15936, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18460, PETRI_PLACES=237, PETRI_TRANSITIONS=652} [2022-12-06 05:50:24,104 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 216 predicate places. [2022-12-06 05:50:24,105 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:24,105 INFO L89 Accepts]: Start accepts. Operand has 237 places, 652 transitions, 18460 flow [2022-12-06 05:50:24,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:24,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:24,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 652 transitions, 18460 flow [2022-12-06 05:50:24,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 652 transitions, 18460 flow [2022-12-06 05:50:24,525 INFO L130 PetriNetUnfolder]: 738/1852 cut-off events. [2022-12-06 05:50:24,525 INFO L131 PetriNetUnfolder]: For 99438/100177 co-relation queries the response was YES. [2022-12-06 05:50:24,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25129 conditions, 1852 events. 738/1852 cut-off events. For 99438/100177 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14215 event pairs, 31 based on Foata normal form. 4/1815 useless extension candidates. Maximal degree in co-relation 24513. Up to 1043 conditions per place. [2022-12-06 05:50:24,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 652 transitions, 18460 flow [2022-12-06 05:50:24,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 1854 [2022-12-06 05:50:24,556 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:50:24,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 452 [2022-12-06 05:50:24,557 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 652 transitions, 18460 flow [2022-12-06 05:50:24,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:24,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:24,557 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:24,563 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 05:50:24,758 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,SelfDestructingSolverStorable35 [2022-12-06 05:50:24,758 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 05:50:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash -301465588, now seen corresponding path program 1 times [2022-12-06 05:50:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210453496] [2022-12-06 05:50:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:24,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:24,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210453496] [2022-12-06 05:50:24,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210453496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:24,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727787710] [2022-12-06 05:50:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:24,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:24,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:24,875 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 05:50:24,876 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 05:50:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:24,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:50:24,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:25,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:25,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727787710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:25,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:25,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 05:50:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788436457] [2022-12-06 05:50:25,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:25,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:50:25,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:25,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:50:25,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:50:25,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 05:50:25,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 652 transitions, 18460 flow. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:25,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:25,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 05:50:25,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:28,337 INFO L130 PetriNetUnfolder]: 3349/5870 cut-off events. [2022-12-06 05:50:28,338 INFO L131 PetriNetUnfolder]: For 342511/342511 co-relation queries the response was YES. [2022-12-06 05:50:28,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77494 conditions, 5870 events. 3349/5870 cut-off events. For 342511/342511 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 39740 event pairs, 792 based on Foata normal form. 6/5873 useless extension candidates. Maximal degree in co-relation 75364. Up to 3367 conditions per place. [2022-12-06 05:50:28,393 INFO L137 encePairwiseOnDemand]: 77/110 looper letters, 640 selfloop transitions, 166 changer transitions 40/846 dead transitions. [2022-12-06 05:50:28,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 846 transitions, 24888 flow [2022-12-06 05:50:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:50:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:50:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 175 transitions. [2022-12-06 05:50:28,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09943181818181818 [2022-12-06 05:50:28,394 INFO L175 Difference]: Start difference. First operand has 237 places, 652 transitions, 18460 flow. Second operand 16 states and 175 transitions. [2022-12-06 05:50:28,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 846 transitions, 24888 flow [2022-12-06 05:50:29,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 846 transitions, 24447 flow, removed 203 selfloop flow, removed 2 redundant places. [2022-12-06 05:50:29,280 INFO L231 Difference]: Finished difference. Result has 258 places, 683 transitions, 19583 flow [2022-12-06 05:50:29,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=18169, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=19583, PETRI_PLACES=258, PETRI_TRANSITIONS=683} [2022-12-06 05:50:29,281 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 237 predicate places. [2022-12-06 05:50:29,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:29,281 INFO L89 Accepts]: Start accepts. Operand has 258 places, 683 transitions, 19583 flow [2022-12-06 05:50:29,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:29,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:29,286 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 258 places, 683 transitions, 19583 flow [2022-12-06 05:50:29,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 683 transitions, 19583 flow [2022-12-06 05:50:29,708 INFO L130 PetriNetUnfolder]: 772/2043 cut-off events. [2022-12-06 05:50:29,708 INFO L131 PetriNetUnfolder]: For 118291/119091 co-relation queries the response was YES. [2022-12-06 05:50:29,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28363 conditions, 2043 events. 772/2043 cut-off events. For 118291/119091 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16625 event pairs, 29 based on Foata normal form. 0/2000 useless extension candidates. Maximal degree in co-relation 27950. Up to 1096 conditions per place. [2022-12-06 05:50:29,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 683 transitions, 19583 flow [2022-12-06 05:50:29,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 1888 [2022-12-06 05:50:29,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [829] $Ultimate##0-->L49-2: Formula: (let ((.cse8 (select |v_#memory_int_345| v_~f~0.base_246))) (let ((.cse11 (select .cse8 (+ v_~f~0.offset_246 (* v_~x1~0_510 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_246 (* .cse11 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_246 (* .cse7 4)))) (.cse1 (select .cse8 (+ v_~f~0.offset_246 (* v_~x2~0_454 4))))) (let ((.cse15 (select .cse8 (+ v_~f~0.offset_246 (* .cse1 4)))) (.cse16 (select .cse8 (+ v_~f~0.offset_246 (* .cse9 4))))) (let ((.cse13 (select .cse8 (+ v_~f~0.offset_246 (* .cse16 4)))) (.cse14 (select .cse8 (+ v_~f~0.offset_246 (* .cse15 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_246 (* .cse14 4)))) (.cse3 (select .cse8 (+ v_~f~0.offset_246 (* .cse13 4))))) (let ((.cse12 (select .cse8 (+ v_~f~0.offset_246 (* .cse3 4)))) (.cse10 (select .cse8 (+ v_~f~0.offset_246 (* .cse4 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_246 (* .cse10 4)))) (.cse5 (select .cse8 (+ v_~f~0.offset_246 (* 4 .cse12))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_246 (* .cse5 4)))) (.cse6 (select .cse8 (+ v_~f~0.offset_246 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_298|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_309| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_252)) 1 0)) (not (= (ite (and (< .cse1 v_~size~0_252) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_510 v_~size~0_252) (<= 0 v_~x1~0_510)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_252) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_252)) 1 0) 0)) (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_252)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258|) (not (= (ite (and (< .cse7 v_~size~0_252) (<= 0 .cse7)) 1 0) 0)) (= v_~x1~0_508 (select .cse8 (+ v_~f~0.offset_246 (* .cse0 4)))) (not (= (ite (and (< .cse9 v_~size~0_252) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_252) (<= 0 .cse10)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_309| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313|) (not (= (ite (and (< .cse11 v_~size~0_252) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_252)) 1 0) 0)) (< 9 (* (mod v_~n~0_232 1073741824) 4)) (= (select .cse8 (+ v_~f~0.offset_246 (* .cse6 4))) v_~x2~0_453) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_298| 0)) (not (= (ite (and (< .cse13 v_~size~0_252) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_252)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_454) (< v_~x2~0_454 v_~size~0_252)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_404| 8) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_252)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_393| 10)))))))))))) InVars {~x2~0=v_~x2~0_454, ~size~0=v_~size~0_252, ~f~0.base=v_~f~0.base_246, #memory_int=|v_#memory_int_345|, ~n~0=v_~n~0_232, ~x1~0=v_~x1~0_510, ~f~0.offset=v_~f~0.offset_246} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_303|, ~x2~0=v_~x2~0_453, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_192|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_210|, ~size~0=v_~size~0_252, ~f~0.base=v_~f~0.base_246, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_198|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_404|, ~x1~0=v_~x1~0_508, ~f~0.offset=v_~f~0.offset_246, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_298|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_309|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_192|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_190|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_393|, #memory_int=|v_#memory_int_345|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_204|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_204|, ~n~0=v_~n~0_232, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_313|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_206|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:33,089 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:33,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:33,449 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:33,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:33,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:34,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_3| 4294967296) (* (mod v_~n~0_In_9 1073741824) 4))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:36,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [890] $Ultimate##0-->L59-2: Formula: (let ((.cse13 (select |v_#memory_int_458| v_~f~0.base_356))) (let ((.cse14 (select .cse13 (+ v_~f~0.offset_356 (* v_~x2~0_492 4))))) (let ((.cse20 (select .cse13 (+ v_~f~0.offset_356 (* .cse14 4))))) (let ((.cse6 (select .cse13 (+ v_~f~0.offset_356 (* v_~x1~0_759 4)))) (.cse12 (select .cse13 (+ v_~f~0.offset_356 (* 4 .cse20))))) (let ((.cse2 (select .cse13 (+ v_~f~0.offset_356 (* 4 .cse12)))) (.cse1 (select .cse13 (+ v_~f~0.offset_356 (* .cse6 4))))) (let ((.cse4 (select .cse13 (+ v_~f~0.offset_356 (* .cse1 4)))) (.cse9 (select .cse13 (+ (* 4 .cse2) v_~f~0.offset_356)))) (let ((.cse19 (select .cse13 (+ v_~f~0.offset_356 (* .cse9 4)))) (.cse11 (select .cse13 (+ v_~f~0.offset_356 (* .cse4 4))))) (let ((.cse7 (select .cse13 (+ v_~f~0.offset_356 (* .cse11 4)))) (.cse8 (select .cse13 (+ v_~f~0.offset_356 (* 4 .cse19))))) (let ((.cse3 (select .cse13 (+ v_~f~0.offset_356 (* .cse8 4)))) (.cse10 (select .cse13 (+ v_~f~0.offset_356 (* .cse7 4))))) (let ((.cse15 (select .cse13 (+ v_~f~0.offset_356 (* .cse10 4)))) (.cse16 (select .cse13 (+ v_~f~0.offset_356 (* 4 .cse3))))) (let ((.cse17 (select .cse13 (+ v_~f~0.offset_356 (* .cse16 4)))) (.cse18 (select .cse13 (+ v_~f~0.offset_356 (* .cse15 4))))) (let ((.cse0 (select .cse13 (+ v_~f~0.offset_356 (* 4 .cse18)))) (.cse5 (select .cse13 (+ v_~f~0.offset_356 (* .cse17 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_445| (ite (and (< .cse0 v_~size~0_362) (<= 0 .cse0)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_445| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_449|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_362) (<= 0 .cse2)) 1 0) 0)) (< 9 (* (mod v_~n~0_342 1073741824) 4)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323| 0)) (not (= (ite (and (< .cse3 v_~size~0_362) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_759 v_~size~0_362) (<= 0 v_~x1~0_759)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_283| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_362)) 1 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_362)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_283| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|) (not (= 0 (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_362)) 1 0))) (not (= (ite (and (< .cse11 v_~size~0_362) (<= 0 .cse11)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_449| 0)) (not (= (ite (and (< v_~x2~0_492 v_~size~0_362) (<= 0 v_~x2~0_492)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_362) (<= 0 .cse12)) 1 0) 0)) (= (select .cse13 (+ v_~f~0.offset_356 (* 4 .cse0))) v_~x1~0_758) (= |v_thread2Thread1of1ForFork1_~i~1#1_528| 12) (not (= (ite (and (< .cse14 v_~size~0_362) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_362)) 1 0) 0)) (= (select .cse13 (+ v_~f~0.offset_356 (* .cse5 4))) v_~x2~0_490) (not (= (ite (and (< .cse16 v_~size~0_362) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (< .cse17 v_~size~0_362) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_362)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_362) (<= 0 .cse20)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_631| 10)))))))))))))) InVars {~x2~0=v_~x2~0_492, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_356, #memory_int=|v_#memory_int_458|, ~n~0=v_~n~0_342, ~x1~0=v_~x1~0_759, ~f~0.offset=v_~f~0.offset_356} OutVars{~x2~0=v_~x2~0_490, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_439|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_217|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_235|, ~size~0=v_~size~0_362, ~f~0.base=v_~f~0.base_356, 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_283|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_528|, ~x1~0=v_~x1~0_758, ~f~0.offset=v_~f~0.offset_356, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_445|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_217|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_215|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_631|, #memory_int=|v_#memory_int_458|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_229|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_449|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_229|, ~n~0=v_~n~0_342, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_231|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_449|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:50:39,184 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:50:39,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9904 [2022-12-06 05:50:39,185 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 683 transitions, 19755 flow [2022-12-06 05:50:39,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:39,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:39,185 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:39,192 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 05:50:39,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 05:50:39,390 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 05:50:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash -14765233, now seen corresponding path program 1 times [2022-12-06 05:50:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:39,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873017696] [2022-12-06 05:50:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:39,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:39,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873017696] [2022-12-06 05:50:39,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873017696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:39,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164675949] [2022-12-06 05:50:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:39,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:39,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:39,502 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 05:50:39,503 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 05:50:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:39,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:50:39,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:39,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:50:39,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164675949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:39,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:39,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-12-06 05:50:39,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44861068] [2022-12-06 05:50:39,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:39,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:50:39,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:39,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:50:39,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-06 05:50:39,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 120 [2022-12-06 05:50:39,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 683 transitions, 19755 flow. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:39,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:39,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 120 [2022-12-06 05:50:39,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:47,982 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 05:50:50,645 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 05:50:53,011 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 05:50:55,960 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 05:50:58,098 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 05:51:00,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:03,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:05,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:07,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:10,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:15,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:17,672 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 05:51:20,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 05:51:27,541 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 05:51:31,207 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 05:51:33,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:38,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:42,692 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 05:51:45,924 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 05:51:49,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:53,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:58,525 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 05:52:03,678 INFO L130 PetriNetUnfolder]: 5034/9086 cut-off events. [2022-12-06 05:52:03,679 INFO L131 PetriNetUnfolder]: For 536443/536443 co-relation queries the response was YES. [2022-12-06 05:52:03,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121617 conditions, 9086 events. 5034/9086 cut-off events. For 536443/536443 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 66014 event pairs, 304 based on Foata normal form. 516/9599 useless extension candidates. Maximal degree in co-relation 120130. Up to 4249 conditions per place. [2022-12-06 05:52:03,777 INFO L137 encePairwiseOnDemand]: 12/120 looper letters, 522 selfloop transitions, 739 changer transitions 55/1316 dead transitions. [2022-12-06 05:52:03,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1316 transitions, 38931 flow [2022-12-06 05:52:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 05:52:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 05:52:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 356 transitions. [2022-12-06 05:52:03,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.06899224806201551 [2022-12-06 05:52:03,779 INFO L175 Difference]: Start difference. First operand has 255 places, 683 transitions, 19755 flow. Second operand 43 states and 356 transitions. [2022-12-06 05:52:03,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 1316 transitions, 38931 flow [2022-12-06 05:52:05,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 1316 transitions, 38383 flow, removed 268 selfloop flow, removed 4 redundant places. [2022-12-06 05:52:05,823 INFO L231 Difference]: Finished difference. Result has 309 places, 890 transitions, 27583 flow [2022-12-06 05:52:05,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=19449, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=529, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=27583, PETRI_PLACES=309, PETRI_TRANSITIONS=890} [2022-12-06 05:52:05,824 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 288 predicate places. [2022-12-06 05:52:05,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:05,824 INFO L89 Accepts]: Start accepts. Operand has 309 places, 890 transitions, 27583 flow [2022-12-06 05:52:05,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:05,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:05,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 309 places, 890 transitions, 27583 flow [2022-12-06 05:52:05,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 890 transitions, 27583 flow [2022-12-06 05:52:06,692 INFO L130 PetriNetUnfolder]: 1121/3110 cut-off events. [2022-12-06 05:52:06,692 INFO L131 PetriNetUnfolder]: For 205945/207282 co-relation queries the response was YES. [2022-12-06 05:52:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46552 conditions, 3110 events. 1121/3110 cut-off events. For 205945/207282 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 27285 event pairs, 62 based on Foata normal form. 0/3049 useless extension candidates. Maximal degree in co-relation 46399. Up to 1708 conditions per place. [2022-12-06 05:52:06,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 300 places, 890 transitions, 27583 flow [2022-12-06 05:52:06,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 2470 [2022-12-06 05:52:08,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [837] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_353| v_~f~0.base_254))) (let ((.cse14 (select .cse0 (+ v_~f~0.offset_254 (* v_~x1~0_531 4))))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_254 (* .cse14 4)))) (.cse15 (select .cse0 (+ v_~f~0.offset_254 (* v_~x2~0_475 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_254 (* .cse15 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_254 (* .cse13 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_254 (* .cse3 4)))) (.cse10 (select .cse0 (+ v_~f~0.offset_254 (* .cse5 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_254 (* 4 .cse10)))) (.cse9 (select .cse0 (+ v_~f~0.offset_254 (* .cse2 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_254 (* .cse9 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_254 (* .cse8 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_254 (* .cse6 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_254 (* .cse11 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_254 (* .cse4 4)))) (.cse12 (select .cse0 (+ v_~f~0.offset_254 (* 4 .cse7))))) (and (= (select .cse0 (+ v_~f~0.offset_254 (* .cse1 4))) v_~x1~0_530) (= (ite (and (< .cse1 v_~size~0_260) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_323|) (not (= (ite (and (< .cse2 v_~size~0_260) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_260) (<= 0 .cse3)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_260)) 1 0))) (not (= (ite (and (<= 0 v_~x2~0_475) (< v_~x2~0_475 v_~size~0_260)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_323| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_327|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_270| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|) (not (= (ite (and (< .cse5 v_~size~0_260) (<= 0 .cse5)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_260)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310| 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_260)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_531 v_~size~0_260) (<= 0 v_~x1~0_531)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_407| 4294967295) 4294967296) (* 4 (mod v_~n~0_240 1073741824))) (not (= (ite (and (< .cse8 v_~size~0_260) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_260) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_416| 8) (not (= (ite (and (< .cse10 v_~size~0_260) (<= 0 .cse10)) 1 0) 0)) (not (= 0 (ite (and (< .cse11 v_~size~0_260) (<= 0 .cse11)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_270| (ite (and (< .cse12 v_~size~0_260) (<= 0 .cse12)) 1 0)) (not (= (ite (and (< .cse13 v_~size~0_260) (<= 0 .cse13)) 1 0) 0)) (= v_~x2~0_473 (select .cse0 (+ v_~f~0.offset_254 (* .cse12 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_407| 9) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_260)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_260) (<= 0 .cse15)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_327| 0)))))))))))) InVars {~x2~0=v_~x2~0_475, ~size~0=v_~size~0_260, ~f~0.base=v_~f~0.base_254, #memory_int=|v_#memory_int_353|, ~n~0=v_~n~0_240, ~x1~0=v_~x1~0_531, ~f~0.offset=v_~f~0.offset_254} OutVars{~x2~0=v_~x2~0_473, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_317|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_204|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_222|, ~size~0=v_~size~0_260, ~f~0.base=v_~f~0.base_254, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_210|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_270|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_416|, ~x1~0=v_~x1~0_530, ~f~0.offset=v_~f~0.offset_254, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_323|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_204|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_202|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_407|, #memory_int=|v_#memory_int_353|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_216|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_327|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_216|, ~n~0=v_~n~0_240, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_218|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_327|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:52:13,610 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:52:13,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7787 [2022-12-06 05:52:13,611 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 890 transitions, 27674 flow [2022-12-06 05:52:13,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:13,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:13,611 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:13,616 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 05:52:13,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:13,815 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 05:52:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1870551884, now seen corresponding path program 1 times [2022-12-06 05:52:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:13,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033011350] [2022-12-06 05:52:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033011350] [2022-12-06 05:52:13,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033011350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:13,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485068337] [2022-12-06 05:52:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:13,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:13,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:13,929 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 05:52:13,931 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 05:52:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:14,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-06 05:52:14,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:14,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:52:14,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:52:14,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:52:14,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 05:52:15,560 INFO L321 Elim1Store]: treesize reduction 897, result has 6.7 percent of original size [2022-12-06 05:52:15,560 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 31 new quantified variables, introduced 120 case distinctions, treesize of input 345 treesize of output 163 [2022-12-06 05:52:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 05:52:15,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:52:25,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485068337] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:25,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:25,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 21 [2022-12-06 05:52:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291999127] [2022-12-06 05:52:25,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:25,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 05:52:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:25,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 05:52:25,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=352, Unknown=2, NotChecked=0, Total=420 [2022-12-06 05:52:25,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 123 [2022-12-06 05:52:25,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 890 transitions, 27674 flow. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:25,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:25,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 123 [2022-12-06 05:52:25,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:53:16,641 INFO L130 PetriNetUnfolder]: 4972/8841 cut-off events. [2022-12-06 05:53:16,641 INFO L131 PetriNetUnfolder]: For 623611/623611 co-relation queries the response was YES. [2022-12-06 05:53:16,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128551 conditions, 8841 events. 4972/8841 cut-off events. For 623611/623611 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 62845 event pairs, 412 based on Foata normal form. 12/8850 useless extension candidates. Maximal degree in co-relation 128346. Up to 4169 conditions per place. [2022-12-06 05:53:16,745 INFO L137 encePairwiseOnDemand]: 32/123 looper letters, 347 selfloop transitions, 606 changer transitions 17/970 dead transitions. [2022-12-06 05:53:16,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 970 transitions, 31198 flow [2022-12-06 05:53:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:53:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:53:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 198 transitions. [2022-12-06 05:53:16,747 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08943089430894309 [2022-12-06 05:53:16,747 INFO L175 Difference]: Start difference. First operand has 300 places, 890 transitions, 27674 flow. Second operand 18 states and 198 transitions. [2022-12-06 05:53:16,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 970 transitions, 31198 flow [2022-12-06 05:53:18,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 970 transitions, 29410 flow, removed 794 selfloop flow, removed 5 redundant places. [2022-12-06 05:53:18,996 INFO L231 Difference]: Finished difference. Result has 320 places, 911 transitions, 28384 flow [2022-12-06 05:53:18,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=25889, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=28384, PETRI_PLACES=320, PETRI_TRANSITIONS=911} [2022-12-06 05:53:18,997 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2022-12-06 05:53:18,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:53:18,997 INFO L89 Accepts]: Start accepts. Operand has 320 places, 911 transitions, 28384 flow [2022-12-06 05:53:19,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:53:19,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:53:19,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 911 transitions, 28384 flow [2022-12-06 05:53:19,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 911 transitions, 28384 flow [2022-12-06 05:53:19,864 INFO L130 PetriNetUnfolder]: 1121/3133 cut-off events. [2022-12-06 05:53:19,865 INFO L131 PetriNetUnfolder]: For 211896/213237 co-relation queries the response was YES. [2022-12-06 05:53:19,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46732 conditions, 3133 events. 1121/3133 cut-off events. For 211896/213237 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 27688 event pairs, 69 based on Foata normal form. 0/3075 useless extension candidates. Maximal degree in co-relation 46109. Up to 1675 conditions per place. [2022-12-06 05:53:19,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 318 places, 911 transitions, 28384 flow [2022-12-06 05:53:19,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 2530 [2022-12-06 05:53:20,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [794] $Ultimate##0-->L49-2: Formula: (let ((.cse12 (select |v_#memory_int_292| v_~f~0.base_202))) (let ((.cse8 (select .cse12 (+ v_~f~0.offset_202 (* v_~x1~0_383 4))))) (let ((.cse5 (select .cse12 (+ v_~f~0.offset_202 (* .cse8 4))))) (let ((.cse10 (select .cse12 (+ v_~f~0.offset_202 (* 4 .cse5))))) (let ((.cse2 (select .cse12 (+ v_~f~0.offset_202 (* .cse10 4))))) (let ((.cse1 (select .cse12 (+ v_~f~0.offset_202 (* .cse2 4))))) (let ((.cse0 (select .cse12 (+ v_~f~0.offset_202 (* .cse1 4))))) (let ((.cse7 (select .cse12 (+ v_~f~0.offset_202 (* 4 .cse0))))) (let ((.cse9 (select .cse12 (+ v_~f~0.offset_202 (* .cse7 4))))) (let ((.cse4 (select .cse12 (+ v_~f~0.offset_202 (* .cse9 4))))) (let ((.cse11 (select .cse12 (+ v_~f~0.offset_202 (* .cse4 4))))) (let ((.cse3 (select .cse12 (+ v_~f~0.offset_202 (* .cse11 4))))) (let ((.cse6 (select .cse12 (+ v_~f~0.offset_202 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_291| 13) (not (= (ite (and (< .cse0 v_~size~0_208) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_208) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_331| 0) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_208)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230| 0)) (not (= (ite (and (< .cse3 v_~size~0_208) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_208)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_208)) 1 0) 0)) (= (ite (and (< .cse6 v_~size~0_208) (<= 0 .cse6)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226|) (not (= (ite (and (< .cse7 v_~size~0_208) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_208) (<= 0 .cse8)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_291| 4294967295) 4294967296) (* (mod v_~n~0_188 1073741824) 4)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_208)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_383 v_~size~0_208) (<= 0 v_~x1~0_383)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|) (not (= (ite (and (< .cse10 v_~size~0_208) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_208) (<= 0 .cse11)) 1 0) 0)) (= v_~x1~0_381 (select .cse12 (+ v_~f~0.offset_202 (* .cse6 4)))))))))))))))))) InVars {~size~0=v_~size~0_208, ~f~0.base=v_~f~0.base_202, #memory_int=|v_#memory_int_292|, ~n~0=v_~n~0_188, ~x1~0=v_~x1~0_383, ~f~0.offset=v_~f~0.offset_202} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_220|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_226|, ~size~0=v_~size~0_208, ~f~0.base=v_~f~0.base_202, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_291|, #memory_int=|v_#memory_int_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_331|, ~n~0=v_~n~0_188, ~x1~0=v_~x1~0_381, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_230|, ~f~0.offset=v_~f~0.offset_202} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:53:24,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:53:30,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [915] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_495| v_~f~0.base_390))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_390 (* v_~x1~0_827 4))))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_390 (* .cse11 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_390 (* .cse13 4))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_390 (* .cse7 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_390 (* .cse14 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_390 (* .cse0 4))))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_390 (* .cse2 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_390 (* 4 .cse12))))) (let ((.cse16 (select .cse3 (+ v_~f~0.offset_390 (* .cse8 4))))) (let ((.cse15 (select .cse3 (+ v_~f~0.offset_390 (* .cse16 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_390 (* 4 .cse15)))) (.cse6 (select .cse3 (+ v_~f~0.offset_390 (* v_~x2~0_568 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_390 (* .cse6 4)))) (.cse10 (select .cse3 (+ v_~f~0.offset_390 (* .cse1 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_390 (* .cse10 4)))) (.cse9 (select .cse3 (+ v_~f~0.offset_390 (* 4 .cse5))))) (and (not (= (ite (and (< .cse0 v_~size~0_396) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_396) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_396) (<= 0 .cse2)) 1 0) 0)) (= v_~x1~0_825 (select .cse3 (+ v_~f~0.offset_390 (* .cse4 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368| 0)) (= (ite (and (< .cse4 v_~size~0_396) (<= 0 .cse4)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487|) (not (= (ite (and (< .cse5 v_~size~0_396) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_568) (< v_~x2~0_568 v_~size~0_396)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_396) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_396)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_590| 4) (not (= (ite (and (< v_~x1~0_827 v_~size~0_396) (<= 0 v_~x1~0_827)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491|) (not (= (ite (and (< .cse8 v_~size~0_396) (<= 0 .cse8)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491| 0)) (= (ite (and (< .cse9 v_~size~0_396) (<= 0 .cse9)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_328|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_328| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|) (not (= (ite (and (< .cse10 v_~size~0_396) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_396) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_396)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_390 (* .cse9 4))) v_~x2~0_567) (= |v_thread1Thread1of1ForFork0_~i~0#1_691| 14) (not (= (ite (and (< .cse13 v_~size~0_396) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_396) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_396)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_396) (<= 0 .cse16)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_691| 4294967294) 4294967296) (* (mod v_~n~0_376 1073741824) 4))))))))))))))))) InVars {~x2~0=v_~x2~0_568, ~size~0=v_~size~0_396, ~f~0.base=v_~f~0.base_390, #memory_int=|v_#memory_int_495|, ~n~0=v_~n~0_376, ~x1~0=v_~x1~0_827, ~f~0.offset=v_~f~0.offset_390} OutVars{~x2~0=v_~x2~0_567, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_481|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_262|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_280|, ~size~0=v_~size~0_396, ~f~0.base=v_~f~0.base_390, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_268|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_328|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_590|, ~x1~0=v_~x1~0_825, ~f~0.offset=v_~f~0.offset_390, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_487|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_262|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_260|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_691|, #memory_int=|v_#memory_int_495|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_274|, ~n~0=v_~n~0_376, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_276|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_491|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:53:32,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [912] $Ultimate##0-->L49-2: Formula: (let ((.cse6 (select |v_#memory_int_491| v_~f~0.base_386))) (let ((.cse10 (select .cse6 (+ v_~f~0.offset_386 (* v_~x1~0_817 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_386 (* .cse10 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_386 (* .cse8 4))))) (let ((.cse13 (select .cse6 (+ v_~f~0.offset_386 (* 4 .cse1))))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_386 (* .cse13 4))))) (let ((.cse12 (select .cse6 (+ v_~f~0.offset_386 (* .cse5 4))))) (let ((.cse7 (select .cse6 (+ v_~f~0.offset_386 (* .cse12 4))))) (let ((.cse11 (select .cse6 (+ v_~f~0.offset_386 (* .cse7 4))))) (let ((.cse3 (select .cse6 (+ v_~f~0.offset_386 (* .cse11 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_386 (* .cse3 4))))) (let ((.cse2 (select .cse6 (+ v_~f~0.offset_386 (* .cse9 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_386 (* .cse2 4))))) (let ((.cse14 (select .cse6 (+ v_~f~0.offset_386 (* .cse0 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_386 (* 4 .cse14))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_584| 0) (not (= (ite (and (< .cse0 v_~size~0_392) (<= 0 .cse0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_685| 15) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_392)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_392)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_392)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_481| (ite (and (< .cse4 v_~size~0_392) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_481| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (not (= 0 (ite (and (< .cse5 v_~size~0_392) (<= 0 .cse5)) 1 0))) (= (select .cse6 (+ v_~f~0.offset_386 (* 4 .cse4))) v_~x1~0_815) (not (= (ite (and (< .cse7 v_~size~0_392) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_817 v_~size~0_392) (<= 0 v_~x1~0_817)) 1 0) 0)) (not (= 0 (ite (and (< .cse8 v_~size~0_392) (<= 0 .cse8)) 1 0))) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_392)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_392)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_392) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_392)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485| 0)) (< 12 (* (mod v_~n~0_372 1073741824) 4)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_392)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_392) (<= 0 .cse14)) 1 0) 0)))))))))))))))))) InVars {~size~0=v_~size~0_392, ~f~0.base=v_~f~0.base_386, #memory_int=|v_#memory_int_491|, ~n~0=v_~n~0_372, ~x1~0=v_~x1~0_817, ~f~0.offset=v_~f~0.offset_386} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_475|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_481|, ~size~0=v_~size~0_392, ~f~0.base=v_~f~0.base_386, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_685|, #memory_int=|v_#memory_int_491|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_584|, ~n~0=v_~n~0_372, ~x1~0=v_~x1~0_815, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_485|, ~f~0.offset=v_~f~0.offset_386} 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, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:53:35,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [906] L49-2-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_482| v_~f~0.base_380))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_380 (* v_~x1~0_795 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_380 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_380 (* .cse4 4)))) (.cse0 (* (mod v_~n~0_366 1073741824) 4))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_670| 4294967295) 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_472| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_468| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_472|) (= |v_thread1Thread1of1ForFork0_~i~0#1_670| (+ |v_thread1Thread1of1ForFork0_~i~0#1_672| 4)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_468| (ite (and (< .cse1 v_~size~0_386) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< .cse2 v_~size~0_386) (<= 0 .cse2)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_380 (* 4 .cse1))) v_~x1~0_793) (not (= (ite (and (<= 0 v_~x1~0_795) (< v_~x1~0_795 v_~size~0_386)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_672| 4294967296) .cse0) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_386)) 1 0) 0))))))) InVars {~size~0=v_~size~0_386, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_672|, #memory_int=|v_#memory_int_482|, ~n~0=v_~n~0_366, ~x1~0=v_~x1~0_795, ~f~0.offset=v_~f~0.offset_380} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_462|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_468|, ~size~0=v_~size~0_386, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_670|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_472|, ~n~0=v_~n~0_366, ~x1~0=v_~x1~0_793, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_472|, ~f~0.offset=v_~f~0.offset_380} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:53:35,863 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:53:35,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16867 [2022-12-06 05:53:35,864 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 911 transitions, 28695 flow [2022-12-06 05:53:35,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:53:35,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:53:35,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:53:35,871 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 05:53:36,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 05:53:36,071 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 05:53:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:53:36,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1098517559, now seen corresponding path program 1 times [2022-12-06 05:53:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:53:36,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948203438] [2022-12-06 05:53:36,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:36,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:53:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:54:34,707 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 05:54:34,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:54:34,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948203438] [2022-12-06 05:54:34,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948203438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:54:34,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542195787] [2022-12-06 05:54:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:54:34,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:54:34,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:54:34,708 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 05:54:34,710 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 05:54:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:54:34,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 05:54:34,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:54:35,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:54:35,104 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 05:54:35,804 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 05:54:35,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:54:40,609 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-06 05:54:40,610 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 05:55:26,030 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 05:55:26,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542195787] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:55:26,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:55:26,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 15 [2022-12-06 05:55:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725912595] [2022-12-06 05:55:26,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:55:26,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:55:26,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:55:26,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:55:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:55:26,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 133 [2022-12-06 05:55:26,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 911 transitions, 28695 flow. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 05:55:26,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:55:26,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 133 [2022-12-06 05:55:26,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:55:53,806 INFO L130 PetriNetUnfolder]: 5043/8935 cut-off events. [2022-12-06 05:55:53,806 INFO L131 PetriNetUnfolder]: For 637160/637160 co-relation queries the response was YES. [2022-12-06 05:55:53,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131230 conditions, 8935 events. 5043/8935 cut-off events. For 637160/637160 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 63244 event pairs, 618 based on Foata normal form. 2/8932 useless extension candidates. Maximal degree in co-relation 129785. Up to 8675 conditions per place. [2022-12-06 05:55:53,918 INFO L137 encePairwiseOnDemand]: 66/133 looper letters, 843 selfloop transitions, 151 changer transitions 7/1001 dead transitions. [2022-12-06 05:55:53,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1001 transitions, 33088 flow [2022-12-06 05:55:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:55:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:55:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 209 transitions. [2022-12-06 05:55:53,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0873015873015873 [2022-12-06 05:55:53,920 INFO L175 Difference]: Start difference. First operand has 318 places, 911 transitions, 28695 flow. Second operand 18 states and 209 transitions. [2022-12-06 05:55:53,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1001 transitions, 33088 flow [2022-12-06 05:55:56,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 1001 transitions, 32447 flow, removed 294 selfloop flow, removed 2 redundant places. [2022-12-06 05:55:56,497 INFO L231 Difference]: Finished difference. Result has 339 places, 969 transitions, 30459 flow [2022-12-06 05:55:56,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=28150, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=30459, PETRI_PLACES=339, PETRI_TRANSITIONS=969} [2022-12-06 05:55:56,498 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 318 predicate places. [2022-12-06 05:55:56,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:55:56,498 INFO L89 Accepts]: Start accepts. Operand has 339 places, 969 transitions, 30459 flow [2022-12-06 05:55:56,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:55:56,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:55:56,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 969 transitions, 30459 flow [2022-12-06 05:55:56,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 335 places, 969 transitions, 30459 flow [2022-12-06 05:55:57,389 INFO L130 PetriNetUnfolder]: 1160/3189 cut-off events. [2022-12-06 05:55:57,389 INFO L131 PetriNetUnfolder]: For 221057/222426 co-relation queries the response was YES. [2022-12-06 05:55:57,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48194 conditions, 3189 events. 1160/3189 cut-off events. For 221057/222426 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 28017 event pairs, 65 based on Foata normal form. 3/3133 useless extension candidates. Maximal degree in co-relation 47656. Up to 1715 conditions per place. [2022-12-06 05:55:57,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 335 places, 969 transitions, 30459 flow [2022-12-06 05:55:57,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 2670 [2022-12-06 05:56:01,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [930] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_513| v_~f~0.base_408))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_408 (* v_~x1~0_866 4)))) (.cse7 (select .cse1 (+ v_~f~0.offset_408 (* v_~x2~0_612 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_408 (* .cse7 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_408 (* .cse6 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_408 (* .cse4 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_408 (* .cse0 4)))) (.cse5 (* (mod v_~n~0_394 1073741824) 4))) (and (not (= (ite (and (< .cse0 v_~size~0_414) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_408 (* .cse2 4))) v_~x1~0_865) (= |v_thread1Thread1of1ForFork0_~i~0#1_717| (+ |v_thread1Thread1of1ForFork0_~i~0#1_718| 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_354| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_394|) (= (select .cse1 (+ v_~f~0.offset_408 (* 4 .cse3))) v_~x2~0_611) (not (= (ite (and (< v_~x1~0_866 v_~size~0_414) (<= 0 v_~x1~0_866)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_414)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|) (not (= (ite (and (< .cse4 v_~size~0_414) (<= 0 .cse4)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_717| 4294967295) 4294967296) .cse5) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_515| 0)) (not (= (ite (and (<= 0 v_~x2~0_612) (< v_~x2~0_612 v_~size~0_414)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_627| 4) |v_thread2Thread1of1ForFork1_~i~1#1_626|) (not (= (ite (and (< .cse6 v_~size~0_414) (<= 0 .cse6)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_354| (ite (and (< .cse3 v_~size~0_414) (<= 0 .cse3)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_394| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_627| 4294967296) .cse5) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_718| 4294967296) .cse5) (not (= (ite (and (< .cse7 v_~size~0_414) (<= 0 .cse7)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_515|)))))) InVars {~x2~0=v_~x2~0_612, ~size~0=v_~size~0_414, ~f~0.base=v_~f~0.base_408, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_718|, #memory_int=|v_#memory_int_513|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_627|, ~n~0=v_~n~0_394, ~x1~0=v_~x1~0_866, ~f~0.offset=v_~f~0.offset_408} OutVars{~x2~0=v_~x2~0_611, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_505|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_288|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_306|, ~size~0=v_~size~0_414, ~f~0.base=v_~f~0.base_408, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_294|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_354|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_626|, ~x1~0=v_~x1~0_865, ~f~0.offset=v_~f~0.offset_408, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_394|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_511|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_288|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_286|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_717|, #memory_int=|v_#memory_int_513|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_300|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_515|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_300|, ~n~0=v_~n~0_394, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_302|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_515|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:56:02,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:56:06,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [932] L49-2-->L49-2: Formula: (let ((.cse5 (select |v_#memory_int_515| v_~f~0.base_410))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_410 (* v_~x1~0_871 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_410 (* 4 .cse2))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_410 (* 4 .cse4))))) (let ((.cse1 (* (mod v_~n~0_396 1073741824) 4)) (.cse0 (select .cse5 (+ v_~f~0.offset_410 (* 4 .cse3))))) (and (not (= (ite (and (<= 0 v_~x1~0_871) (< v_~x1~0_871 v_~size~0_416)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_416) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_723| 4) 4294967296) .cse1) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_723| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_416)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_721| (+ |v_thread1Thread1of1ForFork0_~i~0#1_723| 5)) (not (= (ite (and (< .cse3 v_~size~0_416) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_517|) (not (= (ite (and (< .cse4 v_~size~0_416) (<= 0 .cse4)) 1 0) 0)) (= v_~x1~0_869 (select .cse5 (+ v_~f~0.offset_410 (* .cse0 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_517| 0)))))))) InVars {~size~0=v_~size~0_416, ~f~0.base=v_~f~0.base_410, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_723|, #memory_int=|v_#memory_int_515|, ~n~0=v_~n~0_396, ~x1~0=v_~x1~0_871, ~f~0.offset=v_~f~0.offset_410} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_507|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_513|, ~size~0=v_~size~0_416, ~f~0.base=v_~f~0.base_410, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_721|, #memory_int=|v_#memory_int_515|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_517|, ~n~0=v_~n~0_396, ~x1~0=v_~x1~0_869, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_517|, ~f~0.offset=v_~f~0.offset_410} 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 [709] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_152| v_~f~0.base_86))) (let ((.cse0 (select .cse2 (+ (* v_~x2~0_175 4) v_~f~0.offset_86)))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_86 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_86 (* .cse3 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_96)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 4) |v_thread2Thread1of1ForFork1_~i~1#1_159|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (not (= (ite (and (<= 0 v_~x2~0_175) (< v_~x2~0_175 v_~size~0_96)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_161| 4294967296) (* (mod v_~n~0_72 1073741824) 4)) (= (ite (and (< .cse1 v_~size~0_96) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= (select .cse2 (+ v_~f~0.offset_86 (* .cse1 4))) v_~x2~0_173) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_96)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~n~0=v_~n~0_72, ~f~0.offset=v_~f~0.offset_86} OutVars{~x2~0=v_~x2~0_173, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_29|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, ~size~0=v_~size~0_96, ~f~0.base=v_~f~0.base_86, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, 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_159|, ~f~0.offset=v_~f~0.offset_86, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_29|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, #memory_int=|v_#memory_int_152|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_72, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:56:06,341 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:56:06,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9843 [2022-12-06 05:56:06,341 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 967 transitions, 30633 flow [2022-12-06 05:56:06,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 05:56:06,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:56:06,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:56:06,346 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 05:56:06,542 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,SelfDestructingSolverStorable39 [2022-12-06 05:56:06,542 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 05:56:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:56:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2101180250, now seen corresponding path program 1 times [2022-12-06 05:56:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:56:06,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495450043] [2022-12-06 05:56:06,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:56:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:06,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:56:06,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495450043] [2022-12-06 05:56:06,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495450043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:56:06,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559539275] [2022-12-06 05:56:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:56:06,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:56:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:56:06,623 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 05:56:06,625 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 05:56:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:56:06,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:56:06,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:56:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:06,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:56:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:56:06,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559539275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:56:06,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:56:06,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 05:56:06,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119390180] [2022-12-06 05:56:06,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:56:06,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:56:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:56:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:56:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:56:06,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 138 [2022-12-06 05:56:06,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 967 transitions, 30633 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 05:56:06,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:56:06,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 138 [2022-12-06 05:56:06,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:56:09,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:11,789 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 05:56:14,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:17,533 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 05:56:19,845 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 05:56:22,411 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 05:56:24,414 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 05:56:28,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:30,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:32,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:33,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:35,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:56:41,536 INFO L130 PetriNetUnfolder]: 5391/9766 cut-off events. [2022-12-06 05:56:41,536 INFO L131 PetriNetUnfolder]: For 699239/699239 co-relation queries the response was YES. [2022-12-06 05:56:41,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142034 conditions, 9766 events. 5391/9766 cut-off events. For 699239/699239 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 73537 event pairs, 935 based on Foata normal form. 4/9766 useless extension candidates. Maximal degree in co-relation 140844. Up to 4979 conditions per place. [2022-12-06 05:56:41,719 INFO L137 encePairwiseOnDemand]: 31/138 looper letters, 1279 selfloop transitions, 340 changer transitions 9/1628 dead transitions. [2022-12-06 05:56:41,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1628 transitions, 53213 flow [2022-12-06 05:56:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:56:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:56:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 222 transitions. [2022-12-06 05:56:41,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10054347826086957 [2022-12-06 05:56:41,724 INFO L175 Difference]: Start difference. First operand has 333 places, 967 transitions, 30633 flow. Second operand 16 states and 222 transitions. [2022-12-06 05:56:41,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1628 transitions, 53213 flow [2022-12-06 05:56:44,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1628 transitions, 52627 flow, removed 288 selfloop flow, removed 4 redundant places. [2022-12-06 05:56:44,460 INFO L231 Difference]: Finished difference. Result has 351 places, 1095 transitions, 35385 flow [2022-12-06 05:56:44,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=30078, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=35385, PETRI_PLACES=351, PETRI_TRANSITIONS=1095} [2022-12-06 05:56:44,461 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 330 predicate places. [2022-12-06 05:56:44,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:56:44,461 INFO L89 Accepts]: Start accepts. Operand has 351 places, 1095 transitions, 35385 flow [2022-12-06 05:56:44,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:56:44,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:56:44,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 351 places, 1095 transitions, 35385 flow [2022-12-06 05:56:44,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 349 places, 1095 transitions, 35385 flow [2022-12-06 05:56:45,509 INFO L130 PetriNetUnfolder]: 1244/3571 cut-off events. [2022-12-06 05:56:45,509 INFO L131 PetriNetUnfolder]: For 248464/249719 co-relation queries the response was YES. [2022-12-06 05:56:45,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54682 conditions, 3571 events. 1244/3571 cut-off events. For 248464/249719 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 33013 event pairs, 56 based on Foata normal form. 3/3523 useless extension candidates. Maximal degree in co-relation 54181. Up to 1904 conditions per place. [2022-12-06 05:56:45,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 349 places, 1095 transitions, 35385 flow [2022-12-06 05:56:45,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 2920 [2022-12-06 05:56:45,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_335| v_~f~0.base_236))) (let ((.cse19 (select .cse3 (+ v_~f~0.offset_236 (* v_~x2~0_434 4))))) (let ((.cse23 (select .cse3 (+ v_~f~0.offset_236 (* 4 .cse19))))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_236 (* 4 .cse23))))) (let ((.cse17 (select .cse3 (+ v_~f~0.offset_236 (* .cse13 4))))) (let ((.cse16 (select .cse3 (+ v_~f~0.offset_236 (* v_~x1~0_480 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_236 (* .cse17 4))))) (let ((.cse20 (select .cse3 (+ v_~f~0.offset_236 (* .cse2 4)))) (.cse6 (select .cse3 (+ v_~f~0.offset_236 (* .cse16 4))))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_236 (* .cse6 4)))) (.cse8 (select .cse3 (+ v_~f~0.offset_236 (* .cse20 4))))) (let ((.cse25 (select .cse3 (+ v_~f~0.offset_236 (* 4 .cse8)))) (.cse7 (select .cse3 (+ v_~f~0.offset_236 (* 4 .cse12))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_236 (* .cse7 4)))) (.cse10 (select .cse3 (+ v_~f~0.offset_236 (* .cse25 4))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_236 (* .cse10 4)))) (.cse24 (select .cse3 (+ v_~f~0.offset_236 (* .cse9 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_236 (* .cse24 4)))) (.cse22 (select .cse3 (+ v_~f~0.offset_236 (* .cse11 4))))) (let ((.cse18 (select .cse3 (+ v_~f~0.offset_236 (* .cse22 4)))) (.cse14 (select .cse3 (+ v_~f~0.offset_236 (* 4 .cse1))))) (let ((.cse26 (select .cse3 (+ v_~f~0.offset_236 (* .cse14 4)))) (.cse21 (select .cse3 (+ v_~f~0.offset_236 (* .cse18 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_236 (* .cse21 4)))) (.cse5 (select .cse3 (+ v_~f~0.offset_236 (* .cse26 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_236 (* .cse5 4)))) (.cse15 (select .cse3 (+ v_~f~0.offset_236 (* .cse0 4))))) (and (< 12 (* 4 (mod v_~n~0_222 1073741824))) (not (= (ite (and (< .cse0 v_~size~0_242) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_242) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_242) (<= 0 .cse2)) 1 0) 0)) (= v_~x1~0_478 (select .cse3 (+ v_~f~0.offset_236 (* .cse4 4)))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_242) (<= 0 .cse8)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_289| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_293|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_242) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_242)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_242)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_285| 0)) (= 16 |v_thread2Thread1of1ForFork1_~i~1#1_389|) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_434 v_~size~0_242) (<= 0 v_~x2~0_434)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_242)) 1 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (< .cse18 v_~size~0_242) (<= 0 .cse18)) 1 0) 0)) (not (= (ite (and (< .cse19 v_~size~0_242) (<= 0 .cse19)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_369| 12) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_242)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_285|) (not (= (ite (and (<= 0 .cse21) (< .cse21 v_~size~0_242)) 1 0) 0)) (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_242)) 1 0) 0)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_242)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_289|) (not (= (ite (and (< .cse23 v_~size~0_242) (<= 0 .cse23)) 1 0) 0)) (not (= (ite (and (< .cse24 v_~size~0_242) (<= 0 .cse24)) 1 0) 0)) (not (= (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_242)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_236 (* .cse15 4))) v_~x2~0_432) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_293| 0)) (not (= (ite (and (< v_~x1~0_480 v_~size~0_242) (<= 0 v_~x1~0_480)) 1 0) 0)) (not (= 0 (ite (and (< .cse26 v_~size~0_242) (<= 0 .cse26)) 1 0)))))))))))))))))))) InVars {~x2~0=v_~x2~0_434, ~size~0=v_~size~0_242, ~f~0.base=v_~f~0.base_236, #memory_int=|v_#memory_int_335|, ~n~0=v_~n~0_222, ~x1~0=v_~x1~0_480, ~f~0.offset=v_~f~0.offset_236} OutVars{~x2~0=v_~x2~0_432, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_283|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_179|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_197|, ~size~0=v_~size~0_242, ~f~0.base=v_~f~0.base_236, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_185|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_389|, ~x1~0=v_~x1~0_478, ~f~0.offset=v_~f~0.offset_236, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_289|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_177|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_369|, #memory_int=|v_#memory_int_335|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_191|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_293|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_191|, ~n~0=v_~n~0_222, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_193|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_293|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:56:48,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_318| v_~f~0.base_222))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_222 (* v_~x2~0_410 4))))) (let ((.cse22 (select .cse0 (+ v_~f~0.offset_222 (* .cse7 4))))) (let ((.cse25 (select .cse0 (+ v_~f~0.offset_222 (* .cse22 4))))) (let ((.cse20 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse25))))) (let ((.cse23 (select .cse0 (+ v_~f~0.offset_222 (* .cse20 4))))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_222 (* .cse23 4)))) (.cse5 (select .cse0 (+ (* v_~x1~0_443 4) v_~f~0.offset_222)))) (let ((.cse15 (select .cse0 (+ v_~f~0.offset_222 (* .cse5 4)))) (.cse19 (select .cse0 (+ v_~f~0.offset_222 (* .cse13 4))))) (let ((.cse21 (select .cse0 (+ v_~f~0.offset_222 (* .cse19 4)))) (.cse12 (select .cse0 (+ v_~f~0.offset_222 (* .cse15 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_222 (* .cse12 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_222 (* .cse21 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_222 (* .cse6 4)))) (.cse18 (select .cse0 (+ v_~f~0.offset_222 (* .cse2 4))))) (let ((.cse24 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse18)))) (.cse14 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse11))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_222 (* .cse14 4)))) (.cse16 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse24))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_222 (* .cse16 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_222 (* .cse10 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_222 (* .cse3 4)))) (.cse17 (select .cse0 (+ v_~f~0.offset_222 (* .cse4 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse17)))) (.cse8 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse9))))) (and (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_222)) v_~x1~0_442) (not (= (ite (and (< .cse2 v_~size~0_228) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_228)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|) (not (= (ite (and (< .cse4 v_~size~0_228) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_228) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_228) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_410 v_~size~0_228) (<= 0 v_~x2~0_410)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_443) (< v_~x1~0_443 v_~size~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_333| 11) (not (= (ite (and (< .cse7 v_~size~0_228) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230| (ite (and (< .cse8 v_~size~0_228) (<= 0 .cse8)) 1 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_228) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| (ite (and (< .cse1 v_~size~0_228) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_228) (<= 0 .cse16)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|) (not (= (ite (and (< .cse17 v_~size~0_228) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_228) (<= 0 .cse20)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_368|) 4294967296) (* (mod v_~n~0_208 1073741824) 4)) (not (= (ite (and (< .cse21 v_~size~0_228) (<= 0 .cse21)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_222 (* .cse8 4))) v_~x2~0_408) (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_228)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270| 0)) (not (= (ite (and (< .cse23 v_~size~0_228) (<= 0 .cse23)) 1 0) 0)) (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_228)) 1 0) 0)) (= 16 |v_thread2Thread1of1ForFork1_~i~1#1_368|) (not (= (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_228)) 1 0) 0))))))))))))))))))) InVars {~x2~0=v_~x2~0_410, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_222, #memory_int=|v_#memory_int_318|, ~n~0=v_~n~0_208, ~x1~0=v_~x1~0_443, ~f~0.offset=v_~f~0.offset_222} OutVars{~x2~0=v_~x2~0_408, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_260|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_164|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_182|, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_222, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_170|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_368|, ~x1~0=v_~x1~0_442, ~f~0.offset=v_~f~0.offset_222, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_164|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_162|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_333|, #memory_int=|v_#memory_int_318|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_176|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_176|, ~n~0=v_~n~0_208, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_178|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_270|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [820] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_333| v_~f~0.base_234))) (let ((.cse1 (* (mod v_~n~0_220 1073741824) 4)) (.cse0 (select .cse2 (+ v_~f~0.offset_234 (* v_~x1~0_474 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_285| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_289|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_240)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_285|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_365| 4294967296) .cse1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_365| 1) 4294967296) .cse1) (not (= (ite (and (<= 0 v_~x1~0_474) (< v_~x1~0_474 v_~size~0_240)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_365| 2) |v_thread1Thread1of1ForFork0_~i~0#1_363|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_289| 0)) (= v_~x1~0_472 (select .cse2 (+ v_~f~0.offset_234 (* .cse0 4))))))) InVars {~size~0=v_~size~0_240, ~f~0.base=v_~f~0.base_234, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_365|, #memory_int=|v_#memory_int_333|, ~n~0=v_~n~0_220, ~x1~0=v_~x1~0_474, ~f~0.offset=v_~f~0.offset_234} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_279|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_285|, ~size~0=v_~size~0_240, ~f~0.base=v_~f~0.base_234, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_363|, #memory_int=|v_#memory_int_333|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_289|, ~n~0=v_~n~0_220, ~x1~0=v_~x1~0_472, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_289|, ~f~0.offset=v_~f~0.offset_234} 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 05:56:53,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_318| v_~f~0.base_222))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_222 (* v_~x2~0_410 4))))) (let ((.cse22 (select .cse0 (+ v_~f~0.offset_222 (* .cse7 4))))) (let ((.cse25 (select .cse0 (+ v_~f~0.offset_222 (* .cse22 4))))) (let ((.cse20 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse25))))) (let ((.cse23 (select .cse0 (+ v_~f~0.offset_222 (* .cse20 4))))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_222 (* .cse23 4)))) (.cse5 (select .cse0 (+ (* v_~x1~0_443 4) v_~f~0.offset_222)))) (let ((.cse15 (select .cse0 (+ v_~f~0.offset_222 (* .cse5 4)))) (.cse19 (select .cse0 (+ v_~f~0.offset_222 (* .cse13 4))))) (let ((.cse21 (select .cse0 (+ v_~f~0.offset_222 (* .cse19 4)))) (.cse12 (select .cse0 (+ v_~f~0.offset_222 (* .cse15 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_222 (* .cse12 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_222 (* .cse21 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_222 (* .cse6 4)))) (.cse18 (select .cse0 (+ v_~f~0.offset_222 (* .cse2 4))))) (let ((.cse24 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse18)))) (.cse14 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse11))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_222 (* .cse14 4)))) (.cse16 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse24))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_222 (* .cse16 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_222 (* .cse10 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_222 (* .cse3 4)))) (.cse17 (select .cse0 (+ v_~f~0.offset_222 (* .cse4 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse17)))) (.cse8 (select .cse0 (+ v_~f~0.offset_222 (* 4 .cse9))))) (and (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_222)) v_~x1~0_442) (not (= (ite (and (< .cse2 v_~size~0_228) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_228)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|) (not (= (ite (and (< .cse4 v_~size~0_228) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_228) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_228) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_410 v_~size~0_228) (<= 0 v_~x2~0_410)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_443) (< v_~x1~0_443 v_~size~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_333| 11) (not (= (ite (and (< .cse7 v_~size~0_228) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230| (ite (and (< .cse8 v_~size~0_228) (<= 0 .cse8)) 1 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_228) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| (ite (and (< .cse1 v_~size~0_228) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_228) (<= 0 .cse16)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|) (not (= (ite (and (< .cse17 v_~size~0_228) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_228)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_228) (<= 0 .cse20)) 1 0) 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_368|) 4294967296) (* (mod v_~n~0_208 1073741824) 4)) (not (= (ite (and (< .cse21 v_~size~0_228) (<= 0 .cse21)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_222 (* .cse8 4))) v_~x2~0_408) (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_228)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270| 0)) (not (= (ite (and (< .cse23 v_~size~0_228) (<= 0 .cse23)) 1 0) 0)) (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_228)) 1 0) 0)) (= 16 |v_thread2Thread1of1ForFork1_~i~1#1_368|) (not (= (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_228)) 1 0) 0))))))))))))))))))) InVars {~x2~0=v_~x2~0_410, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_222, #memory_int=|v_#memory_int_318|, ~n~0=v_~n~0_208, ~x1~0=v_~x1~0_443, ~f~0.offset=v_~f~0.offset_222} OutVars{~x2~0=v_~x2~0_408, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_260|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_164|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_182|, ~size~0=v_~size~0_228, ~f~0.base=v_~f~0.base_222, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_170|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_230|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_368|, ~x1~0=v_~x1~0_442, ~f~0.offset=v_~f~0.offset_222, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_164|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_162|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_333|, #memory_int=|v_#memory_int_318|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_176|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_270|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_176|, ~n~0=v_~n~0_208, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_178|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_270|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [818] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_331| v_~f~0.base_232))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_232 (* v_~x2~0_429 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_232 (* .cse1 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_232 (* 4 .cse3)))) (.cse4 (* (mod v_~n~0_218 1073741824) 4))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| (ite (and (< .cse0 v_~size~0_238) (<= 0 .cse0)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_238)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_386| 4) |v_thread2Thread1of1ForFork1_~i~1#1_385|) (not (= (ite (and (< v_~x2~0_429 v_~size~0_238) (<= 0 v_~x2~0_429)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_232 (* .cse0 4))) v_~x2~0_428) (= |v_thread1Thread1of1ForFork0_~i~0#1_359| (+ |v_thread1Thread1of1ForFork0_~i~0#1_360| 1)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_238)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_469) (< v_~x1~0_469 v_~size~0_238)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283|) (= (select .cse2 (+ v_~f~0.offset_232 (* v_~x1~0_469 4))) v_~x1~0_468) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_360| 4294967296) .cse4) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_386| 4294967296) .cse4)))))) InVars {~x2~0=v_~x2~0_429, ~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_232, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_360|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_386|, ~n~0=v_~n~0_218, ~x1~0=v_~x1~0_469, ~f~0.offset=v_~f~0.offset_232} OutVars{~x2~0=v_~x2~0_428, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_277|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_177|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_195|, ~size~0=v_~size~0_238, ~f~0.base=v_~f~0.base_232, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_183|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_243|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_385|, ~x1~0=v_~x1~0_468, ~f~0.offset=v_~f~0.offset_232, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_283|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_177|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_175|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_359|, #memory_int=|v_#memory_int_331|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_189|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_189|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_191|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_287|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:57:00,079 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_347| v_~f~0.base_248))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_248 (* v_~x2~0_459 4))))) (let ((.cse9 (select .cse5 (+ v_~f~0.offset_248 (* .cse4 4))))) (let ((.cse12 (select .cse5 (+ (* .cse9 4) v_~f~0.offset_248)))) (let ((.cse18 (select .cse5 (+ v_~f~0.offset_248 (* .cse12 4)))) (.cse8 (select .cse5 (+ v_~f~0.offset_248 (* v_~x1~0_516 4))))) (let ((.cse17 (select .cse5 (+ v_~f~0.offset_248 (* .cse8 4)))) (.cse11 (select .cse5 (+ v_~f~0.offset_248 (* .cse18 4))))) (let ((.cse15 (select .cse5 (+ v_~f~0.offset_248 (* .cse11 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_248 (* .cse17 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_248 (* .cse0 4)))) (.cse2 (select .cse5 (+ v_~f~0.offset_248 (* 4 .cse15))))) (let ((.cse7 (select .cse5 (+ v_~f~0.offset_248 (* .cse2 4)))) (.cse14 (select .cse5 (+ v_~f~0.offset_248 (* .cse3 4))))) (let ((.cse19 (select .cse5 (+ v_~f~0.offset_248 (* .cse14 4)))) (.cse10 (select .cse5 (+ v_~f~0.offset_248 (* .cse7 4))))) (let ((.cse16 (select .cse5 (+ v_~f~0.offset_248 (* .cse10 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_248 (* .cse19 4))))) (let ((.cse13 (select .cse5 (+ v_~f~0.offset_248 (* .cse1 4)))) (.cse6 (select .cse5 (+ (* .cse16 4) v_~f~0.offset_248)))) (and (not (= (ite (and (< .cse0 v_~size~0_254) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_459) (< v_~x2~0_459 v_~size~0_254)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_317| 0)) (not (= (ite (and (< .cse1 v_~size~0_254) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_260| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_254) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_254)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_406| 12) (= (select .cse5 (+ v_~f~0.offset_248 (* .cse6 4))) v_~x2~0_457) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_254) (<= 0 .cse12)) 1 0) 0)) (= (ite (and (< .cse13 v_~size~0_254) (<= 0 .cse13)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_313|) (= v_~x1~0_514 (select .cse5 (+ v_~f~0.offset_248 (* .cse13 4)))) (< 8 (* (mod v_~n~0_234 1073741824) 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_260| (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_254)) 1 0)) (not (= (ite (and (< .cse14 v_~size~0_254) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_254) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_254)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_397| 9) (not (= (ite (and (< .cse17 v_~size~0_254) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_516) (< v_~x1~0_516 v_~size~0_254)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_313| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_317|) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_254)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_254)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_459, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, #memory_int=|v_#memory_int_347|, ~n~0=v_~n~0_234, ~x1~0=v_~x1~0_516, ~f~0.offset=v_~f~0.offset_248} OutVars{~x2~0=v_~x2~0_457, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_307|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_194|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_212|, ~size~0=v_~size~0_254, ~f~0.base=v_~f~0.base_248, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_200|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_260|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_406|, ~x1~0=v_~x1~0_514, ~f~0.offset=v_~f~0.offset_248, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_313|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_194|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_192|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_397|, #memory_int=|v_#memory_int_347|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_206|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_317|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_206|, ~n~0=v_~n~0_234, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_208|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_317|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:57:01,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [809] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_310| v_~f~0.base_220))) (let ((.cse7 (select .cse5 (+ v_~f~0.offset_220 (* v_~x2~0_397 4))))) (let ((.cse12 (select .cse5 (+ v_~f~0.offset_220 (* v_~x1~0_430 4)))) (.cse10 (select .cse5 (+ v_~f~0.offset_220 (* .cse7 4))))) (let ((.cse20 (select .cse5 (+ v_~f~0.offset_220 (* .cse10 4)))) (.cse18 (select .cse5 (+ v_~f~0.offset_220 (* .cse12 4))))) (let ((.cse15 (select .cse5 (+ v_~f~0.offset_220 (* .cse18 4)))) (.cse9 (select .cse5 (+ v_~f~0.offset_220 (* .cse20 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_220 (* .cse9 4)))) (.cse13 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse15))))) (let ((.cse8 (select .cse5 (+ v_~f~0.offset_220 (* .cse13 4)))) (.cse1 (select .cse5 (+ v_~f~0.offset_220 (* .cse3 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_220 (* .cse1 4)))) (.cse16 (select .cse5 (+ v_~f~0.offset_220 (* 4 .cse8))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_220 (* .cse16 4)))) (.cse19 (select .cse5 (+ v_~f~0.offset_220 (* .cse4 4))))) (let ((.cse11 (select .cse5 (+ v_~f~0.offset_220 (* .cse19 4)))) (.cse0 (select .cse5 (+ v_~f~0.offset_220 (* .cse2 4))))) (let ((.cse21 (select .cse5 (+ v_~f~0.offset_220 (* .cse0 4)))) (.cse14 (select .cse5 (+ v_~f~0.offset_220 (* .cse11 4))))) (let ((.cse6 (select .cse5 (+ v_~f~0.offset_220 (* .cse14 4)))) (.cse17 (select .cse5 (+ v_~f~0.offset_220 (* .cse21 4))))) (and (not (= (ite (and (< v_~x2~0_397 v_~size~0_226) (<= 0 v_~x2~0_397)) 1 0) 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_226) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_226) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< v_~x1~0_430 v_~size~0_226) (<= 0 v_~x1~0_430)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_226)) 1 0))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_226)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_321| 11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse6 4))) v_~x2~0_395) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_226) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|) (= |v_thread2Thread1of1ForFork1_~i~1#1_358| 12) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_226)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_226)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220| (ite (and (< .cse6 v_~size~0_226) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse15 v_~size~0_226) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_226) (<= 0 .cse16)) 1 0) 0)) (= (ite (and (< .cse17 v_~size~0_226) (<= 0 .cse17)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|) (not (= (ite (and (< .cse18 v_~size~0_226) (<= 0 .cse18)) 1 0) 0)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_226)) 1 0) 0)) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_226)) 1 0) 0)) (not (= 0 (ite (and (< .cse21 v_~size~0_226) (<= 0 .cse21)) 1 0))) (= (select .cse5 (+ v_~f~0.offset_220 (* .cse17 4))) v_~x1~0_429) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_321| 4294967293) 4294967296) (* (mod v_~n~0_206 1073741824) 4))))))))))))))) InVars {~x2~0=v_~x2~0_397, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, #memory_int=|v_#memory_int_310|, ~n~0=v_~n~0_206, ~x1~0=v_~x1~0_430, ~f~0.offset=v_~f~0.offset_220} OutVars{~x2~0=v_~x2~0_395, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_250|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_172|, ~size~0=v_~size~0_226, ~f~0.base=v_~f~0.base_220, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_160|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_220|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_358|, ~x1~0=v_~x1~0_429, ~f~0.offset=v_~f~0.offset_220, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_256|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_154|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_152|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_321|, #memory_int=|v_#memory_int_310|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_260|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_166|, ~n~0=v_~n~0_206, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_168|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_260|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [817] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_326| v_~f~0.base_230))) (let ((.cse0 (* (mod v_~n~0_216 1073741824) 4)) (.cse1 (select .cse2 (+ v_~f~0.offset_230 (* v_~x1~0_460 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_276| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_350| 4294967295) 4294967296) .cse0) (= (ite (and (< .cse1 v_~size~0_236) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_276|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_352| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280| 0)) (not (= (ite (and (< v_~x1~0_460 v_~size~0_236) (<= 0 v_~x1~0_460)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_230 (* .cse1 4))) v_~x1~0_458) (= |v_thread1Thread1of1ForFork0_~i~0#1_350| (+ |v_thread1Thread1of1ForFork0_~i~0#1_352| 2))))) InVars {~size~0=v_~size~0_236, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_352|, #memory_int=|v_#memory_int_326|, ~n~0=v_~n~0_216, ~x1~0=v_~x1~0_460, ~f~0.offset=v_~f~0.offset_230} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_276|, ~size~0=v_~size~0_236, ~f~0.base=v_~f~0.base_230, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_350|, #memory_int=|v_#memory_int_326|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_280|, ~n~0=v_~n~0_216, ~x1~0=v_~x1~0_458, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_280|, ~f~0.offset=v_~f~0.offset_230} 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 05:57:04,168 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_349| v_~f~0.base_250))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_250 (* v_~x2~0_465 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_250 (* 4 .cse4))))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_250 (* .cse7 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_250 (* v_~x1~0_521 4)))) (.cse0 (select .cse8 (+ v_~f~0.offset_250 (* .cse6 4))))) (let ((.cse11 (select .cse8 (+ v_~f~0.offset_250 (* .cse0 4)))) (.cse3 (select .cse8 (+ v_~f~0.offset_250 (* .cse2 4))))) (let ((.cse5 (select .cse8 (+ (* .cse3 4) v_~f~0.offset_250))) (.cse10 (select .cse8 (+ v_~f~0.offset_250 (* .cse11 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_250 (* .cse10 4)))) (.cse1 (select .cse8 (+ v_~f~0.offset_250 (* .cse5 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_317| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_256)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_256)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_317|) (not (= (ite (and (< .cse2 v_~size~0_256) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_256)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321| 0)) (< (mod (+ 4294967292 |v_thread2Thread1of1ForFork1_~i~1#1_410|) 4294967296) (* (mod v_~n~0_236 1073741824) 4)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_256)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_521) (< v_~x1~0_521 v_~size~0_256)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_410| 8) (not (= (ite (and (< .cse5 v_~size~0_256) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_256) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304| 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_256)) 1 0) 0)) (= (select .cse8 (+ v_~f~0.offset_250 (* .cse9 4))) v_~x2~0_463) (not (= (ite (and (< v_~x2~0_465 v_~size~0_256) (<= 0 v_~x2~0_465)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264| (ite (and (< .cse9 v_~size~0_256) (<= 0 .cse9)) 1 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_256)) 1 0) 0)) (= (select .cse8 (+ v_~f~0.offset_250 (* .cse1 4))) v_~x1~0_520) (= |v_thread1Thread1of1ForFork0_~i~0#1_401| 5) (not (= (ite (and (< .cse11 v_~size~0_256) (<= 0 .cse11)) 1 0) 0))))))))))) InVars {~x2~0=v_~x2~0_465, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_250, #memory_int=|v_#memory_int_349|, ~n~0=v_~n~0_236, ~x1~0=v_~x1~0_521, ~f~0.offset=v_~f~0.offset_250} OutVars{~x2~0=v_~x2~0_463, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_311|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_198|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_216|, ~size~0=v_~size~0_256, ~f~0.base=v_~f~0.base_250, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_264|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_410|, ~x1~0=v_~x1~0_520, ~f~0.offset=v_~f~0.offset_250, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_317|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_198|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_196|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_401|, #memory_int=|v_#memory_int_349|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_210|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_321|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_210|, ~n~0=v_~n~0_236, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_212|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_321|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#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, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:57:04,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_19| 4294967296) (* (mod v_~n~0_In_5 1073741824) 4))) (= |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_19|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_19|, ~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 [703] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4| (ite (and (< v_~x1~0_In_7 v_~size~0_In_17) (<= 0 v_~x1~0_In_7)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= v_~x1~0_Out_18 (select (select |v_#memory_int_In_38| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_11 1073741824) 4)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1))) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_38|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, 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_17, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_38|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_18, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} 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 05:57:05,091 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 05:57:05,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20631 [2022-12-06 05:57:05,092 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 1093 transitions, 35445 flow [2022-12-06 05:57:05,092 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 05:57:05,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:57:05,092 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:57:05,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-06 05:57:05,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:57:05,293 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 05:57:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:57:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash -332398474, now seen corresponding path program 1 times [2022-12-06 05:57:05,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:57:05,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049657697] [2022-12-06 05:57:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:57:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-06 05:57:53,985 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:57:53,987 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:57:53,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 05:57:53,987 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 16 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 3ms.. [2022-12-06 05:57:53,988 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:57:53,988 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:57:53,988 INFO L458 BasicCegarLoop]: Path program histogram: [3, 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] [2022-12-06 05:57:53,991 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:57:53,991 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:57:53,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:57:53 BasicIcfg [2022-12-06 05:57:53,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:57:53,993 INFO L158 Benchmark]: Toolchain (without parser) took 799894.17ms. Allocated memory was 159.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.4MB in the beginning and 725.6MB in the end (delta: -608.1MB). Peak memory consumption was 941.1MB. Max. memory is 8.0GB. [2022-12-06 05:57:53,993 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:57:53,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.84ms. Allocated memory is still 159.4MB. Free memory was 117.4MB in the beginning and 105.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:57:53,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.22ms. Allocated memory is still 159.4MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:57:53,994 INFO L158 Benchmark]: Boogie Preprocessor took 49.59ms. Allocated memory is still 159.4MB. Free memory was 103.8MB in the beginning and 102.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:57:53,994 INFO L158 Benchmark]: RCFGBuilder took 513.04ms. Allocated memory is still 159.4MB. Free memory was 102.2MB in the beginning and 84.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 05:57:53,994 INFO L158 Benchmark]: TraceAbstraction took 799014.35ms. Allocated memory was 159.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 84.4MB in the beginning and 725.6MB in the end (delta: -641.2MB). Peak memory consumption was 907.6MB. Max. memory is 8.0GB. [2022-12-06 05:57:53,995 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.12ms. Allocated memory is still 159.4MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.84ms. Allocated memory is still 159.4MB. Free memory was 117.4MB in the beginning and 105.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.22ms. Allocated memory is still 159.4MB. Free memory was 105.9MB in the beginning and 103.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.59ms. Allocated memory is still 159.4MB. Free memory was 103.8MB in the beginning and 102.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.04ms. Allocated memory is still 159.4MB. Free memory was 102.2MB in the beginning and 84.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 799014.35ms. Allocated memory was 159.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 84.4MB in the beginning and 725.6MB in the end (delta: -641.2MB). Peak memory consumption was 907.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 161 PlacesBefore, 21 PlacesAfterwards, 170 TransitionsBefore, 17 TransitionsAfterwards, 3242 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 71 ConcurrentYvCompositions, 13 ChoiceCompositions, 153 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2093, independent: 2091, independent conditional: 2091, 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: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, 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: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, 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: 2093, independent: 2091, independent conditional: 0, independent unconditional: 2091, 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: 1903, independent: 1901, independent conditional: 0, independent unconditional: 1901, 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: 1903, independent: 1901, independent conditional: 0, independent unconditional: 1901, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2093, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1903, unknown conditional: 0, unknown unconditional: 1903] , Statistics on independence cache: Total cache size (in pairs): 3766, Positive cache size: 3764, Positive conditional cache size: 0, Positive unconditional cache size: 3764, 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, 78 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: 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] , 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: 21, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, 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, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 4, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 10, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, 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: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 54 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): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, 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.1s, 26 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 34 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, independent unconditional: 1, 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: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, 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, 23 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 36 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): 12, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, 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: 3.1s, 37 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 15, Positive cache size: 15, Positive conditional cache size: 5, Positive unconditional cache size: 10, 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.5s, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 54 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): 17, Positive cache size: 17, Positive conditional cache size: 7, Positive unconditional cache size: 10, 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: 2.2s, 37 PlacesBefore, 36 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 21, Positive cache size: 21, Positive conditional cache size: 11, Positive unconditional cache size: 10, 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: 2.4s, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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): 26, Positive cache size: 26, Positive conditional cache size: 16, Positive unconditional cache size: 10, 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.4s, 45 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 120 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): 37, Positive cache size: 37, Positive conditional cache size: 27, Positive unconditional cache size: 10, 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, 53 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 142 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): 37, Positive cache size: 37, Positive conditional cache size: 27, Positive unconditional cache size: 10, 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.6s, 65 PlacesBefore, 64 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 67, Positive conditional cache size: 57, Positive unconditional cache size: 10, 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: 1.4s, 75 PlacesBefore, 75 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 198 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: 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): 70, Positive cache size: 70, Positive conditional cache size: 60, Positive unconditional cache size: 10, 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, 72 PlacesBefore, 72 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 192 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): 70, Positive cache size: 70, Positive conditional cache size: 60, Positive unconditional cache size: 10, 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.6s, 77 PlacesBefore, 77 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 216 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 79, Positive conditional cache size: 69, Positive unconditional cache size: 10, 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: 2.0s, 90 PlacesBefore, 89 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 100, Positive cache size: 100, Positive conditional cache size: 90, Positive unconditional cache size: 10, 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.9s, 107 PlacesBefore, 107 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 436 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): 119, Positive cache size: 119, Positive conditional cache size: 109, Positive unconditional cache size: 10, 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: 1.0s, 110 PlacesBefore, 110 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 470 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): 122, Positive cache size: 122, Positive conditional cache size: 112, Positive unconditional cache size: 10, 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: 3.9s, 120 PlacesBefore, 120 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 126, Positive cache size: 126, Positive conditional cache size: 116, Positive unconditional cache size: 10, 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: 1.5s, 126 PlacesBefore, 125 PlacesAfterwards, 159 TransitionsBefore, 158 TransitionsAfterwards, 536 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: 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): 129, Positive cache size: 129, Positive conditional cache size: 119, Positive unconditional cache size: 10, 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: 4.5s, 133 PlacesBefore, 132 PlacesAfterwards, 179 TransitionsBefore, 178 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 2, independent conditional: 2, 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): 136, Positive cache size: 136, Positive conditional cache size: 126, Positive unconditional cache size: 10, 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: 4.4s, 147 PlacesBefore, 147 PlacesAfterwards, 248 TransitionsBefore, 248 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 139, Positive cache size: 139, Positive conditional cache size: 129, Positive unconditional cache size: 10, 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: 2.6s, 142 PlacesBefore, 142 PlacesAfterwards, 245 TransitionsBefore, 245 TransitionsAfterwards, 920 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: 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): 144, Positive cache size: 144, Positive conditional cache size: 134, Positive unconditional cache size: 10, 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: 3.9s, 144 PlacesBefore, 144 PlacesAfterwards, 246 TransitionsBefore, 246 TransitionsAfterwards, 914 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): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, 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, 144 PlacesBefore, 144 PlacesAfterwards, 249 TransitionsBefore, 249 TransitionsAfterwards, 926 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): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, 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, 149 PlacesBefore, 149 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 942 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): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, 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, 152 PlacesBefore, 152 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 996 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): 145, Positive cache size: 145, Positive conditional cache size: 135, Positive unconditional cache size: 10, 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: 4.0s, 185 PlacesBefore, 184 PlacesAfterwards, 351 TransitionsBefore, 350 TransitionsAfterwards, 1146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 149, Positive cache size: 149, Positive conditional cache size: 139, Positive unconditional cache size: 10, 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.5s, 185 PlacesBefore, 185 PlacesAfterwards, 434 TransitionsBefore, 434 TransitionsAfterwards, 1474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 202, Positive cache size: 202, Positive conditional cache size: 192, Positive unconditional cache size: 10, 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: 4.2s, 197 PlacesBefore, 197 PlacesAfterwards, 458 TransitionsBefore, 458 TransitionsAfterwards, 1566 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: 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: 5, independent: 2, independent conditional: 2, 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): 233, Positive cache size: 233, Positive conditional cache size: 223, Positive unconditional cache size: 10, 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: 9.7s, 206 PlacesBefore, 205 PlacesAfterwards, 461 TransitionsBefore, 460 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 5, independent conditional: 5, 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): 266, Positive cache size: 266, Positive conditional cache size: 256, Positive unconditional cache size: 10, 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: 6.0s, 224 PlacesBefore, 224 PlacesAfterwards, 620 TransitionsBefore, 620 TransitionsAfterwards, 1708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 51, independent conditional: 51, 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: 51, independent: 51, independent conditional: 51, 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: 51, independent: 51, independent conditional: 51, 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: 51, independent: 51, independent conditional: 51, 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: 51, independent: 48, independent conditional: 48, 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): 269, Positive cache size: 269, Positive conditional cache size: 259, Positive unconditional cache size: 10, 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, 222 PlacesBefore, 222 PlacesAfterwards, 620 TransitionsBefore, 620 TransitionsAfterwards, 1718 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): 269, Positive cache size: 269, Positive conditional cache size: 259, Positive unconditional cache size: 10, 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, 237 PlacesBefore, 237 PlacesAfterwards, 652 TransitionsBefore, 652 TransitionsAfterwards, 1854 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): 269, Positive cache size: 269, Positive conditional cache size: 259, Positive unconditional cache size: 10, 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: 9.4s, 255 PlacesBefore, 255 PlacesAfterwards, 683 TransitionsBefore, 683 TransitionsAfterwards, 1888 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 22, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 283, Positive conditional cache size: 273, Positive unconditional cache size: 10, 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: 6.9s, 300 PlacesBefore, 300 PlacesAfterwards, 890 TransitionsBefore, 890 TransitionsAfterwards, 2470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 5, independent: 1, independent conditional: 1, 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): 296, Positive cache size: 296, Positive conditional cache size: 286, Positive unconditional cache size: 10, 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: 15.9s, 318 PlacesBefore, 318 PlacesAfterwards, 911 TransitionsBefore, 911 TransitionsAfterwards, 2530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 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: 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: 13, independent: 8, independent conditional: 8, 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): 348, Positive cache size: 348, Positive conditional cache size: 337, Positive unconditional cache size: 11, 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: 8.9s, 335 PlacesBefore, 333 PlacesAfterwards, 969 TransitionsBefore, 967 TransitionsAfterwards, 2670 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 11, independent: 8, independent conditional: 8, 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): 401, Positive cache size: 401, Positive conditional cache size: 390, Positive unconditional cache size: 11, 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: 19.5s, 349 PlacesBefore, 347 PlacesAfterwards, 1095 TransitionsBefore, 1093 TransitionsAfterwards, 2920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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: 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: 8, independent: 1, independent conditional: 1, 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): 433, Positive cache size: 433, Positive conditional cache size: 422, Positive unconditional cache size: 11, 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 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 16 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 3ms.. - TimeoutResultAtElement [Line: 88]: 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 16 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 3ms.. - TimeoutResultAtElement [Line: 89]: 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 16 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 237 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: 798.8s, OverallIterations: 42, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 378.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 29 mSolverCounterUnknown, 2146 SdHoareTripleChecker+Valid, 273.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2146 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 268.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 91 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 2571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17351 IncrementalHoareTripleChecker+Invalid, 20042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2571 mSolverCounterUnsat, 8 mSDtfsCounter, 17351 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1326 GetRequests, 770 SyntacticMatches, 20 SemanticMatches, 536 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 80.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35445occurred in iteration=41, InterpolantAutomatonStates: 422, 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, 3.0s SatisfiabilityAnalysisTime, 224.0s InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1349 ConstructedInterpolants, 17 QuantifiedInterpolants, 122619 SizeOfPredicates, 266 NumberOfNonLiveVariables, 6436 ConjunctsInSsa, 895 ConjunctsInUnsatCore, 102 InterpolantComputations, 11 PerfectInterpolantSequences, 70/302 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 [2022-12-06 05:57:54,024 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 Completed graceful shutdown