/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/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:21:00,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:21:00,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:21:00,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:21:00,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:21:00,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:21:00,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:21:00,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:21:00,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:21:00,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:21:00,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:21:00,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:21:00,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:21:00,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:21:00,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:21:00,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:21:00,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:21:00,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:21:00,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:21:00,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:21:00,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:21:00,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:21:00,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:21:00,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:21:00,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:21:00,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:21:00,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:21:00,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:21:00,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:21:00,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:21:00,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:21:00,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:21:00,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:21:00,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:21:00,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:21:00,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:21:00,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:21:00,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:21:00,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:21:00,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:21:00,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:21:00,588 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-13 10:21:00,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:21:00,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:21:00,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:21:00,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:21:00,626 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:21:00,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:21:00,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:21:00,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:21:00,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:21:00,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:21:00,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:21:00,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:21:00,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:21:00,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:21:00,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:21:00,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:21:00,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:21:00,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:21:00,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:21:00,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:21:00,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:21:00,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:21:00,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:21:00,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:21:00,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:21:00,630 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:21:00,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:21:00,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:21:00,630 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:21:00,631 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-13 10:21:00,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:21:00,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:21:00,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:21:00,964 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:21:00,965 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:21:00,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-12-13 10:21:02,055 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:21:02,266 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:21:02,267 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-12-13 10:21:02,275 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99e2f4f1/ded75ecc160a4d1e93c6ab75c683c428/FLAG8736ccd37 [2022-12-13 10:21:02,289 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99e2f4f1/ded75ecc160a4d1e93c6ab75c683c428 [2022-12-13 10:21:02,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:21:02,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:21:02,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:21:02,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:21:02,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:21:02,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788fb17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02, skipping insertion in model container [2022-12-13 10:21:02,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:21:02,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:21:02,504 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/fibonacci.wvr.c[2330,2343] [2022-12-13 10:21:02,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:21:02,528 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:21:02,563 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/fibonacci.wvr.c[2330,2343] [2022-12-13 10:21:02,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:21:02,581 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:21:02,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02 WrapperNode [2022-12-13 10:21:02,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:21:02,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:21:02,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:21:02,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:21:02,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,637 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 162 [2022-12-13 10:21:02,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:21:02,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:21:02,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:21:02,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:21:02,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:21:02,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:21:02,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:21:02,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:21:02,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (1/1) ... [2022-12-13 10:21:02,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:21:02,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:21:02,705 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-13 10:21:02,726 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-13 10:21:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:21:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:21:02,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:21:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:21:02,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:21:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:21:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:21:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:21:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:21:02,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:21:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:21:02,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:21:02,754 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:21:02,835 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:21:02,837 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:21:03,155 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:21:03,164 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:21:03,164 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 10:21:03,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:21:03 BoogieIcfgContainer [2022-12-13 10:21:03,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:21:03,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:21:03,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:21:03,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:21:03,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:21:02" (1/3) ... [2022-12-13 10:21:03,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6f5f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:21:03, skipping insertion in model container [2022-12-13 10:21:03,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:21:02" (2/3) ... [2022-12-13 10:21:03,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6f5f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:21:03, skipping insertion in model container [2022-12-13 10:21:03,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:21:03" (3/3) ... [2022-12-13 10:21:03,180 INFO L112 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2022-12-13 10:21:03,198 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:21:03,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:21:03,199 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:21:03,339 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 10:21:03,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 189 transitions, 394 flow [2022-12-13 10:21:03,495 INFO L130 PetriNetUnfolder]: 14/187 cut-off events. [2022-12-13 10:21:03,496 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:21:03,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 187 events. 14/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2022-12-13 10:21:03,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 189 transitions, 394 flow [2022-12-13 10:21:03,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 179 transitions, 370 flow [2022-12-13 10:21:03,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:03,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 179 transitions, 370 flow [2022-12-13 10:21:03,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 179 transitions, 370 flow [2022-12-13 10:21:03,589 INFO L130 PetriNetUnfolder]: 14/179 cut-off events. [2022-12-13 10:21:03,589 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:21:03,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 179 events. 14/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2022-12-13 10:21:03,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 179 transitions, 370 flow [2022-12-13 10:21:03,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 7452 [2022-12-13 10:21:10,361 INFO L241 LiptonReduction]: Total number of compositions: 164 [2022-12-13 10:21:10,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:21:10,385 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;@4b3151d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:21:10,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 10:21:10,390 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 10:21:10,390 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:21:10,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:10,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:10,391 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-13 10:21:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2113518840, now seen corresponding path program 1 times [2022-12-13 10:21:10,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:10,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054548856] [2022-12-13 10:21:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:11,002 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-13 10:21:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:11,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054548856] [2022-12-13 10:21:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054548856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:11,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:11,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:21:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660211840] [2022-12-13 10:21:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:11,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:21:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:21:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:21:11,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 10:21:11,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-13 10:21:11,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:11,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 10:21:11,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:11,157 INFO L130 PetriNetUnfolder]: 64/119 cut-off events. [2022-12-13 10:21:11,157 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 10:21:11,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 119 events. 64/119 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 334 event pairs, 7 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 181. Up to 85 conditions per place. [2022-12-13 10:21:11,161 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 23 selfloop transitions, 5 changer transitions 5/35 dead transitions. [2022-12-13 10:21:11,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 35 transitions, 166 flow [2022-12-13 10:21:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:21:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:21:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 10:21:11,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 10:21:11,173 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 5 states and 44 transitions. [2022-12-13 10:21:11,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 35 transitions, 166 flow [2022-12-13 10:21:11,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 10:21:11,177 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 68 flow [2022-12-13 10:21:11,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 10:21:11,182 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-13 10:21:11,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:11,183 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 68 flow [2022-12-13 10:21:11,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:11,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:11,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 68 flow [2022-12-13 10:21:11,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 68 flow [2022-12-13 10:21:11,198 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-13 10:21:11,199 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:21:11,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 35 events. 8/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 75 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 58. Up to 11 conditions per place. [2022-12-13 10:21:11,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 68 flow [2022-12-13 10:21:11,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 10:21:11,242 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:11,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:11,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 370 [2022-12-13 10:21:11,552 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 72 flow [2022-12-13 10:21:11,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-13 10:21:11,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:11,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:11,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:21:11,553 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-13 10:21:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1937234240, now seen corresponding path program 2 times [2022-12-13 10:21:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:11,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048769575] [2022-12-13 10:21:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:11,791 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-13 10:21:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:11,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048769575] [2022-12-13 10:21:11,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048769575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:11,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:11,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:21:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361930236] [2022-12-13 10:21:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:11,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:21:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:21:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:21:11,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-13 10:21:11,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-13 10:21:11,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:11,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-13 10:21:11,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:11,882 INFO L130 PetriNetUnfolder]: 63/111 cut-off events. [2022-12-13 10:21:11,883 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-13 10:21:11,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 111 events. 63/111 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 289 event pairs, 1 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 320. Up to 85 conditions per place. [2022-12-13 10:21:11,884 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 20 selfloop transitions, 6 changer transitions 6/34 dead transitions. [2022-12-13 10:21:11,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 180 flow [2022-12-13 10:21:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:21:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:21:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 10:21:11,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-13 10:21:11,885 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 72 flow. Second operand 5 states and 43 transitions. [2022-12-13 10:21:11,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 180 flow [2022-12-13 10:21:11,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 178 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 10:21:11,887 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 94 flow [2022-12-13 10:21:11,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-13 10:21:11,888 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-13 10:21:11,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:11,888 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 94 flow [2022-12-13 10:21:11,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:11,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:11,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 94 flow [2022-12-13 10:21:11,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 94 flow [2022-12-13 10:21:11,894 INFO L130 PetriNetUnfolder]: 10/34 cut-off events. [2022-12-13 10:21:11,894 INFO L131 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2022-12-13 10:21:11,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 34 events. 10/34 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 74. Up to 13 conditions per place. [2022-12-13 10:21:11,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 94 flow [2022-12-13 10:21:11,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 10:21:11,895 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:11,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 10:21:11,896 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 94 flow [2022-12-13 10:21:11,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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-13 10:21:11,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:11,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:11,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:21:11,897 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-13 10:21:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash -50351282, now seen corresponding path program 1 times [2022-12-13 10:21:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:11,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649557052] [2022-12-13 10:21:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:11,944 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-13 10:21:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:11,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649557052] [2022-12-13 10:21:11,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649557052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:11,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:11,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174319918] [2022-12-13 10:21:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:11,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:11,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:11,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:11,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:21:11,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 94 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-13 10:21:11,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:11,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:21:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:12,006 INFO L130 PetriNetUnfolder]: 89/160 cut-off events. [2022-12-13 10:21:12,006 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-13 10:21:12,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 160 events. 89/160 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 445 event pairs, 26 based on Foata normal form. 2/148 useless extension candidates. Maximal degree in co-relation 504. Up to 102 conditions per place. [2022-12-13 10:21:12,008 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 31 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2022-12-13 10:21:12,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 258 flow [2022-12-13 10:21:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:12,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 10:21:12,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-13 10:21:12,009 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 94 flow. Second operand 4 states and 33 transitions. [2022-12-13 10:21:12,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 258 flow [2022-12-13 10:21:12,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 39 transitions, 224 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 10:21:12,011 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 133 flow [2022-12-13 10:21:12,012 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-13 10:21:12,012 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-13 10:21:12,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:12,012 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 133 flow [2022-12-13 10:21:12,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:12,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:12,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 133 flow [2022-12-13 10:21:12,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 133 flow [2022-12-13 10:21:12,020 INFO L130 PetriNetUnfolder]: 15/52 cut-off events. [2022-12-13 10:21:12,020 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-13 10:21:12,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 52 events. 15/52 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 105. Up to 19 conditions per place. [2022-12-13 10:21:12,020 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 133 flow [2022-12-13 10:21:12,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-13 10:21:12,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] $Ultimate##0-->L44-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:12,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:12,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 353 [2022-12-13 10:21:12,365 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 137 flow [2022-12-13 10:21:12,365 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-13 10:21:12,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:12,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:12,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:21:12,365 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-13 10:21:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 223640520, now seen corresponding path program 2 times [2022-12-13 10:21:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69341348] [2022-12-13 10:21:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:12,424 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-13 10:21:12,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:12,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69341348] [2022-12-13 10:21:12,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69341348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:12,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:12,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609653051] [2022-12-13 10:21:12,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:12,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:12,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:12,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:12,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:12,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 10:21:12,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 137 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-13 10:21:12,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:12,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 10:21:12,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:12,486 INFO L130 PetriNetUnfolder]: 103/188 cut-off events. [2022-12-13 10:21:12,487 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 10:21:12,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 188 events. 103/188 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 570 event pairs, 25 based on Foata normal form. 2/190 useless extension candidates. Maximal degree in co-relation 183. Up to 111 conditions per place. [2022-12-13 10:21:12,488 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 33 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2022-12-13 10:21:12,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 42 transitions, 280 flow [2022-12-13 10:21:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 10:21:12,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 10:21:12,491 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 137 flow. Second operand 4 states and 36 transitions. [2022-12-13 10:21:12,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 42 transitions, 280 flow [2022-12-13 10:21:12,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 42 transitions, 266 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 10:21:12,493 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 175 flow [2022-12-13 10:21:12,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2022-12-13 10:21:12,494 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-13 10:21:12,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:12,494 INFO L89 Accepts]: Start accepts. Operand has 30 places, 28 transitions, 175 flow [2022-12-13 10:21:12,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:12,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:12,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 175 flow [2022-12-13 10:21:12,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 175 flow [2022-12-13 10:21:12,516 INFO L130 PetriNetUnfolder]: 12/53 cut-off events. [2022-12-13 10:21:12,516 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-13 10:21:12,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 53 events. 12/53 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 156 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2022-12-13 10:21:12,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 175 flow [2022-12-13 10:21:12,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 10:21:12,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] $Ultimate##0-->L54-5: 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 [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:13,101 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:13,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 609 [2022-12-13 10:21:13,103 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 173 flow [2022-12-13 10:21:13,103 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-13 10:21:13,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:13,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:13,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:21:13,103 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-13 10:21:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1973876871, now seen corresponding path program 1 times [2022-12-13 10:21:13,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:13,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115133521] [2022-12-13 10:21:13,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:13,170 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-13 10:21:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:13,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115133521] [2022-12-13 10:21:13,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115133521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:13,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:13,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:21:13,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688069546] [2022-12-13 10:21:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:13,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:21:13,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:13,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:21:13,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:21:13,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:21:13,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:13,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:13,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:21:13,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:13,273 INFO L130 PetriNetUnfolder]: 113/204 cut-off events. [2022-12-13 10:21:13,274 INFO L131 PetriNetUnfolder]: For 307/307 co-relation queries the response was YES. [2022-12-13 10:21:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 204 events. 113/204 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 626 event pairs, 34 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 379. Up to 144 conditions per place. [2022-12-13 10:21:13,277 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 38 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-12-13 10:21:13,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 346 flow [2022-12-13 10:21:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:21:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:21:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 10:21:13,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-13 10:21:13,279 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 173 flow. Second operand 5 states and 44 transitions. [2022-12-13 10:21:13,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 346 flow [2022-12-13 10:21:13,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 328 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:13,282 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 204 flow [2022-12-13 10:21:13,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-13 10:21:13,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2022-12-13 10:21:13,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:13,285 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 204 flow [2022-12-13 10:21:13,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:13,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:13,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 204 flow [2022-12-13 10:21:13,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 204 flow [2022-12-13 10:21:13,294 INFO L130 PetriNetUnfolder]: 17/62 cut-off events. [2022-12-13 10:21:13,295 INFO L131 PetriNetUnfolder]: For 52/55 co-relation queries the response was YES. [2022-12-13 10:21:13,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 62 events. 17/62 cut-off events. For 52/55 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 202 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 156. Up to 21 conditions per place. [2022-12-13 10:21:13,295 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 204 flow [2022-12-13 10:21:13,295 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 10:21:13,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L44-5: Formula: (and (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_61| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_61| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_61| 2147483648))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_55| (+ v_~n_0~0_75 1)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_61| |v_thread1Thread1of1ForFork0_minus_#in~a#1_27|) (= |v_thread1Thread1of1ForFork0_~i~0#1_55| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_29| v_~f2_3~0_90) (= v_~f1_2~0_100 |v_thread1Thread1of1ForFork0_plus_#res#1_45|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_61|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_61| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_61|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_31| v_~f2_3~0_90) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_43| 2147483647) (= v_~f1_2~0_101 |v_thread1Thread1of1ForFork0_plus_#in~a#1_31|) (= v_~f2_3~0_89 |v_thread1Thread1of1ForFork0_minus_#res#1_43|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_45| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_49| |v_thread1Thread1of1ForFork0_plus_~b#1_49|)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_31| |v_thread1Thread1of1ForFork0_plus_~a#1_49|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#res#1_43|) |v_thread1Thread1of1ForFork0_minus_~a#1_61|) (= v_~f1_2~0_100 |v_thread1Thread1of1ForFork0_minus_#in~a#1_27|) (<= v_~f1_2~0_100 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_31| |v_thread1Thread1of1ForFork0_plus_~b#1_49|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_61| |v_thread1Thread1of1ForFork0_minus_#in~b#1_29|) (<= 0 (+ v_~f1_2~0_100 2147483648))) InVars {~f1_2~0=v_~f1_2~0_101, ~f2_3~0=v_~f2_3~0_90, ~n_0~0=v_~n_0~0_75} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_43|, ~f2_3~0=v_~f2_3~0_89, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_49|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_27|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_45|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_49|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_31|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, ~f1_2~0=v_~f1_2~0_100, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_27|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_61|, ~n_0~0=v_~n_0~0_75, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_55|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_37|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_45|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:14,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:14,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1147 [2022-12-13 10:21:14,432 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 214 flow [2022-12-13 10:21:14,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:14,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:14,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:14,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:21:14,433 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-13 10:21:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1569438665, now seen corresponding path program 1 times [2022-12-13 10:21:14,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:14,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836354543] [2022-12-13 10:21:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:14,481 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-13 10:21:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836354543] [2022-12-13 10:21:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836354543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:14,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840945687] [2022-12-13 10:21:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:14,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:14,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:14,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 10:21:14,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:14,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:14,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 10:21:14,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:14,557 INFO L130 PetriNetUnfolder]: 99/189 cut-off events. [2022-12-13 10:21:14,557 INFO L131 PetriNetUnfolder]: For 402/406 co-relation queries the response was YES. [2022-12-13 10:21:14,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 189 events. 99/189 cut-off events. For 402/406 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 653 event pairs, 28 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 483. Up to 126 conditions per place. [2022-12-13 10:21:14,559 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 32 selfloop transitions, 8 changer transitions 3/44 dead transitions. [2022-12-13 10:21:14,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 351 flow [2022-12-13 10:21:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 10:21:14,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-13 10:21:14,560 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 214 flow. Second operand 4 states and 41 transitions. [2022-12-13 10:21:14,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 351 flow [2022-12-13 10:21:14,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 335 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 10:21:14,563 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 212 flow [2022-12-13 10:21:14,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-13 10:21:14,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-13 10:21:14,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:14,564 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 212 flow [2022-12-13 10:21:14,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:14,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:14,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 212 flow [2022-12-13 10:21:14,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 212 flow [2022-12-13 10:21:14,572 INFO L130 PetriNetUnfolder]: 16/61 cut-off events. [2022-12-13 10:21:14,572 INFO L131 PetriNetUnfolder]: For 65/68 co-relation queries the response was YES. [2022-12-13 10:21:14,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 61 events. 16/61 cut-off events. For 65/68 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 198 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 160. Up to 17 conditions per place. [2022-12-13 10:21:14,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 212 flow [2022-12-13 10:21:14,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 10:21:14,574 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:14,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 10:21:14,575 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 212 flow [2022-12-13 10:21:14,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:14,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:14,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:14,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:21:14,575 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-13 10:21:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1823666452, now seen corresponding path program 1 times [2022-12-13 10:21:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:14,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783960757] [2022-12-13 10:21:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:14,618 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-13 10:21:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:14,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783960757] [2022-12-13 10:21:14,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783960757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:14,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:14,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832359120] [2022-12-13 10:21:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:14,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:14,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:21:14,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 212 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-13 10:21:14,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:14,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:21:14,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:14,710 INFO L130 PetriNetUnfolder]: 111/202 cut-off events. [2022-12-13 10:21:14,710 INFO L131 PetriNetUnfolder]: For 477/477 co-relation queries the response was YES. [2022-12-13 10:21:14,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 202 events. 111/202 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 634 event pairs, 35 based on Foata normal form. 6/208 useless extension candidates. Maximal degree in co-relation 561. Up to 131 conditions per place. [2022-12-13 10:21:14,712 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 37 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2022-12-13 10:21:14,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 359 flow [2022-12-13 10:21:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 10:21:14,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 10:21:14,713 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 212 flow. Second operand 4 states and 38 transitions. [2022-12-13 10:21:14,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 359 flow [2022-12-13 10:21:14,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 347 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 10:21:14,715 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 227 flow [2022-12-13 10:21:14,716 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-13 10:21:14,716 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2022-12-13 10:21:14,716 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:14,716 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 227 flow [2022-12-13 10:21:14,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:14,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:14,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 227 flow [2022-12-13 10:21:14,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 227 flow [2022-12-13 10:21:14,727 INFO L130 PetriNetUnfolder]: 17/63 cut-off events. [2022-12-13 10:21:14,727 INFO L131 PetriNetUnfolder]: For 89/92 co-relation queries the response was YES. [2022-12-13 10:21:14,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 63 events. 17/63 cut-off events. For 89/92 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 204 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 175. Up to 18 conditions per place. [2022-12-13 10:21:14,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 227 flow [2022-12-13 10:21:14,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 10:21:14,728 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:14,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 10:21:14,729 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 227 flow [2022-12-13 10:21:14,729 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-13 10:21:14,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:14,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:14,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:21:14,730 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-13 10:21:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -168560641, now seen corresponding path program 1 times [2022-12-13 10:21:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:14,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780778369] [2022-12-13 10:21:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:14,766 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-13 10:21:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:14,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780778369] [2022-12-13 10:21:14,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780778369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:14,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:14,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331690687] [2022-12-13 10:21:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:14,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 10:21:14,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:14,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:14,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 10:21:14,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:14,853 INFO L130 PetriNetUnfolder]: 118/211 cut-off events. [2022-12-13 10:21:14,854 INFO L131 PetriNetUnfolder]: For 725/734 co-relation queries the response was YES. [2022-12-13 10:21:14,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 211 events. 118/211 cut-off events. For 725/734 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 699 event pairs, 30 based on Foata normal form. 9/219 useless extension candidates. Maximal degree in co-relation 584. Up to 142 conditions per place. [2022-12-13 10:21:14,857 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-13 10:21:14,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 370 flow [2022-12-13 10:21:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-13 10:21:14,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-13 10:21:14,858 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 227 flow. Second operand 4 states and 39 transitions. [2022-12-13 10:21:14,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 370 flow [2022-12-13 10:21:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 352 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:14,861 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 237 flow [2022-12-13 10:21:14,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-13 10:21:14,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2022-12-13 10:21:14,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:14,861 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 237 flow [2022-12-13 10:21:14,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:14,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:14,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 237 flow [2022-12-13 10:21:14,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 237 flow [2022-12-13 10:21:14,871 INFO L130 PetriNetUnfolder]: 18/66 cut-off events. [2022-12-13 10:21:14,871 INFO L131 PetriNetUnfolder]: For 95/98 co-relation queries the response was YES. [2022-12-13 10:21:14,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 66 events. 18/66 cut-off events. For 95/98 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 221 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 188. Up to 19 conditions per place. [2022-12-13 10:21:14,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 237 flow [2022-12-13 10:21:14,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 10:21:14,872 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:14,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 10:21:14,873 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 237 flow [2022-12-13 10:21:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:14,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:14,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:14,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:21:14,874 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-13 10:21:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1451306272, now seen corresponding path program 1 times [2022-12-13 10:21:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:14,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217374465] [2022-12-13 10:21:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:15,233 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-13 10:21:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:15,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217374465] [2022-12-13 10:21:15,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217374465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:15,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:15,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:21:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844407226] [2022-12-13 10:21:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:15,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:21:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:15,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:21:15,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:21:15,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-13 10:21:15,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:15,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:15,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-13 10:21:15,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:15,426 INFO L130 PetriNetUnfolder]: 119/224 cut-off events. [2022-12-13 10:21:15,426 INFO L131 PetriNetUnfolder]: For 652/663 co-relation queries the response was YES. [2022-12-13 10:21:15,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 224 events. 119/224 cut-off events. For 652/663 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 798 event pairs, 14 based on Foata normal form. 5/226 useless extension candidates. Maximal degree in co-relation 673. Up to 173 conditions per place. [2022-12-13 10:21:15,428 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 31 selfloop transitions, 14 changer transitions 7/55 dead transitions. [2022-12-13 10:21:15,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 430 flow [2022-12-13 10:21:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:21:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:21:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-13 10:21:15,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4357142857142857 [2022-12-13 10:21:15,429 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 237 flow. Second operand 7 states and 61 transitions. [2022-12-13 10:21:15,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 430 flow [2022-12-13 10:21:15,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 412 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:15,432 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 289 flow [2022-12-13 10:21:15,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-13 10:21:15,433 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2022-12-13 10:21:15,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:15,433 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 289 flow [2022-12-13 10:21:15,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:15,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:15,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 289 flow [2022-12-13 10:21:15,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 289 flow [2022-12-13 10:21:15,444 INFO L130 PetriNetUnfolder]: 21/82 cut-off events. [2022-12-13 10:21:15,444 INFO L131 PetriNetUnfolder]: For 160/165 co-relation queries the response was YES. [2022-12-13 10:21:15,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 82 events. 21/82 cut-off events. For 160/165 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 315 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 279. Up to 20 conditions per place. [2022-12-13 10:21:15,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 289 flow [2022-12-13 10:21:15,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 10:21:15,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:16,913 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:21:16,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1481 [2022-12-13 10:21:16,914 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 303 flow [2022-12-13 10:21:16,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:16,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:16,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:16,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:21:16,914 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-13 10:21:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2145457438, now seen corresponding path program 1 times [2022-12-13 10:21:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:16,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212824088] [2022-12-13 10:21:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:16,960 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-13 10:21:16,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:16,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212824088] [2022-12-13 10:21:16,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212824088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:16,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:16,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142058245] [2022-12-13 10:21:16,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:16,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:16,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:16,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:16,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 10:21:16,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 303 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-13 10:21:16,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:16,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 10:21:16,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:17,048 INFO L130 PetriNetUnfolder]: 133/246 cut-off events. [2022-12-13 10:21:17,049 INFO L131 PetriNetUnfolder]: For 879/879 co-relation queries the response was YES. [2022-12-13 10:21:17,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 246 events. 133/246 cut-off events. For 879/879 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 865 event pairs, 38 based on Foata normal form. 4/248 useless extension candidates. Maximal degree in co-relation 1130. Up to 178 conditions per place. [2022-12-13 10:21:17,051 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 36 selfloop transitions, 11 changer transitions 1/48 dead transitions. [2022-12-13 10:21:17,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 481 flow [2022-12-13 10:21:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 10:21:17,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 10:21:17,052 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 303 flow. Second operand 4 states and 37 transitions. [2022-12-13 10:21:17,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 481 flow [2022-12-13 10:21:17,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 445 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 10:21:17,056 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 305 flow [2022-12-13 10:21:17,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-12-13 10:21:17,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2022-12-13 10:21:17,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:17,057 INFO L89 Accepts]: Start accepts. Operand has 47 places, 36 transitions, 305 flow [2022-12-13 10:21:17,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:17,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:17,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 305 flow [2022-12-13 10:21:17,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 305 flow [2022-12-13 10:21:17,068 INFO L130 PetriNetUnfolder]: 22/81 cut-off events. [2022-12-13 10:21:17,068 INFO L131 PetriNetUnfolder]: For 149/156 co-relation queries the response was YES. [2022-12-13 10:21:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 81 events. 22/81 cut-off events. For 149/156 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 301 event pairs, 0 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 263. Up to 23 conditions per place. [2022-12-13 10:21:17,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 305 flow [2022-12-13 10:21:17,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-13 10:21:17,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| v_~f2_3~0_98) (= v_~f1_6~0_104 |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483648)) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_plus_#res#1_49|) (<= 0 (+ v_~f1_2~0_108 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| |v_thread1Thread1of1ForFork0_plus_~b#1_53|) (<= 0 (+ v_~f2_7~0_111 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| v_~f1_6~0_104) (<= v_~f1_2~0_108 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 1) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_~b#1_59|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_65| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_65|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_65|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_49| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_53| |v_thread1Thread1of1ForFork0_plus_~b#1_53|)) (< |v_thread2Thread1of1ForFork1_~i~1#1_68| v_~n_0~0_85) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_35| |v_thread1Thread1of1ForFork0_plus_~a#1_53|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_47| 2147483647) (= v_~f1_2~0_109 |v_thread1Thread1of1ForFork0_plus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_59| |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) 1 0)) (= v_~f1_6~0_105 |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_111 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= v_~f2_3~0_97 |v_thread1Thread1of1ForFork0_minus_#res#1_47|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|) (<= v_~f2_7~0_111 2147483647) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| v_~f2_3~0_98) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_68|) |v_thread2Thread1of1ForFork1_~i~1#1_67|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (< |v_thread1Thread1of1ForFork0_~i~0#1_65| (+ v_~n_0~0_85 1)) (= |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|)) InVars {~f1_2~0=v_~f1_2~0_109, ~f2_3~0=v_~f2_3~0_98, ~n_0~0=v_~n_0~0_85, ~f2_7~0=v_~f2_7~0_112, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_68|, ~f1_6~0=v_~f1_6~0_105} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_31|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_57|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_35|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_67|, ~f1_6~0=v_~f1_6~0_104, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_41|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_63|, ~f1_2~0=v_~f1_2~0_108, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_41|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_39|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_59|, ~n_0~0=v_~n_0~0_85, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_47|, ~f2_3~0=v_~f2_3~0_97, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_53|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_63|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_53|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_65|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_65|, ~f2_7~0=v_~f2_7~0_111, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_49|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_35|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [773] L44-5-->L54-5: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_72| v_~n_0~0_89) (= v_~f1_6~0_108 |v_thread2Thread1of1ForFork1_minus_#in~a#1_43|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_72|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_41| v_~f1_6~0_108) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_41| 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_59| |v_thread2Thread1of1ForFork1_plus_~b#1_61|) |v_thread2Thread1of1ForFork1_plus_#res#1_41|) (= v_~f1_6~0_109 |v_thread2Thread1of1ForFork1_plus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (= v_~f2_7~0_116 |v_thread2Thread1of1ForFork1_minus_#in~b#1_43|) (= v_~f2_7~0_115 |v_thread2Thread1of1ForFork1_minus_#res#1_49|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#res#1_49|)) (<= v_~f2_7~0_115 2147483647) (<= 0 (+ v_~f2_7~0_115 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_65| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_65|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_61| |v_thread2Thread1of1ForFork1_plus_#in~b#1_35|) (= v_~l_4~0_61 (ite (< 0 v_~f1_2~0_118) 1 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_71| v_~n_0~0_89)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_41| 2147483647) (= v_~f2_7~0_116 |v_thread2Thread1of1ForFork1_plus_#in~b#1_35|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_59| |v_thread2Thread1of1ForFork1_plus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_65| |v_thread2Thread1of1ForFork1_minus_#in~b#1_43|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_65| |v_thread2Thread1of1ForFork1_minus_#in~a#1_43|)) InVars {~f1_2~0=v_~f1_2~0_118, ~n_0~0=v_~n_0~0_89, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_71|, ~f2_7~0=v_~f2_7~0_116, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_72|, ~f1_6~0=v_~f1_6~0_109} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_31|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_35|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_65|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_59|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f1_6~0=v_~f1_6~0_108, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_43|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_35|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, ~f1_2~0=v_~f1_2~0_118, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_43|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_41|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_61|, ~n_0~0=v_~n_0~0_89, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_71|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_43|, ~f2_7~0=v_~f2_7~0_115, ~l_4~0=v_~l_4~0_61, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_43|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:21:18,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:18,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1341 [2022-12-13 10:21:18,398 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 312 flow [2022-12-13 10:21:18,398 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-13 10:21:18,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:18,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:18,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 10:21:18,398 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-13 10:21:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1327189189, now seen corresponding path program 1 times [2022-12-13 10:21:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:18,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523190277] [2022-12-13 10:21:18,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:18,526 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-13 10:21:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:18,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523190277] [2022-12-13 10:21:18,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523190277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:18,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:18,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764153229] [2022-12-13 10:21:18,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:18,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:18,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:18,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:18,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 10:21:18,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 312 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-13 10:21:18,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:18,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 10:21:18,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:18,613 INFO L130 PetriNetUnfolder]: 137/254 cut-off events. [2022-12-13 10:21:18,614 INFO L131 PetriNetUnfolder]: For 924/924 co-relation queries the response was YES. [2022-12-13 10:21:18,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 254 events. 137/254 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 899 event pairs, 42 based on Foata normal form. 6/260 useless extension candidates. Maximal degree in co-relation 1011. Up to 186 conditions per place. [2022-12-13 10:21:18,616 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 36 selfloop transitions, 11 changer transitions 1/48 dead transitions. [2022-12-13 10:21:18,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 472 flow [2022-12-13 10:21:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 10:21:18,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2022-12-13 10:21:18,617 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 312 flow. Second operand 4 states and 37 transitions. [2022-12-13 10:21:18,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 472 flow [2022-12-13 10:21:18,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 450 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:18,621 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 310 flow [2022-12-13 10:21:18,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-13 10:21:18,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2022-12-13 10:21:18,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:18,622 INFO L89 Accepts]: Start accepts. Operand has 49 places, 36 transitions, 310 flow [2022-12-13 10:21:18,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:18,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:18,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 310 flow [2022-12-13 10:21:18,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 310 flow [2022-12-13 10:21:18,638 INFO L130 PetriNetUnfolder]: 23/87 cut-off events. [2022-12-13 10:21:18,638 INFO L131 PetriNetUnfolder]: For 212/222 co-relation queries the response was YES. [2022-12-13 10:21:18,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 87 events. 23/87 cut-off events. For 212/222 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 345 event pairs, 0 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 288. Up to 22 conditions per place. [2022-12-13 10:21:18,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 310 flow [2022-12-13 10:21:18,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 10:21:18,640 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:18,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 10:21:18,642 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 310 flow [2022-12-13 10:21:18,642 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-13 10:21:18,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:18,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:18,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:21:18,644 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-13 10:21:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1368189382, now seen corresponding path program 2 times [2022-12-13 10:21:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:18,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733380055] [2022-12-13 10:21:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:19,002 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-13 10:21:19,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:19,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733380055] [2022-12-13 10:21:19,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733380055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:19,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:19,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:19,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846388887] [2022-12-13 10:21:19,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:19,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:21:19,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:19,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:21:19,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:21:19,004 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-13 10:21:19,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:19,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:19,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-13 10:21:19,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:19,150 INFO L130 PetriNetUnfolder]: 122/227 cut-off events. [2022-12-13 10:21:19,150 INFO L131 PetriNetUnfolder]: For 1003/1016 co-relation queries the response was YES. [2022-12-13 10:21:19,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 227 events. 122/227 cut-off events. For 1003/1016 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 827 event pairs, 18 based on Foata normal form. 9/228 useless extension candidates. Maximal degree in co-relation 932. Up to 185 conditions per place. [2022-12-13 10:21:19,153 INFO L137 encePairwiseOnDemand]: 9/21 looper letters, 28 selfloop transitions, 13 changer transitions 8/52 dead transitions. [2022-12-13 10:21:19,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 462 flow [2022-12-13 10:21:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:21:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:21:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-13 10:21:19,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2022-12-13 10:21:19,154 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 310 flow. Second operand 6 states and 53 transitions. [2022-12-13 10:21:19,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 462 flow [2022-12-13 10:21:19,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 434 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:19,158 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 326 flow [2022-12-13 10:21:19,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2022-12-13 10:21:19,160 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-13 10:21:19,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:19,160 INFO L89 Accepts]: Start accepts. Operand has 54 places, 37 transitions, 326 flow [2022-12-13 10:21:19,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:19,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:19,162 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 37 transitions, 326 flow [2022-12-13 10:21:19,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 37 transitions, 326 flow [2022-12-13 10:21:19,171 INFO L130 PetriNetUnfolder]: 23/79 cut-off events. [2022-12-13 10:21:19,171 INFO L131 PetriNetUnfolder]: For 248/258 co-relation queries the response was YES. [2022-12-13 10:21:19,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 79 events. 23/79 cut-off events. For 248/258 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 284 event pairs, 0 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 310. Up to 22 conditions per place. [2022-12-13 10:21:19,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 37 transitions, 326 flow [2022-12-13 10:21:19,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 10:21:19,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| v_~f2_3~0_98) (= v_~f1_6~0_104 |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483648)) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_plus_#res#1_49|) (<= 0 (+ v_~f1_2~0_108 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_35| |v_thread1Thread1of1ForFork0_plus_~b#1_53|) (<= 0 (+ v_~f2_7~0_111 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| v_~f1_6~0_104) (<= v_~f1_2~0_108 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_65| 1) (= |v_thread2Thread1of1ForFork1_plus_#res#1_39| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_~b#1_59|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_65| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_65| 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_65|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_65|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_63| |v_thread2Thread1of1ForFork1_minus_#res#1_47|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_49| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_53| |v_thread1Thread1of1ForFork0_plus_~b#1_53|)) (< |v_thread2Thread1of1ForFork1_~i~1#1_68| v_~n_0~0_85) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_35| |v_thread1Thread1of1ForFork0_plus_~a#1_53|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_47| 2147483647) (= v_~f1_2~0_109 |v_thread1Thread1of1ForFork0_plus_#in~a#1_35|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_59| |v_thread2Thread1of1ForFork1_plus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_63| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_63|)) 1 0)) (= v_~f1_6~0_105 |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|) (= v_~f1_2~0_108 |v_thread1Thread1of1ForFork0_minus_#in~a#1_31|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_65| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#res#1_47|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_63| |v_thread2Thread1of1ForFork1_minus_#in~a#1_41|) (= v_~f2_7~0_111 |v_thread2Thread1of1ForFork1_minus_#res#1_47|) (= v_~f2_3~0_97 |v_thread1Thread1of1ForFork0_minus_#res#1_47|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_65| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|) (<= v_~f2_7~0_111 2147483647) (= v_~f2_7~0_112 |v_thread2Thread1of1ForFork1_minus_#in~b#1_41|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_39| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| v_~f2_3~0_98) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_68|) |v_thread2Thread1of1ForFork1_~i~1#1_67|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (< |v_thread1Thread1of1ForFork0_~i~0#1_65| (+ v_~n_0~0_85 1)) (= |v_thread2Thread1of1ForFork1_plus_~a#1_57| |v_thread2Thread1of1ForFork1_plus_#in~a#1_29|)) InVars {~f1_2~0=v_~f1_2~0_109, ~f2_3~0=v_~f2_3~0_98, ~n_0~0=v_~n_0~0_85, ~f2_7~0=v_~f2_7~0_112, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_68|, ~f1_6~0=v_~f1_6~0_105} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_31|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_57|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_35|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_67|, ~f1_6~0=v_~f1_6~0_104, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_41|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_63|, ~f1_2~0=v_~f1_2~0_108, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_41|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_39|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_59|, ~n_0~0=v_~n_0~0_85, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_41|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_41|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_29|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_47|, ~f2_3~0=v_~f2_3~0_97, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_53|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_63|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_53|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_107|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_65|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_65|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_65|, ~f2_7~0=v_~f2_7~0_111, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_49|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_35|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:21,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [778] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_45| |v_thread1Thread1of1ForFork0_plus_~a#1_63|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_45| v_~f2_3~0_116) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_88|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (= v_~f1_6~0_125 |v_thread2Thread1of1ForFork1_plus_#in~a#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_71| |v_thread2Thread1of1ForFork1_plus_#in~b#1_45|) (= v_~l_8~0_59 (ite (< 0 v_~f1_6~0_124) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_63|) (= v_~f1_2~0_128 |v_thread1Thread1of1ForFork0_plus_#res#1_59|) (= v_~f2_7~0_132 |v_thread2Thread1of1ForFork1_plus_#in~b#1_45|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_75|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_75| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_75|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_75| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_75| |v_thread2Thread1of1ForFork1_minus_#res#1_59|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_75| |v_thread1Thread1of1ForFork0_minus_#in~a#1_41|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_15|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_75| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_75| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_75| 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_51| v_~f1_6~0_124) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_87| v_~n_0~0_95)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_57| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_75| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_75|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_75|)) 1 0)) (<= v_~f1_2~0_128 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_51| 2147483647) (= v_~f1_6~0_124 |v_thread2Thread1of1ForFork1_minus_#in~a#1_53|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_69| |v_thread2Thread1of1ForFork1_plus_#in~a#1_41|) (= v_~f1_2~0_128 |v_thread1Thread1of1ForFork0_minus_#in~a#1_41|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_43| v_~f2_3~0_116) (= |v_thread2Thread1of1ForFork1_minus_~a#1_75| |v_thread2Thread1of1ForFork1_minus_#in~a#1_53|) (< |v_thread2Thread1of1ForFork1_~i~1#1_88| v_~n_0~0_95) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_51| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_59| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_63| |v_thread1Thread1of1ForFork0_plus_~b#1_63|)) (<= 0 (+ v_~f2_7~0_131 2147483648)) (= v_~f2_3~0_115 |v_thread1Thread1of1ForFork0_minus_#res#1_57|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_75| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_75| |v_thread1Thread1of1ForFork0_minus_#res#1_57|)) (< |v_thread1Thread1of1ForFork0_~i~0#1_77| (+ v_~n_0~0_95 1)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_51| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_69| |v_thread2Thread1of1ForFork1_plus_~b#1_71|)) (= v_~f2_7~0_131 |v_thread2Thread1of1ForFork1_minus_#res#1_59|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|) (<= 0 (+ v_~f1_2~0_128 2147483648)) (<= v_~f2_7~0_131 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_75| |v_thread2Thread1of1ForFork1_minus_#in~b#1_53|) (= v_~f1_2~0_129 |v_thread1Thread1of1ForFork0_plus_#in~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_75| |v_thread1Thread1of1ForFork0_minus_#in~b#1_43|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_15| 0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1) (= v_~f2_7~0_132 |v_thread2Thread1of1ForFork1_minus_#in~b#1_53|)) InVars {~f1_2~0=v_~f1_2~0_129, ~f2_3~0=v_~f2_3~0_116, ~n_0~0=v_~n_0~0_95, ~f2_7~0=v_~f2_7~0_132, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_88|, ~f1_6~0=v_~f1_6~0_125} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_41|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_15|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_69|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_59|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_59|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f1_6~0=v_~f1_6~0_124, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_53|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_75|, ~f1_2~0=v_~f1_2~0_128, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_53|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_51|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_41|, ~n_0~0=v_~n_0~0_95, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_71|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_51|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_53|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_41|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_57|, ~f2_3~0=v_~f2_3~0_115, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_63|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_75|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_63|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_15|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_75|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_75|, ~l_8~0=v_~l_8~0_59, ~f2_7~0=v_~f2_7~0_131, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_59|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_45|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_53|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:22,380 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:21:22,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3221 [2022-12-13 10:21:22,381 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 342 flow [2022-12-13 10:21:22,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:22,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:22,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:22,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:21:22,382 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-13 10:21:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1330028488, now seen corresponding path program 1 times [2022-12-13 10:21:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:22,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352277679] [2022-12-13 10:21:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:22,439 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-13 10:21:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:22,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352277679] [2022-12-13 10:21:22,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352277679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:22,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:22,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:21:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236820529] [2022-12-13 10:21:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:22,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:21:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:22,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:21:22,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:21:22,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:21:22,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 342 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:22,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:22,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:21:22,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:22,556 INFO L130 PetriNetUnfolder]: 126/223 cut-off events. [2022-12-13 10:21:22,556 INFO L131 PetriNetUnfolder]: For 1059/1059 co-relation queries the response was YES. [2022-12-13 10:21:22,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 223 events. 126/223 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 743 event pairs, 7 based on Foata normal form. 6/229 useless extension candidates. Maximal degree in co-relation 1122. Up to 109 conditions per place. [2022-12-13 10:21:22,559 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 42 selfloop transitions, 16 changer transitions 1/59 dead transitions. [2022-12-13 10:21:22,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 590 flow [2022-12-13 10:21:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:21:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:21:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 10:21:22,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2022-12-13 10:21:22,560 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 342 flow. Second operand 6 states and 51 transitions. [2022-12-13 10:21:22,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 590 flow [2022-12-13 10:21:22,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 525 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-13 10:21:22,564 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 330 flow [2022-12-13 10:21:22,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2022-12-13 10:21:22,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-13 10:21:22,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:22,566 INFO L89 Accepts]: Start accepts. Operand has 54 places, 36 transitions, 330 flow [2022-12-13 10:21:22,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:22,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:22,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 36 transitions, 330 flow [2022-12-13 10:21:22,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 36 transitions, 330 flow [2022-12-13 10:21:22,577 INFO L130 PetriNetUnfolder]: 22/73 cut-off events. [2022-12-13 10:21:22,577 INFO L131 PetriNetUnfolder]: For 243/250 co-relation queries the response was YES. [2022-12-13 10:21:22,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 73 events. 22/73 cut-off events. For 243/250 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 244 event pairs, 0 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 270. Up to 23 conditions per place. [2022-12-13 10:21:22,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 330 flow [2022-12-13 10:21:22,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-13 10:21:22,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_41| |v_thread1Thread1of1ForFork0_plus_~b#1_59|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_43| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_61| |v_thread2Thread1of1ForFork1_plus_~b#1_63|)) (<= 0 (+ v_~f1_2~0_120 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_39| v_~f2_3~0_108) (= v_~f1_2~0_121 |v_thread1Thread1of1ForFork0_plus_#in~a#1_41|) (<= v_~f1_2~0_120 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#res#1_55| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_59| |v_thread1Thread1of1ForFork0_plus_~b#1_59|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_43| 2147483647) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_77|) |v_thread2Thread1of1ForFork1_~i~1#1_75|) (= v_~f1_2~0_120 |v_thread1Thread1of1ForFork0_plus_#res#1_55|) (= v_~f2_7~0_119 |v_thread2Thread1of1ForFork1_minus_#res#1_51|) (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_33| 2147483647) (= (+ v_~f2_7~0_121 v_~f1_6~0_114) |v_thread2Thread1of1ForFork1_plus_#in~a#1_33|) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_37| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_71| |v_thread1Thread1of1ForFork0_minus_#in~b#1_39|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_41| v_~f2_3~0_108) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_45| |v_thread2Thread1of1ForFork1_plus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_145|) (= v_~f1_6~0_112 |v_thread2Thread1of1ForFork1_minus_#in~a#1_45|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_67| |v_thread2Thread1of1ForFork1_minus_#in~a#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_111| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139|) (= v_~f2_3~0_107 |v_thread1Thread1of1ForFork0_minus_#res#1_53|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_67|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_67| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_67|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_111|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_41| |v_thread1Thread1of1ForFork0_plus_~a#1_59|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_61| |v_thread2Thread1of1ForFork1_plus_#in~a#1_33|) (= v_~f1_2~0_120 |v_thread1Thread1of1ForFork0_minus_#in~a#1_37|) (= (+ v_~f2_7~0_121 |v_thread2Thread1of1ForFork1_plus_#in~b#1_37|) |v_thread2Thread1of1ForFork1_plus_#in~a#1_33|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_71| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_71| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_71| 0)) 1 0) 0)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_43| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_63| |v_thread2Thread1of1ForFork1_plus_#in~b#1_37|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_71| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_71|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_71|)) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_73| (+ v_~n_0~0_91 1)) (<= 0 (+ v_~f2_7~0_119 2147483648)) (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#in~b#1_37|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_71| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_71| |v_thread1Thread1of1ForFork0_minus_#res#1_53|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_71| |v_thread1Thread1of1ForFork0_minus_#in~a#1_37|) (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_77|) v_~n_0~0_91) (= |v_thread2Thread1of1ForFork1_minus_~a#1_67| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_67| |v_thread2Thread1of1ForFork1_minus_#res#1_51|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_67| |v_thread2Thread1of1ForFork1_minus_#in~b#1_45|) (= |v_thread1Thread1of1ForFork0_~i~0#1_73| 1) (= |v_thread2Thread1of1ForFork1_plus_#res#1_43| v_~f1_6~0_112) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_53| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_121, ~f2_3~0=v_~f2_3~0_108, ~n_0~0=v_~n_0~0_91, ~f2_7~0=v_~f2_7~0_121, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_77|, ~f1_6~0=v_~f1_6~0_114} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_37|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_61|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_55|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_51|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_111|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_41|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_75|, ~f1_6~0=v_~f1_6~0_112, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_45|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_67|, ~f1_2~0=v_~f1_2~0_120, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_45|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_43|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_37|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_63|, ~n_0~0=v_~n_0~0_91, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_145|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_45|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_33|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_53|, ~f2_3~0=v_~f2_3~0_107, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_59|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_67|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_59|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_39|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_71|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_73|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_71|, ~f2_7~0=v_~f2_7~0_119, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_55|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_41|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: 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] [2022-12-13 10:21:23,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_81| |v_thread1Thread1of1ForFork0_minus_#in~b#1_49|) (= v_~f1_2~0_138 |v_thread1Thread1of1ForFork0_minus_#in~a#1_47|) (< 1 v_~n_0~0_99) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_81| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_81|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_81|)) 1 0)) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| 2147483648)) (<= v_~f2_7~0_139 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_51| |v_thread1Thread1of1ForFork0_plus_~b#1_69|) (= v_~f1_6~0_132 |v_thread2Thread1of1ForFork1_minus_#in~a#1_57|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_51| |v_thread1Thread1of1ForFork0_minus_#in~b#1_49|) (= v_~f2_7~0_140 |v_thread2Thread1of1ForFork1_plus_#in~b#1_49|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_65| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_69| |v_thread1Thread1of1ForFork0_plus_~b#1_69|)) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_96|) |v_thread2Thread1of1ForFork1_~i~1#1_95|) (<= |v_thread1Thread1of1ForFork0_minus_#in~b#1_49| 2147483647) (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= |v_thread2Thread1of1ForFork1_minus_~b#1_79| |v_thread2Thread1of1ForFork1_minus_#in~b#1_57|) (= v_~f2_7~0_140 |v_thread2Thread1of1ForFork1_minus_#in~b#1_57|) (< |v_thread2Thread1of1ForFork1_~i~1#1_96| v_~n_0~0_99) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (= v_~l_8~0_61 (ite (< 0 v_~f1_6~0_132) 1 0)) (= v_~f1_2~0_138 |v_thread1Thread1of1ForFork0_plus_#res#1_65|) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| v_~n_0~0_99)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_79| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_79| |v_thread2Thread1of1ForFork1_minus_#res#1_63|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_55| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~a#1_81| |v_thread1Thread1of1ForFork0_minus_#in~a#1_47|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_79|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_79| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_79|))) 1 0)) (<= v_~f1_2~0_138 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_55| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~a#1_73| |v_thread2Thread1of1ForFork1_plus_#in~a#1_45|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_55| v_~f1_6~0_132) (= (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_49| v_~f2_3~0_127) |v_thread1Thread1of1ForFork0_plus_#in~a#1_51|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_81| |v_thread1Thread1of1ForFork0_minus_#res#1_63|) |v_thread1Thread1of1ForFork0_minus_~a#1_81|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_79| |v_thread2Thread1of1ForFork1_minus_#in~a#1_57|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| |v_thread1Thread1of1ForFork0_minus_#in~b#1_49|) (<= 0 (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_49| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| (+ v_~f1_2~0_140 v_~f2_3~0_127)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_63| 2147483647) (<= 0 (+ v_~f1_2~0_138 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_155|) (<= 0 (+ v_~f2_7~0_139 2147483648)) (= v_~f2_3~0_125 |v_thread1Thread1of1ForFork0_minus_#res#1_63|) (= v_~f2_7~0_139 |v_thread2Thread1of1ForFork1_minus_#res#1_63|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_51| |v_thread1Thread1of1ForFork0_plus_~a#1_69|) (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_73| |v_thread2Thread1of1ForFork1_plus_~b#1_75|) |v_thread2Thread1of1ForFork1_plus_#res#1_55|) (= v_~f1_6~0_133 |v_thread2Thread1of1ForFork1_plus_#in~a#1_45|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_75| |v_thread2Thread1of1ForFork1_plus_#in~b#1_49|) (= |v_thread1Thread1of1ForFork0_~i~0#1_83| 2)) InVars {~f1_2~0=v_~f1_2~0_140, ~f2_3~0=v_~f2_3~0_127, ~n_0~0=v_~n_0~0_99, ~f2_7~0=v_~f2_7~0_140, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_96|, ~f1_6~0=v_~f1_6~0_133} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_49|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_47|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_65|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_73|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_51|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_95|, ~f1_6~0=v_~f1_6~0_132, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_57|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_79|, ~f1_2~0=v_~f1_2~0_138, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_47|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_57|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_55|, ~n_0~0=v_~n_0~0_99, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_75|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_155|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_57|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_45|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_63|, ~f2_3~0=v_~f2_3~0_125, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_69|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_79|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_69|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_49|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_81|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_83|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_81|, ~l_8~0=v_~l_8~0_61, ~f2_7~0=v_~f2_7~0_139, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_65|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_51|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_57|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: 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] [2022-12-13 10:21:23,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] $Ultimate##0-->L44-5: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| v_~f2_3~0_121))) (and (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_77| |v_thread1Thread1of1ForFork0_minus_#res#1_59|) |v_thread1Thread1of1ForFork0_minus_~a#1_77|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_92|) |v_thread2Thread1of1ForFork1_~i~1#1_91|) (= v_~f1_2~0_132 |v_thread1Thread1of1ForFork0_minus_#in~a#1_43|) (<= 0 (+ v_~f2_7~0_135 2147483648)) (= v_~f1_2~0_132 |v_thread1Thread1of1ForFork0_plus_#res#1_61|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_77| |v_thread2Thread1of1ForFork1_minus_#res#1_61|) |v_thread2Thread1of1ForFork1_minus_~a#1_77|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_53| v_~f1_6~0_128) (< 1 v_~n_0~0_97) (= |v_thread2Thread1of1ForFork1_plus_#res#1_53| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_71| |v_thread2Thread1of1ForFork1_plus_~b#1_73|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_77| |v_thread1Thread1of1ForFork0_minus_#in~a#1_43|) (= v_~f1_2~0_134 |v_thread1Thread1of1ForFork0_plus_#in~b#1_47|) (not (= (ite (or (<= v_~f2_3~0_121 0) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_79| 2) (= |v_thread1Thread1of1ForFork0_minus_~b#1_77| |v_thread1Thread1of1ForFork0_minus_#in~b#1_45|) (= v_~f1_6~0_128 |v_thread2Thread1of1ForFork1_minus_#in~a#1_55|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_77| |v_thread2Thread1of1ForFork1_minus_#in~b#1_55|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_47| |v_thread1Thread1of1ForFork0_plus_~a#1_65|) (< |v_thread2Thread1of1ForFork1_~i~1#1_92| v_~n_0~0_97) (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| 2147483647) (<= v_~f1_2~0_132 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_77| |v_thread2Thread1of1ForFork1_minus_#in~a#1_55|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_53| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_73| |v_thread2Thread1of1ForFork1_plus_#in~b#1_47|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_47| .cse0) (= |v_thread2Thread1of1ForFork1_plus_~a#1_71| |v_thread2Thread1of1ForFork1_plus_#in~a#1_43|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| |v_thread1Thread1of1ForFork0_plus_~b#1_65|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_53| 2147483647) (<= 0 (+ v_~f1_2~0_132 2147483648)) (= v_~f1_6~0_129 |v_thread2Thread1of1ForFork1_plus_#in~a#1_43|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|) (= v_~f2_3~0_119 |v_thread1Thread1of1ForFork0_minus_#res#1_59|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_119| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_77| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_77|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_77|)) 1 0)) (<= v_~f2_7~0_135 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_77|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_77| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_77|))) 1 0)) (= v_~f2_7~0_135 |v_thread2Thread1of1ForFork1_minus_#res#1_61|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| v_~f2_3~0_121 2147483648)) (= v_~f2_7~0_136 |v_thread2Thread1of1ForFork1_plus_#in~b#1_47|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_61| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_65| |v_thread1Thread1of1ForFork0_plus_~b#1_65|)) (= v_~f2_7~0_136 |v_thread2Thread1of1ForFork1_minus_#in~b#1_55|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_45|) (<= .cse0 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_119| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|))) InVars {~f1_2~0=v_~f1_2~0_134, ~f2_3~0=v_~f2_3~0_121, ~n_0~0=v_~n_0~0_97, ~f2_7~0=v_~f2_7~0_136, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_92|, ~f1_6~0=v_~f1_6~0_129} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_47|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_43|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_61|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_71|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_47|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#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_91|, ~f1_6~0=v_~f1_6~0_128, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_55|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_77|, ~f1_2~0=v_~f1_2~0_132, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_43|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_55|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_53|, ~n_0~0=v_~n_0~0_97, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_73|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_151|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_55|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_43|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_59|, ~f2_3~0=v_~f2_3~0_119, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_65|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_77|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_65|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_47|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_119|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_77|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_79|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_77|, ~f2_7~0=v_~f2_7~0_135, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_61|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_47|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_55|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: 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] [2022-12-13 10:21:24,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: 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] [2022-12-13 10:21:24,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [492] $Ultimate##0-->L54-5: 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] [2022-12-13 10:21:24,745 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 10:21:24,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [783] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_~a#1_75| |v_thread2Thread1of1ForFork1_plus_#in~a#1_47|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_47| (+ v_~f2_7~0_144 v_~f1_6~0_137)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_81| |v_thread2Thread1of1ForFork1_minus_#in~b#1_59|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_81| |v_thread2Thread1of1ForFork1_minus_#in~a#1_59|) (= v_~f1_2~0_145 |v_thread1Thread1of1ForFork0_plus_#in~a#1_55|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_57| v_~f1_6~0_136) (<= 0 (+ v_~f1_2~0_144 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_55| |v_thread1Thread1of1ForFork0_plus_~b#1_73|) (= v_~f1_2~0_144 |v_thread1Thread1of1ForFork0_minus_#in~a#1_51|) (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#in~b#1_51|)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_77| |v_thread2Thread1of1ForFork1_plus_#in~b#1_51|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_53| v_~f2_3~0_132) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_57| 2147483647) (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_101| 1) v_~n_0~0_101) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_55| |v_thread1Thread1of1ForFork0_plus_~a#1_73|) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_51| 2147483647) (= v_~f1_2~0_144 |v_thread1Thread1of1ForFork0_plus_#res#1_69|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_85| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_85|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_85|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (<= 0 (+ v_~f2_7~0_143 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_85| |v_thread1Thread1of1ForFork0_minus_#res#1_67|) |v_thread1Thread1of1ForFork0_minus_~a#1_85|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_85| |v_thread1Thread1of1ForFork0_minus_#in~b#1_53|) (= v_~f2_7~0_143 |v_thread2Thread1of1ForFork1_minus_#res#1_65|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_55| v_~f2_3~0_132) (= |v_thread1Thread1of1ForFork0_minus_~a#1_85| |v_thread1Thread1of1ForFork0_minus_#in~a#1_51|) (< |v_thread1Thread1of1ForFork0_~i~0#1_87| (+ v_~n_0~0_101 1)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_69| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_73| |v_thread1Thread1of1ForFork0_plus_~b#1_73|)) (= (+ v_~f2_7~0_144 |v_thread2Thread1of1ForFork1_plus_#in~b#1_51|) |v_thread2Thread1of1ForFork1_plus_#in~a#1_47|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_57| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_75| |v_thread2Thread1of1ForFork1_plus_~b#1_77|)) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_81| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_81|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_81|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|) (= v_~f1_6~0_136 |v_thread2Thread1of1ForFork1_minus_#in~a#1_59|) (= v_~f2_3~0_131 |v_thread1Thread1of1ForFork0_minus_#res#1_67|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_85| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_85| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_85| 2147483648))) 1 0) 0)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_57| 2147483648)) (<= v_~f1_2~0_144 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_81| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_81| |v_thread2Thread1of1ForFork1_minus_#res#1_65|)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_59| |v_thread2Thread1of1ForFork1_plus_#in~b#1_51|) (= |v_thread1Thread1of1ForFork0_~i~0#1_87| 1) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_67| 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_47| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|)) InVars {~f1_2~0=v_~f1_2~0_145, ~f2_3~0=v_~f2_3~0_132, ~n_0~0=v_~n_0~0_101, ~f2_7~0=v_~f2_7~0_144, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_101|, ~f1_6~0=v_~f1_6~0_137} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_51|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_51|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_75|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_69|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_55|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f1_6~0=v_~f1_6~0_136, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_59|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_81|, ~f1_2~0=v_~f1_2~0_144, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_59|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_57|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_51|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_77|, ~n_0~0=v_~n_0~0_101, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_61|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_59|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_47|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_67|, ~f2_3~0=v_~f2_3~0_131, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_73|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_81|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_73|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_51|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_85|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_87|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_85|, ~f2_7~0=v_~f2_7~0_143, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_69|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_55|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_59|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:26,081 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:21:26,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3517 [2022-12-13 10:21:26,082 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 364 flow [2022-12-13 10:21:26,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:26,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:26,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:26,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 10:21:26,083 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-13 10:21:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1975143966, now seen corresponding path program 1 times [2022-12-13 10:21:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278338797] [2022-12-13 10:21:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:26,135 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-13 10:21:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:26,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278338797] [2022-12-13 10:21:26,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278338797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:26,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:26,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:21:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631209719] [2022-12-13 10:21:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:26,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:21:26,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:21:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:21:26,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 10:21:26,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:26,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:26,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 10:21:26,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:26,184 INFO L130 PetriNetUnfolder]: 87/168 cut-off events. [2022-12-13 10:21:26,184 INFO L131 PetriNetUnfolder]: For 1105/1117 co-relation queries the response was YES. [2022-12-13 10:21:26,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 168 events. 87/168 cut-off events. For 1105/1117 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 566 event pairs, 31 based on Foata normal form. 6/171 useless extension candidates. Maximal degree in co-relation 647. Up to 133 conditions per place. [2022-12-13 10:21:26,185 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 22 selfloop transitions, 4 changer transitions 6/34 dead transitions. [2022-12-13 10:21:26,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 34 transitions, 343 flow [2022-12-13 10:21:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:21:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:21:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 2 states and 25 transitions. [2022-12-13 10:21:26,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 10:21:26,186 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 364 flow. Second operand 2 states and 25 transitions. [2022-12-13 10:21:26,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 34 transitions, 343 flow [2022-12-13 10:21:26,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 292 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-12-13 10:21:26,189 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 168 flow [2022-12-13 10:21:26,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=168, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2022-12-13 10:21:26,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-13 10:21:26,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:26,190 INFO L89 Accepts]: Start accepts. Operand has 42 places, 25 transitions, 168 flow [2022-12-13 10:21:26,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:26,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:26,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 25 transitions, 168 flow [2022-12-13 10:21:26,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 168 flow [2022-12-13 10:21:26,198 INFO L130 PetriNetUnfolder]: 10/46 cut-off events. [2022-12-13 10:21:26,198 INFO L131 PetriNetUnfolder]: For 56/59 co-relation queries the response was YES. [2022-12-13 10:21:26,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 46 events. 10/46 cut-off events. For 56/59 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 113 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 120. Up to 12 conditions per place. [2022-12-13 10:21:26,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 25 transitions, 168 flow [2022-12-13 10:21:26,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 10:21:26,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] $Ultimate##0-->L54-5: 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 [766] $Ultimate##0-->L54-5: Formula: (and (<= |v_thread2Thread1of1ForFork1_plus_#res#1_33| 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_57| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_57| |v_thread2Thread1of1ForFork1_minus_#res#1_41|)) (= |v_thread1Thread1of1ForFork0_~i~0#1_59| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_53| |v_thread2Thread1of1ForFork1_plus_#in~b#1_27|) (< |v_thread2Thread1of1ForFork1_~i~1#1_54| v_~n_0~0_77) (= |v_thread2Thread1of1ForFork1_plus_#res#1_33| v_~f1_6~0_92) (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_51| |v_thread2Thread1of1ForFork1_plus_~b#1_53|) |v_thread2Thread1of1ForFork1_plus_#res#1_33|) (= |v_thread2Thread1of1ForFork1_minus_#res#1_41| v_~f2_7~0_99) (= |v_thread2Thread1of1ForFork1_minus_~a#1_57| |v_thread2Thread1of1ForFork1_minus_#in~a#1_35|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_33| 2147483648)) (= v_~f1_6~0_93 |v_thread2Thread1of1ForFork1_plus_#in~a#1_23|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_101| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_57| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_57|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_57|)) 1 0)) (<= 0 (+ 2147483648 v_~f2_7~0_99)) (<= v_~f2_7~0_99 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_57| |v_thread2Thread1of1ForFork1_minus_#in~b#1_35|) (= v_~f2_7~0_100 |v_thread2Thread1of1ForFork1_plus_#in~b#1_27|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_51| |v_thread2Thread1of1ForFork1_plus_#in~a#1_23|) (= v_~f2_7~0_100 |v_thread2Thread1of1ForFork1_minus_#in~b#1_35|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_54|) |v_thread2Thread1of1ForFork1_~i~1#1_53|) (= v_~f1_6~0_92 |v_thread2Thread1of1ForFork1_minus_#in~a#1_35|)) InVars {~n_0~0=v_~n_0~0_77, ~f2_7~0=v_~f2_7~0_100, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_54|, ~f1_6~0=v_~f1_6~0_93} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_23|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_27|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_57|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_51|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#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_53|, ~f1_6~0=v_~f1_6~0_92, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_35|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_27|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_35|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_33|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_53|, ~n_0~0=v_~n_0~0_77, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_59|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_35|, ~f2_7~0=v_~f2_7~0_99, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:26,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] $Ultimate##0-->L54-5: 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 [438] $Ultimate##0-->L44-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] [2022-12-13 10:21:26,559 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:21:26,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 370 [2022-12-13 10:21:26,560 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 174 flow [2022-12-13 10:21:26,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:26,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:26,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:26,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 10:21:26,561 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-13 10:21:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1138963852, now seen corresponding path program 1 times [2022-12-13 10:21:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:26,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699219376] [2022-12-13 10:21:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:26,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:26,616 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-13 10:21:26,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:26,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699219376] [2022-12-13 10:21:26,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699219376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:26,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:26,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:26,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537068730] [2022-12-13 10:21:26,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:26,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:26,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:26,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:26,618 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 10:21:26,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 174 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-13 10:21:26,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:26,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 10:21:26,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:26,672 INFO L130 PetriNetUnfolder]: 108/199 cut-off events. [2022-12-13 10:21:26,672 INFO L131 PetriNetUnfolder]: For 628/628 co-relation queries the response was YES. [2022-12-13 10:21:26,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 199 events. 108/199 cut-off events. For 628/628 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 652 event pairs, 30 based on Foata normal form. 4/203 useless extension candidates. Maximal degree in co-relation 723. Up to 138 conditions per place. [2022-12-13 10:21:26,674 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 32 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2022-12-13 10:21:26,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 343 flow [2022-12-13 10:21:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 10:21:26,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-13 10:21:26,675 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 174 flow. Second operand 4 states and 33 transitions. [2022-12-13 10:21:26,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 343 flow [2022-12-13 10:21:26,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 315 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 10:21:26,677 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:26,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 10:21:26,678 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-13 10:21:26,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:26,678 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:26,679 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:26,680 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:26,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:26,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:26,687 INFO L130 PetriNetUnfolder]: 16/62 cut-off events. [2022-12-13 10:21:26,687 INFO L131 PetriNetUnfolder]: For 125/133 co-relation queries the response was YES. [2022-12-13 10:21:26,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 62 events. 16/62 cut-off events. For 125/133 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 194 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 191. Up to 25 conditions per place. [2022-12-13 10:21:26,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:26,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 10:21:26,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->L54-5: Formula: (and (= v_~f1_6~0_97 |v_thread2Thread1of1ForFork1_plus_#in~a#1_25|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_59| |v_thread2Thread1of1ForFork1_minus_#in~a#1_37|) (<= 0 (+ v_~f2_7~0_103 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_35| 2147483647) (= v_~f1_6~0_96 |v_thread2Thread1of1ForFork1_minus_#in~a#1_37|) (< 0 v_~n_0~0_79) (= |v_thread2Thread1of1ForFork1_plus_#res#1_35| v_~f1_6~0_96) (= v_~f2_7~0_104 |v_thread2Thread1of1ForFork1_minus_#in~b#1_37|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_57|) (= v_~f2_7~0_104 |v_thread2Thread1of1ForFork1_plus_#in~b#1_29|) (<= v_~f2_7~0_103 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_35| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~a#1_53| |v_thread2Thread1of1ForFork1_plus_#in~a#1_25|) (= v_~f2_7~0_103 |v_thread2Thread1of1ForFork1_minus_#res#1_43|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_59| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_59| |v_thread2Thread1of1ForFork1_minus_#res#1_43|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_55| |v_thread2Thread1of1ForFork1_plus_#in~b#1_29|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_35| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_53| |v_thread2Thread1of1ForFork1_plus_~b#1_55|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_59| |v_thread2Thread1of1ForFork1_minus_#in~b#1_37|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_59| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_59|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_59|)) 1 0))) InVars {~n_0~0=v_~n_0~0_79, ~f2_7~0=v_~f2_7~0_104, ~f1_6~0=v_~f1_6~0_97} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_59|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_53|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#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_57|, ~f1_6~0=v_~f1_6~0_96, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_37|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_29|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_59|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_37|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_35|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_55|, ~n_0~0=v_~n_0~0_79, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_37|, ~f2_7~0=v_~f2_7~0_103, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:27,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_~a#1_87| |v_thread2Thread1of1ForFork1_plus_#in~a#1_59|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_165|) (= v_~f1_6~0_160 |v_thread2Thread1of1ForFork1_minus_#in~a#1_71|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_69| 2147483647) (= |v_thread2Thread1of1ForFork1_~i~1#1_133| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_93| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_93|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_93|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_93| |v_thread2Thread1of1ForFork1_minus_#in~b#1_71|) (= v_~f2_7~0_168 |v_thread2Thread1of1ForFork1_plus_#in~b#1_63|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_69| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_93| |v_thread2Thread1of1ForFork1_minus_#in~a#1_71|) (= |v_thread1Thread1of1ForFork0_~i~0#1_97| 0) (= v_~f1_6~0_161 |v_thread2Thread1of1ForFork1_plus_#in~a#1_59|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_89| |v_thread2Thread1of1ForFork1_plus_#in~b#1_63|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_93| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_93| |v_thread2Thread1of1ForFork1_minus_#res#1_77|)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_69| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_87| |v_thread2Thread1of1ForFork1_plus_~b#1_89|)) (<= 0 (+ v_~f2_7~0_167 2147483648)) (<= v_~f2_7~0_167 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_133| (+ v_~n_0~0_113 1)) (= v_~f2_7~0_168 |v_thread2Thread1of1ForFork1_minus_#in~b#1_71|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_69| v_~f1_6~0_160) (= v_~f2_7~0_167 |v_thread2Thread1of1ForFork1_minus_#res#1_77|)) InVars {~n_0~0=v_~n_0~0_113, ~f2_7~0=v_~f2_7~0_168, ~f1_6~0=v_~f1_6~0_161} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_59|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_93|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_87|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_77|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_133|, ~f1_6~0=v_~f1_6~0_160, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_71|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_63|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_93|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_165|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_71|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_69|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_89|, ~n_0~0=v_~n_0~0_113, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_97|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_71|, ~f2_7~0=v_~f2_7~0_167, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:27,810 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:21:27,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1133 [2022-12-13 10:21:27,811 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 235 flow [2022-12-13 10:21:27,811 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-13 10:21:27,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:27,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:27,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 10:21:27,811 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-13 10:21:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1742185330, now seen corresponding path program 1 times [2022-12-13 10:21:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:27,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085765799] [2022-12-13 10:21:27,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:27,852 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-13 10:21:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:27,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085765799] [2022-12-13 10:21:27,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085765799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:27,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:27,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115786338] [2022-12-13 10:21:27,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:27,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:27,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:21:27,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 235 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-13 10:21:27,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:27,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:21:27,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:27,911 INFO L130 PetriNetUnfolder]: 90/173 cut-off events. [2022-12-13 10:21:27,911 INFO L131 PetriNetUnfolder]: For 668/668 co-relation queries the response was YES. [2022-12-13 10:21:27,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 173 events. 90/173 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 533 event pairs, 48 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 677. Up to 166 conditions per place. [2022-12-13 10:21:27,913 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 0 changer transitions 7/32 dead transitions. [2022-12-13 10:21:27,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 312 flow [2022-12-13 10:21:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-13 10:21:27,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32894736842105265 [2022-12-13 10:21:27,913 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 235 flow. Second operand 4 states and 25 transitions. [2022-12-13 10:21:27,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 312 flow [2022-12-13 10:21:27,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 286 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:27,915 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 187 flow [2022-12-13 10:21:27,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-13 10:21:27,916 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-13 10:21:27,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:27,916 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 187 flow [2022-12-13 10:21:27,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:27,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:27,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 187 flow [2022-12-13 10:21:27,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 187 flow [2022-12-13 10:21:27,922 INFO L130 PetriNetUnfolder]: 12/44 cut-off events. [2022-12-13 10:21:27,923 INFO L131 PetriNetUnfolder]: For 121/131 co-relation queries the response was YES. [2022-12-13 10:21:27,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 44 events. 12/44 cut-off events. For 121/131 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 97 event pairs, 0 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 134. Up to 19 conditions per place. [2022-12-13 10:21:27,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 187 flow [2022-12-13 10:21:27,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 10:21:27,924 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:27,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 10:21:27,924 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 187 flow [2022-12-13 10:21:27,924 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-13 10:21:27,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:27,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:27,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 10:21:27,925 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-13 10:21:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2060849523, now seen corresponding path program 1 times [2022-12-13 10:21:27,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:27,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590513798] [2022-12-13 10:21:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:28,265 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-13 10:21:28,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:28,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590513798] [2022-12-13 10:21:28,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590513798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:28,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:28,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:21:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577868086] [2022-12-13 10:21:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:28,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:21:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:21:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:21:28,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-13 10:21:28,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 187 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:28,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:28,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-13 10:21:28,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:28,384 INFO L130 PetriNetUnfolder]: 89/172 cut-off events. [2022-12-13 10:21:28,384 INFO L131 PetriNetUnfolder]: For 489/517 co-relation queries the response was YES. [2022-12-13 10:21:28,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 172 events. 89/172 cut-off events. For 489/517 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 568 event pairs, 10 based on Foata normal form. 13/185 useless extension candidates. Maximal degree in co-relation 491. Up to 135 conditions per place. [2022-12-13 10:21:28,385 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 29 selfloop transitions, 7 changer transitions 5/43 dead transitions. [2022-12-13 10:21:28,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 339 flow [2022-12-13 10:21:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:21:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:21:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 10:21:28,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-13 10:21:28,386 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 187 flow. Second operand 5 states and 41 transitions. [2022-12-13 10:21:28,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 339 flow [2022-12-13 10:21:28,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 317 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:28,389 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:28,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-13 10:21:28,389 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-13 10:21:28,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:28,390 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:28,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:28,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:28,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 226 flow [2022-12-13 10:21:28,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 226 flow [2022-12-13 10:21:28,398 INFO L130 PetriNetUnfolder]: 15/58 cut-off events. [2022-12-13 10:21:28,398 INFO L131 PetriNetUnfolder]: For 132/143 co-relation queries the response was YES. [2022-12-13 10:21:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 58 events. 15/58 cut-off events. For 132/143 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 162 event pairs, 0 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 190. Up to 15 conditions per place. [2022-12-13 10:21:28,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 226 flow [2022-12-13 10:21:28,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 10:21:28,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:28,717 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:28,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-13 10:21:28,718 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 230 flow [2022-12-13 10:21:28,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:28,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:28,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:28,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 10:21:28,719 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-13 10:21:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2071979763, now seen corresponding path program 2 times [2022-12-13 10:21:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:28,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917517907] [2022-12-13 10:21:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:28,945 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-13 10:21:28,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:28,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917517907] [2022-12-13 10:21:28,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917517907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:28,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:28,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703957939] [2022-12-13 10:21:28,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:28,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:21:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:28,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:21:28,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:21:28,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 10:21:28,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:21:28,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:28,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 10:21:28,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:29,081 INFO L130 PetriNetUnfolder]: 88/165 cut-off events. [2022-12-13 10:21:29,081 INFO L131 PetriNetUnfolder]: For 484/512 co-relation queries the response was YES. [2022-12-13 10:21:29,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 165 events. 88/165 cut-off events. For 484/512 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 516 event pairs, 8 based on Foata normal form. 13/178 useless extension candidates. Maximal degree in co-relation 713. Up to 135 conditions per place. [2022-12-13 10:21:29,082 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 23 selfloop transitions, 10 changer transitions 6/41 dead transitions. [2022-12-13 10:21:29,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 353 flow [2022-12-13 10:21:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:21:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:21:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 10:21:29,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-13 10:21:29,083 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 230 flow. Second operand 6 states and 40 transitions. [2022-12-13 10:21:29,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 353 flow [2022-12-13 10:21:29,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 343 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 10:21:29,085 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 262 flow [2022-12-13 10:21:29,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 10:21:29,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2022-12-13 10:21:29,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:29,086 INFO L89 Accepts]: Start accepts. Operand has 44 places, 30 transitions, 262 flow [2022-12-13 10:21:29,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:29,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:29,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 30 transitions, 262 flow [2022-12-13 10:21:29,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 262 flow [2022-12-13 10:21:29,094 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2022-12-13 10:21:29,094 INFO L131 PetriNetUnfolder]: For 168/178 co-relation queries the response was YES. [2022-12-13 10:21:29,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 58 events. 16/58 cut-off events. For 168/178 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 163 event pairs, 0 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 209. Up to 15 conditions per place. [2022-12-13 10:21:29,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 262 flow [2022-12-13 10:21:29,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 10:21:29,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:29,415 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:29,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 330 [2022-12-13 10:21:29,416 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 260 flow [2022-12-13 10:21:29,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:21:29,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:29,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:29,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 10:21:29,417 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-13 10:21:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash -755183041, now seen corresponding path program 1 times [2022-12-13 10:21:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:29,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483922356] [2022-12-13 10:21:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:29,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:21:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:29,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483922356] [2022-12-13 10:21:29,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483922356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:29,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:29,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:21:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682319956] [2022-12-13 10:21:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:29,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:21:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:29,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:21:29,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:21:29,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:21:29,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 260 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-13 10:21:29,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:29,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:21:29,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:29,508 INFO L130 PetriNetUnfolder]: 95/170 cut-off events. [2022-12-13 10:21:29,508 INFO L131 PetriNetUnfolder]: For 550/550 co-relation queries the response was YES. [2022-12-13 10:21:29,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 170 events. 95/170 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 484 event pairs, 36 based on Foata normal form. 4/174 useless extension candidates. Maximal degree in co-relation 787. Up to 168 conditions per place. [2022-12-13 10:21:29,509 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 29 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-13 10:21:29,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 349 flow [2022-12-13 10:21:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:21:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:21:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-13 10:21:29,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 10:21:29,510 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 260 flow. Second operand 3 states and 25 transitions. [2022-12-13 10:21:29,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 349 flow [2022-12-13 10:21:29,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 290 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-13 10:21:29,512 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 241 flow [2022-12-13 10:21:29,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 10:21:29,513 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 19 predicate places. [2022-12-13 10:21:29,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:29,513 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 241 flow [2022-12-13 10:21:29,513 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:29,513 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:29,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 241 flow [2022-12-13 10:21:29,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 241 flow [2022-12-13 10:21:29,521 INFO L130 PetriNetUnfolder]: 18/59 cut-off events. [2022-12-13 10:21:29,521 INFO L131 PetriNetUnfolder]: For 149/158 co-relation queries the response was YES. [2022-12-13 10:21:29,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 59 events. 18/59 cut-off events. For 149/158 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 155 event pairs, 0 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 188. Up to 18 conditions per place. [2022-12-13 10:21:29,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 241 flow [2022-12-13 10:21:29,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 10:21:30,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] $Ultimate##0-->L44-5: Formula: (and (< 0 v_~n_0~0_119) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_65| v_~f2_3~0_154) (= |v_thread2Thread1of1ForFork1_plus_~b#1_95| |v_thread2Thread1of1ForFork1_plus_#in~b#1_69|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_75| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_97| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_97| 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_97| 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_75| v_~f1_6~0_172) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_67| |v_thread1Thread1of1ForFork0_plus_~b#1_85|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_75| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_93| |v_thread2Thread1of1ForFork1_plus_~b#1_95|)) (= v_~f1_2~0_166 |v_thread1Thread1of1ForFork0_minus_#in~a#1_63|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_99| |v_thread2Thread1of1ForFork1_minus_#in~b#1_77|) (= v_~f1_6~0_173 |v_thread2Thread1of1ForFork1_plus_#in~a#1_65|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_171|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_67| |v_thread1Thread1of1ForFork0_plus_~a#1_85|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_99| |v_thread2Thread1of1ForFork1_minus_#in~a#1_77|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_97| |v_thread1Thread1of1ForFork0_minus_#res#1_79|) |v_thread1Thread1of1ForFork0_minus_~a#1_97|) (= v_~f2_7~0_180 |v_thread2Thread1of1ForFork1_minus_#in~b#1_77|) (= v_~f1_2~0_166 |v_thread1Thread1of1ForFork0_plus_#res#1_81|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_97| |v_thread1Thread1of1ForFork0_minus_#in~a#1_63|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_171|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_97| |v_thread1Thread1of1ForFork0_minus_#in~b#1_65|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_97|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_97| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_97|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139|) (= v_~f1_6~0_172 |v_thread2Thread1of1ForFork1_minus_#in~a#1_77|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_67| v_~f2_3~0_154) (= v_~f2_7~0_179 |v_thread2Thread1of1ForFork1_minus_#res#1_83|) (= v_~f1_2~0_167 |v_thread1Thread1of1ForFork0_plus_#in~a#1_67|) (<= 0 (+ v_~f2_7~0_179 2147483648)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_75| 2147483648)) (= v_~f2_7~0_180 |v_thread2Thread1of1ForFork1_plus_#in~b#1_69|) (= v_~f2_3~0_153 |v_thread1Thread1of1ForFork0_minus_#res#1_79|) (= |v_thread1Thread1of1ForFork0_~i~0#1_105| 1) (= |v_thread2Thread1of1ForFork1_minus_~a#1_99| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_99| |v_thread2Thread1of1ForFork1_minus_#res#1_83|)) (= |v_thread2Thread1of1ForFork1_~i~1#1_145| 1) (<= v_~f1_2~0_166 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~a#1_93| |v_thread2Thread1of1ForFork1_plus_#in~a#1_65|) (<= 0 (+ v_~f1_2~0_166 2147483648)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_79| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_99| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_99|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_99|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_81| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_85| |v_thread1Thread1of1ForFork0_plus_~b#1_85|)) (<= v_~f2_7~0_179 2147483647)) InVars {~f1_2~0=v_~f1_2~0_167, ~f2_3~0=v_~f2_3~0_154, ~n_0~0=v_~n_0~0_119, ~f2_7~0=v_~f2_7~0_180, ~f1_6~0=v_~f1_6~0_173} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_69|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_63|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_81|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_93|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_67|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_145|, ~f1_6~0=v_~f1_6~0_172, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_77|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_99|, ~f1_2~0=v_~f1_2~0_166, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_63|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_77|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_75|, ~n_0~0=v_~n_0~0_119, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_95|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_73|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_171|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_77|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_65|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_79|, ~f2_3~0=v_~f2_3~0_153, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_85|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_99|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_85|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_69|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_171|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_97|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_105|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_97|, ~f2_7~0=v_~f2_7~0_179, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_81|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_67|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_77|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:31,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:31,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2208 [2022-12-13 10:21:31,722 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 269 flow [2022-12-13 10:21:31,722 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-13 10:21:31,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:31,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:31,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 10:21:31,722 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-13 10:21:31,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1077046712, now seen corresponding path program 1 times [2022-12-13 10:21:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:31,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153698059] [2022-12-13 10:21:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:31,772 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-13 10:21:31,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:31,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153698059] [2022-12-13 10:21:31,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153698059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:31,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:31,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441321112] [2022-12-13 10:21:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:31,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:31,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:31,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:31,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:31,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 10:21:31,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 269 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-13 10:21:31,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:31,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 10:21:31,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:31,859 INFO L130 PetriNetUnfolder]: 95/178 cut-off events. [2022-12-13 10:21:31,859 INFO L131 PetriNetUnfolder]: For 463/463 co-relation queries the response was YES. [2022-12-13 10:21:31,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 178 events. 95/178 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 562 event pairs, 20 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 583. Up to 102 conditions per place. [2022-12-13 10:21:31,861 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 36 selfloop transitions, 11 changer transitions 2/49 dead transitions. [2022-12-13 10:21:31,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 428 flow [2022-12-13 10:21:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:21:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:21:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 10:21:31,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 10:21:31,862 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 269 flow. Second operand 5 states and 44 transitions. [2022-12-13 10:21:31,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 428 flow [2022-12-13 10:21:31,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 413 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 10:21:31,865 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 272 flow [2022-12-13 10:21:31,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-12-13 10:21:31,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2022-12-13 10:21:31,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:31,865 INFO L89 Accepts]: Start accepts. Operand has 44 places, 31 transitions, 272 flow [2022-12-13 10:21:31,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:31,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:31,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 272 flow [2022-12-13 10:21:31,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 272 flow [2022-12-13 10:21:31,873 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2022-12-13 10:21:31,873 INFO L131 PetriNetUnfolder]: For 173/184 co-relation queries the response was YES. [2022-12-13 10:21:31,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 58 events. 16/58 cut-off events. For 173/184 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 162 event pairs, 0 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 199. Up to 16 conditions per place. [2022-12-13 10:21:31,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 272 flow [2022-12-13 10:21:31,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 10:21:33,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L44-5: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_97|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_97| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_97|))) 1 0)) (<= 0 (+ v_~f2_7~0_175 2147483648)) (= v_~f2_7~0_175 |v_thread2Thread1of1ForFork1_minus_#res#1_81|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_91| |v_thread2Thread1of1ForFork1_plus_#in~a#1_63|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_97| |v_thread2Thread1of1ForFork1_minus_#in~a#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 1) |v_thread1Thread1of1ForFork0_~i~0#1_101|) (= v_~f2_3~0_149 |v_thread1Thread1of1ForFork0_minus_#res#1_77|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_95|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_95| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_95|))) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_102| v_~n_0~0_117) (= v_~f1_6~0_168 |v_thread2Thread1of1ForFork1_minus_#in~a#1_75|) (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_91| |v_thread2Thread1of1ForFork1_plus_~b#1_93|) |v_thread2Thread1of1ForFork1_plus_#res#1_73|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_65| v_~f2_3~0_150) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_169|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_97| |v_thread2Thread1of1ForFork1_minus_#in~b#1_75|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_73| 2147483648)) (= v_~f1_2~0_163 |v_thread1Thread1of1ForFork0_plus_#in~a#1_65|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_95| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#res#1_77|)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_73| v_~f1_6~0_168) (<= v_~f2_7~0_175 2147483647) (<= 0 (+ v_~f1_2~0_162 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_65| |v_thread1Thread1of1ForFork0_plus_~a#1_83|) (<= v_~f1_2~0_162 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#in~b#1_63|) (= v_~f2_7~0_176 |v_thread2Thread1of1ForFork1_minus_#in~b#1_75|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_97| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_97| |v_thread2Thread1of1ForFork1_minus_#res#1_81|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_63| v_~f2_3~0_150) (= v_~f2_7~0_176 |v_thread2Thread1of1ForFork1_plus_#in~b#1_67|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_77| 2147483647) (= |v_thread2Thread1of1ForFork1_~i~1#1_143| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (= v_~f1_6~0_169 |v_thread2Thread1of1ForFork1_plus_#in~a#1_63|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_79| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_83| |v_thread1Thread1of1ForFork0_plus_~b#1_83|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_73| 2147483647) (= v_~f1_2~0_162 |v_thread1Thread1of1ForFork0_plus_#res#1_79|) (< 0 v_~n_0~0_117) (= v_~f1_2~0_162 |v_thread1Thread1of1ForFork0_minus_#in~a#1_61|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_65| |v_thread1Thread1of1ForFork0_plus_~b#1_83|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_93| |v_thread2Thread1of1ForFork1_plus_#in~b#1_67|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_95| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_95| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_95| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_95| |v_thread1Thread1of1ForFork0_minus_#in~a#1_61|)) InVars {~f1_2~0=v_~f1_2~0_163, ~f2_3~0=v_~f2_3~0_150, ~n_0~0=v_~n_0~0_117, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, ~f2_7~0=v_~f2_7~0_176, ~f1_6~0=v_~f1_6~0_169} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_67|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_61|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_79|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_91|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_65|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_81|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_143|, ~f1_6~0=v_~f1_6~0_168, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_75|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_97|, ~f1_2~0=v_~f1_2~0_162, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_61|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_75|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_73|, ~n_0~0=v_~n_0~0_117, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_93|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_75|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_63|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_77|, ~f2_3~0=v_~f2_3~0_149, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_83|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_97|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_83|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_67|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_101|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_95|, ~f2_7~0=v_~f2_7~0_175, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_79|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_65|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_75|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:34,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L44-5: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_97|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_97| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_97|))) 1 0)) (<= 0 (+ v_~f2_7~0_175 2147483648)) (= v_~f2_7~0_175 |v_thread2Thread1of1ForFork1_minus_#res#1_81|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_91| |v_thread2Thread1of1ForFork1_plus_#in~a#1_63|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_97| |v_thread2Thread1of1ForFork1_minus_#in~a#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 1) |v_thread1Thread1of1ForFork0_~i~0#1_101|) (= v_~f2_3~0_149 |v_thread1Thread1of1ForFork0_minus_#res#1_77|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_95|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_95| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_95|))) 1 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_102| v_~n_0~0_117) (= v_~f1_6~0_168 |v_thread2Thread1of1ForFork1_minus_#in~a#1_75|) (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_91| |v_thread2Thread1of1ForFork1_plus_~b#1_93|) |v_thread2Thread1of1ForFork1_plus_#res#1_73|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_65| v_~f2_3~0_150) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_169|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_97| |v_thread2Thread1of1ForFork1_minus_#in~b#1_75|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_73| 2147483648)) (= v_~f1_2~0_163 |v_thread1Thread1of1ForFork0_plus_#in~a#1_65|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_95| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#res#1_77|)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_73| v_~f1_6~0_168) (<= v_~f2_7~0_175 2147483647) (<= 0 (+ v_~f1_2~0_162 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_65| |v_thread1Thread1of1ForFork0_plus_~a#1_83|) (<= v_~f1_2~0_162 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_95| |v_thread1Thread1of1ForFork0_minus_#in~b#1_63|) (= v_~f2_7~0_176 |v_thread2Thread1of1ForFork1_minus_#in~b#1_75|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_97| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_97| |v_thread2Thread1of1ForFork1_minus_#res#1_81|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_63| v_~f2_3~0_150) (= v_~f2_7~0_176 |v_thread2Thread1of1ForFork1_plus_#in~b#1_67|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_77| 2147483647) (= |v_thread2Thread1of1ForFork1_~i~1#1_143| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (= v_~f1_6~0_169 |v_thread2Thread1of1ForFork1_plus_#in~a#1_63|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_79| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_83| |v_thread1Thread1of1ForFork0_plus_~b#1_83|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_73| 2147483647) (= v_~f1_2~0_162 |v_thread1Thread1of1ForFork0_plus_#res#1_79|) (< 0 v_~n_0~0_117) (= v_~f1_2~0_162 |v_thread1Thread1of1ForFork0_minus_#in~a#1_61|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_65| |v_thread1Thread1of1ForFork0_plus_~b#1_83|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_93| |v_thread2Thread1of1ForFork1_plus_#in~b#1_67|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_95| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_95| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_95| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_95| |v_thread1Thread1of1ForFork0_minus_#in~a#1_61|)) InVars {~f1_2~0=v_~f1_2~0_163, ~f2_3~0=v_~f2_3~0_150, ~n_0~0=v_~n_0~0_117, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, ~f2_7~0=v_~f2_7~0_176, ~f1_6~0=v_~f1_6~0_169} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_67|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_61|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_79|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_91|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_65|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_81|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_143|, ~f1_6~0=v_~f1_6~0_168, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_75|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_97|, ~f1_2~0=v_~f1_2~0_162, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_61|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_75|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_73|, ~n_0~0=v_~n_0~0_117, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_93|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_75|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_63|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_77|, ~f2_3~0=v_~f2_3~0_149, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_83|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_97|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_83|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_67|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_95|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_101|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_95|, ~f2_7~0=v_~f2_7~0_175, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_79|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_65|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_75|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [794] L54-5-->L44-5: Formula: (and (<= v_~f1_2~0_170 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_81| 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_69| v_~f2_3~0_158) (= v_~f1_2~0_170 |v_thread1Thread1of1ForFork0_minus_#in~a#1_65|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_99| |v_thread1Thread1of1ForFork0_minus_#in~a#1_65|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_99| |v_thread1Thread1of1ForFork0_minus_#res#1_81|) |v_thread1Thread1of1ForFork0_minus_~a#1_99|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_83| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_87| |v_thread1Thread1of1ForFork0_plus_~b#1_87|)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_99|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_99| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_99|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|) (= v_~f2_3~0_157 |v_thread1Thread1of1ForFork0_minus_#res#1_81|) (= |v_thread1Thread1of1ForFork0_~i~0#1_109| (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 1)) (= v_~f1_2~0_170 |v_thread1Thread1of1ForFork0_plus_#res#1_83|) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_147| v_~n_0~0_121)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_69| |v_thread1Thread1of1ForFork0_plus_~b#1_87|) (<= 0 (+ v_~f1_2~0_170 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_67| v_~f2_3~0_158) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_21|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_99| |v_thread1Thread1of1ForFork0_minus_#in~b#1_67|) (< |v_thread1Thread1of1ForFork0_~i~0#1_110| v_~n_0~0_121) (= |v_thread2Thread1of1ForFork1_#res#1.offset_21| 0) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_69| |v_thread1Thread1of1ForFork0_plus_~a#1_87|) (= v_~f1_2~0_171 |v_thread1Thread1of1ForFork0_plus_#in~a#1_69|) (= (ite (< 0 v_~f1_6~0_176) 1 0) v_~l_8~0_65) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_99| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_99| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_99| 2147483648))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_171, ~f2_3~0=v_~f2_3~0_158, ~n_0~0=v_~n_0~0_121, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_147|, ~f1_6~0=v_~f1_6~0_176} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_81|, ~f2_3~0=v_~f2_3~0_157, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_87|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_65|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_83|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_21|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_87|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_147|, ~f1_6~0=v_~f1_6~0_176, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_67|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_21|, ~f1_2~0=v_~f1_2~0_170, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_65|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_99|, ~n_0~0=v_~n_0~0_121, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_109|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_75|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_173|, ~l_8~0=v_~l_8~0_65, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_83|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_69|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~l_8~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:35,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] $Ultimate##0-->L44-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:37,637 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 10:21:37,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5773 [2022-12-13 10:21:37,638 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 303 flow [2022-12-13 10:21:37,638 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-13 10:21:37,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:37,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:37,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 10:21:37,638 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-13 10:21:37,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash 359039381, now seen corresponding path program 1 times [2022-12-13 10:21:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:37,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576238855] [2022-12-13 10:21:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:37,705 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-13 10:21:37,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:37,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576238855] [2022-12-13 10:21:37,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576238855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:37,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:37,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:37,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726145041] [2022-12-13 10:21:37,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:37,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:21:37,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:37,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:21:37,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:21:37,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:21:37,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:37,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:37,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:21:37,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:37,771 INFO L130 PetriNetUnfolder]: 103/186 cut-off events. [2022-12-13 10:21:37,771 INFO L131 PetriNetUnfolder]: For 749/749 co-relation queries the response was YES. [2022-12-13 10:21:37,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 186 events. 103/186 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 556 event pairs, 31 based on Foata normal form. 12/194 useless extension candidates. Maximal degree in co-relation 717. Up to 169 conditions per place. [2022-12-13 10:21:37,772 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 36 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-12-13 10:21:37,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 451 flow [2022-12-13 10:21:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:21:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:21:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 10:21:37,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-13 10:21:37,773 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 303 flow. Second operand 4 states and 38 transitions. [2022-12-13 10:21:37,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 451 flow [2022-12-13 10:21:37,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 342 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-12-13 10:21:37,776 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 247 flow [2022-12-13 10:21:37,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=247, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 10:21:37,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-13 10:21:37,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:37,777 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 247 flow [2022-12-13 10:21:37,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:37,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:37,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 247 flow [2022-12-13 10:21:37,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 247 flow [2022-12-13 10:21:37,787 INFO L130 PetriNetUnfolder]: 18/68 cut-off events. [2022-12-13 10:21:37,787 INFO L131 PetriNetUnfolder]: For 135/148 co-relation queries the response was YES. [2022-12-13 10:21:37,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 68 events. 18/68 cut-off events. For 135/148 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 225 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 202. Up to 17 conditions per place. [2022-12-13 10:21:37,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 247 flow [2022-12-13 10:21:37,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 10:21:38,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [797] $Ultimate##0-->L44-5: Formula: (and (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_71| 2147483648)) (= v_~f1_6~0_182 |v_thread2Thread1of1ForFork1_minus_#in~a#1_81|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_97| |v_thread2Thread1of1ForFork1_plus_#in~a#1_69|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_79| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_97| |v_thread2Thread1of1ForFork1_plus_~b#1_99|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_103|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_103| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_103|))) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_89| |v_thread1Thread1of1ForFork0_plus_~b#1_89|) |v_thread1Thread1of1ForFork0_plus_#res#1_85|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_101|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_101| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_101|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_67| |v_thread1Thread1of1ForFork0_minus_~a#1_101|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_71| |v_thread1Thread1of1ForFork0_plus_~b#1_89|) (= v_~f2_7~0_188 |v_thread2Thread1of1ForFork1_minus_#in~b#1_81|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_101| |v_thread1Thread1of1ForFork0_minus_#res#1_83|) |v_thread1Thread1of1ForFork0_minus_~a#1_101|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_101| |v_thread1Thread1of1ForFork0_minus_#in~b#1_69|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_79| v_~f1_6~0_182) (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_71| 2147483647) (< |v_thread1Thread1of1ForFork0_~i~0#1_115| (+ v_~n_0~0_125 1)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_71| (+ v_~f1_2~0_178 v_~f2_3~0_163)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_79| 2147483647) (= |v_thread2Thread1of1ForFork1_~i~1#1_153| 1) (= v_~f1_6~0_183 |v_thread2Thread1of1ForFork1_plus_#in~a#1_69|) (= v_~f2_3~0_161 |v_thread1Thread1of1ForFork0_minus_#res#1_83|) (= |v_thread1Thread1of1ForFork0_~i~0#1_115| 2) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_83| 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175|) (<= v_~f1_2~0_176 2147483647) (= v_~f2_7~0_187 |v_thread2Thread1of1ForFork1_minus_#res#1_87|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_71| |v_thread1Thread1of1ForFork0_minus_#in~b#1_69|) (= v_~f2_7~0_188 |v_thread2Thread1of1ForFork1_plus_#in~b#1_73|) (= v_~f1_2~0_176 |v_thread1Thread1of1ForFork0_minus_#in~a#1_67|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_103| |v_thread2Thread1of1ForFork1_minus_#in~a#1_81|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_71| |v_thread1Thread1of1ForFork0_plus_~a#1_89|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_79| 2147483648)) (<= v_~f2_7~0_187 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_99| |v_thread2Thread1of1ForFork1_plus_#in~b#1_73|) (<= 0 (+ v_~f1_2~0_176 2147483648)) (<= 0 (+ v_~f2_7~0_187 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_103| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_103| |v_thread2Thread1of1ForFork1_minus_#res#1_87|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_103| |v_thread2Thread1of1ForFork1_minus_#in~b#1_81|) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_71| 2147483648)) (<= v_~f2_3~0_163 0)) 1 0) 0)) (= v_~f1_2~0_176 |v_thread1Thread1of1ForFork0_plus_#res#1_85|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_71| (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_71| v_~f2_3~0_163))) InVars {~f1_2~0=v_~f1_2~0_178, ~f2_3~0=v_~f2_3~0_163, ~n_0~0=v_~n_0~0_125, ~f2_7~0=v_~f2_7~0_188, ~f1_6~0=v_~f1_6~0_183} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_73|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_67|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_85|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_97|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_71|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_153|, ~f1_6~0=v_~f1_6~0_182, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_81|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_103|, ~f1_2~0=v_~f1_2~0_176, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_67|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_81|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_79|, ~n_0~0=v_~n_0~0_125, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_99|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_77|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_175|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_81|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_69|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_83|, ~f2_3~0=v_~f2_3~0_161, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_89|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_103|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_89|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_73|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_143|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_101|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_115|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_101|, ~f2_7~0=v_~f2_7~0_187, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_85|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_71|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_81|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:40,247 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:40,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2471 [2022-12-13 10:21:40,248 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 267 flow [2022-12-13 10:21:40,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:40,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:40,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:40,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 10:21:40,248 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-13 10:21:40,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:40,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1939491423, now seen corresponding path program 1 times [2022-12-13 10:21:40,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:40,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802144082] [2022-12-13 10:21:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:40,283 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-13 10:21:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:40,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802144082] [2022-12-13 10:21:40,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802144082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:40,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:40,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:21:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720985004] [2022-12-13 10:21:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:40,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:21:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:21:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:21:40,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 10:21:40,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 267 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-13 10:21:40,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:40,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 10:21:40,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:40,355 INFO L130 PetriNetUnfolder]: 95/170 cut-off events. [2022-12-13 10:21:40,355 INFO L131 PetriNetUnfolder]: For 586/586 co-relation queries the response was YES. [2022-12-13 10:21:40,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 170 events. 95/170 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 486 event pairs, 28 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 629. Up to 124 conditions per place. [2022-12-13 10:21:40,356 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 30 selfloop transitions, 7 changer transitions 1/38 dead transitions. [2022-12-13 10:21:40,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 346 flow [2022-12-13 10:21:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:21:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:21:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-13 10:21:40,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2022-12-13 10:21:40,357 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 267 flow. Second operand 3 states and 37 transitions. [2022-12-13 10:21:40,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 346 flow [2022-12-13 10:21:40,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 324 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:40,359 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 216 flow [2022-12-13 10:21:40,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-13 10:21:40,359 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-13 10:21:40,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:40,360 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 216 flow [2022-12-13 10:21:40,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:40,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:40,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 216 flow [2022-12-13 10:21:40,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 216 flow [2022-12-13 10:21:40,367 INFO L130 PetriNetUnfolder]: 17/54 cut-off events. [2022-12-13 10:21:40,367 INFO L131 PetriNetUnfolder]: For 113/124 co-relation queries the response was YES. [2022-12-13 10:21:40,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 54 events. 17/54 cut-off events. For 113/124 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 130 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 163. Up to 15 conditions per place. [2022-12-13 10:21:40,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 216 flow [2022-12-13 10:21:40,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 10:21:40,372 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:40,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 10:21:40,372 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 203 flow [2022-12-13 10:21:40,372 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-13 10:21:40,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:40,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:40,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 10:21:40,373 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-13 10:21:40,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1664854339, now seen corresponding path program 1 times [2022-12-13 10:21:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:40,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192796561] [2022-12-13 10:21:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:40,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:40,663 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-13 10:21:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:40,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192796561] [2022-12-13 10:21:40,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192796561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:40,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:40,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334415130] [2022-12-13 10:21:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:40,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:21:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:21:40,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:21:40,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 10:21:40,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 203 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:21:40,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:40,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 10:21:40,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:40,808 INFO L130 PetriNetUnfolder]: 112/204 cut-off events. [2022-12-13 10:21:40,808 INFO L131 PetriNetUnfolder]: For 473/473 co-relation queries the response was YES. [2022-12-13 10:21:40,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 204 events. 112/204 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 646 event pairs, 15 based on Foata normal form. 1/205 useless extension candidates. Maximal degree in co-relation 681. Up to 161 conditions per place. [2022-12-13 10:21:40,810 INFO L137 encePairwiseOnDemand]: 9/22 looper letters, 28 selfloop transitions, 13 changer transitions 5/46 dead transitions. [2022-12-13 10:21:40,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 378 flow [2022-12-13 10:21:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:21:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:21:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-12-13 10:21:40,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2662337662337662 [2022-12-13 10:21:40,813 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 203 flow. Second operand 7 states and 41 transitions. [2022-12-13 10:21:40,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 378 flow [2022-12-13 10:21:40,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:21:40,815 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 267 flow [2022-12-13 10:21:40,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 10:21:40,815 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2022-12-13 10:21:40,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:40,815 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 267 flow [2022-12-13 10:21:40,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:40,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:40,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 267 flow [2022-12-13 10:21:40,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 267 flow [2022-12-13 10:21:40,825 INFO L130 PetriNetUnfolder]: 20/69 cut-off events. [2022-12-13 10:21:40,825 INFO L131 PetriNetUnfolder]: For 196/207 co-relation queries the response was YES. [2022-12-13 10:21:40,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 69 events. 20/69 cut-off events. For 196/207 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 248. Up to 17 conditions per place. [2022-12-13 10:21:40,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 267 flow [2022-12-13 10:21:40,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 10:21:40,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:41,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_minus_~a#1_109| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_109| |v_thread2Thread1of1ForFork1_minus_#res#1_93|)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_87| |v_thread2Thread1of1ForFork1_plus_#in~b#1_79|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_109| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_109|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_109|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153|) (= v_~f1_6~0_192 |v_thread2Thread1of1ForFork1_minus_#in~a#1_87|) (= |v_thread1Thread1of1ForFork0_~i~0#1_121| 0) (= |v_thread2Thread1of1ForFork1_plus_#res#1_85| v_~f1_6~0_192) (<= v_~f2_7~0_197 2147483647) (< 1 v_~n_0~0_129) (= |v_thread2Thread1of1ForFork1_plus_#res#1_85| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_105| |v_thread2Thread1of1ForFork1_plus_~a#1_103|)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_85| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_109| |v_thread2Thread1of1ForFork1_minus_#in~b#1_87|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_105| |v_thread2Thread1of1ForFork1_plus_#in~b#1_79|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_109| |v_thread2Thread1of1ForFork1_minus_#in~a#1_87|) (= (+ v_~f2_7~0_199 v_~f1_6~0_194) |v_thread2Thread1of1ForFork1_plus_#in~a#1_75|) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_79| 2147483647) (= (+ v_~f2_7~0_199 |v_thread2Thread1of1ForFork1_plus_#in~b#1_79|) |v_thread2Thread1of1ForFork1_plus_#in~a#1_75|) (<= 0 (+ v_~f2_7~0_199 v_~f1_6~0_194 2147483648)) (= v_~f2_7~0_197 |v_thread2Thread1of1ForFork1_minus_#res#1_93|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_103| |v_thread2Thread1of1ForFork1_plus_#in~a#1_75|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_85| 2147483647) (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#in~b#1_79|)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_159|)) InVars {~n_0~0=v_~n_0~0_129, ~f2_7~0=v_~f2_7~0_199, ~f1_6~0=v_~f1_6~0_194} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_75|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_79|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_109|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_103|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#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_159|, ~f1_6~0=v_~f1_6~0_192, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_87|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_79|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_109|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_87|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_85|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_105|, ~n_0~0=v_~n_0~0_129, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_121|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_87|, ~f2_7~0=v_~f2_7~0_197, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_87|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:41,894 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:21:41,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1080 [2022-12-13 10:21:41,895 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 285 flow [2022-12-13 10:21:41,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:21:41,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:41,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:41,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 10:21:41,895 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-13 10:21:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 387604415, now seen corresponding path program 2 times [2022-12-13 10:21:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:41,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007313120] [2022-12-13 10:21:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:42,200 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-13 10:21:42,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:42,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007313120] [2022-12-13 10:21:42,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007313120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:42,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:42,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577183193] [2022-12-13 10:21:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:42,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:21:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:21:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:21:42,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:21:42,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 285 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:21:42,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:42,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:21:42,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:42,400 INFO L130 PetriNetUnfolder]: 134/245 cut-off events. [2022-12-13 10:21:42,401 INFO L131 PetriNetUnfolder]: For 746/746 co-relation queries the response was YES. [2022-12-13 10:21:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 245 events. 134/245 cut-off events. For 746/746 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 862 event pairs, 13 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 1115. Up to 162 conditions per place. [2022-12-13 10:21:42,403 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 37 selfloop transitions, 25 changer transitions 5/67 dead transitions. [2022-12-13 10:21:42,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 616 flow [2022-12-13 10:21:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:21:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:21:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-12-13 10:21:42,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27314814814814814 [2022-12-13 10:21:42,404 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 285 flow. Second operand 9 states and 59 transitions. [2022-12-13 10:21:42,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 616 flow [2022-12-13 10:21:42,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 570 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 10:21:42,407 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 439 flow [2022-12-13 10:21:42,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=439, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-13 10:21:42,407 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2022-12-13 10:21:42,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:42,408 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 439 flow [2022-12-13 10:21:42,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:42,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:42,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 439 flow [2022-12-13 10:21:42,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 439 flow [2022-12-13 10:21:42,420 INFO L130 PetriNetUnfolder]: 30/91 cut-off events. [2022-12-13 10:21:42,420 INFO L131 PetriNetUnfolder]: For 303/315 co-relation queries the response was YES. [2022-12-13 10:21:42,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 91 events. 30/91 cut-off events. For 303/315 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 329 event pairs, 1 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 360. Up to 33 conditions per place. [2022-12-13 10:21:42,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 439 flow [2022-12-13 10:21:42,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 10:21:42,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [815] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_24| 2)) (.cse1 (= v_~f1_2~0_Out_36 |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_32|)) (.cse2 (= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26| v_~f1_6~0_Out_26)) (.cse3 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_32| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|)) (.cse4 (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| 2147483647)) (.cse5 (= |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26| v_~f2_7~0_Out_26)) (.cse6 (= v_~f2_3~0_Out_36 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_36|)) (.cse7 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_36|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|)) (.cse8 (= v_~f1_2~0_Out_36 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_36|)) (.cse9 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_40|)) (.cse10 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_Out_22| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_22|) |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26|)) (.cse11 (<= v_~f1_2~0_Out_36 2147483647)) (.cse12 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| 2147483648))) (.cse13 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| (+ v_~f1_6~0_In_15 v_~f2_7~0_In_13))) (.cse14 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26| 2147483648))) (.cse15 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_26| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_26| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|))) 1 0))) (.cse16 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22| 2147483647)) (.cse17 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26| 2147483647)) (.cse18 (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|)) (.cse19 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_22| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_26|)) (.cse20 (= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_32|) |v_thread1Thread1of1ForFork0_plus_#res#1_Out_36|)) (.cse21 (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|) |v_thread2Thread1of1ForFork1_minus_~a#1_Out_26|)) (.cse22 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| (+ v_~f2_7~0_In_13 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|))) (.cse23 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_30| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_26|)) (.cse24 (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|)) (.cse25 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_22| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|)) (.cse26 (<= 0 (+ v_~f1_2~0_Out_36 2147483648))) (.cse27 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_22|)) (.cse28 (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|))) (.cse29 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_22| v_~f1_6~0_Out_26)) (.cse30 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_Out_36| 2147483647)) (.cse31 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_22| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_22|)) (.cse32 (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|)) (.cse33 (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|)) (.cse34 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|) (= (+ v_~f2_3~0_In_18 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|) .cse8 .cse9 .cse10 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32| 2147483648)) (<= v_~f2_3~0_In_18 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_34| 2) .cse11 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32| (+ v_~f1_2~0_In_20 v_~f2_3~0_In_18)) (< |v_thread1Thread1of1ForFork0_~i~0#1_Out_34| (+ v_~n_0~0_In_25 1)) .cse12 .cse13 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32| 2147483647) .cse14 .cse15 .cse16 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32| 2147483648)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_~f2_3~0_In_18 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|) .cse8 .cse9 .cse10 .cse11 (= v_~f1_2~0_In_20 |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|) .cse12 .cse13 .cse14 .cse15 .cse16 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32| v_~f2_3~0_In_18) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32| 0)) 1 0) 0)) .cse17 (< 1 v_~n_0~0_In_25) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_34| 1) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) InVars {~f2_7~0=v_~f2_7~0_In_13, ~f1_2~0=v_~f1_2~0_In_20, ~f2_3~0=v_~f2_3~0_In_18, ~f1_6~0=v_~f1_6~0_In_15, ~n_0~0=v_~n_0~0_In_25} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_22|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_32|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_Out_22|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_Out_32|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_26|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_26|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_24|, ~f1_6~0=v_~f1_6~0_Out_26, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_Out_22|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_26|, ~f1_2~0=v_~f1_2~0_Out_36, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_22|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_Out_26|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_Out_32|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_Out_22|, ~n_0~0=v_~n_0~0_In_25, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_Out_32|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_40|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_36|, ~f2_3~0=v_~f2_3~0_Out_36, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_32|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_22|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_30|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_34|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|, ~f2_7~0=v_~f2_7~0_Out_26, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_36|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_Out_22|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [816] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_~b#1_127| |v_thread2Thread1of1ForFork1_plus_#in~b#1_101|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_107| 2147483648)) (= v_~f1_6~0_231 |v_thread2Thread1of1ForFork1_plus_#in~a#1_97|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_101| v_~f2_7~0_236) (= |v_thread2Thread1of1ForFork1_plus_~a#1_125| |v_thread2Thread1of1ForFork1_plus_#in~a#1_97|) (<= 0 (+ v_~f2_7~0_235 2147483648)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_157| v_~n_0~0_147)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_109| v_~f2_7~0_236) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_109| v_~f1_6~0_230) (< |v_thread2Thread1of1ForFork1_~i~1#1_184| v_~n_0~0_147) (= |v_thread2Thread1of1ForFork1_minus_~b#1_131| |v_thread2Thread1of1ForFork1_minus_#in~b#1_109|) (= |v_thread2Thread1of1ForFork1_~i~1#1_183| (+ |v_thread2Thread1of1ForFork1_~i~1#1_184| 1)) (<= v_~f2_7~0_235 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_107| v_~f1_6~0_230) (= v_~l_4~0_67 (ite (< 0 v_~f1_2~0_222) 1 0)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_127| |v_thread2Thread1of1ForFork1_plus_~a#1_125|) |v_thread2Thread1of1ForFork1_plus_#res#1_107|) (= v_~f2_7~0_235 |v_thread2Thread1of1ForFork1_minus_#res#1_115|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_107| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_19| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_175| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_203|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_175| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_131| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_131|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_131|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_131| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_131| |v_thread2Thread1of1ForFork1_minus_#res#1_115|)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_19| 0) (= |v_thread2Thread1of1ForFork1_minus_~a#1_131| |v_thread2Thread1of1ForFork1_minus_#in~a#1_109|)) InVars {~f1_2~0=v_~f1_2~0_222, ~n_0~0=v_~n_0~0_147, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, ~f2_7~0=v_~f2_7~0_236, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_184|, ~f1_6~0=v_~f1_6~0_231} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_97|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_101|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_19|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_131|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_125|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_175|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_183|, ~f1_6~0=v_~f1_6~0_230, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_109|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_101|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_131|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_203|, ~f1_2~0=v_~f1_2~0_222, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_109|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_107|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_127|, ~n_0~0=v_~n_0~0_147, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_109|, ~f2_7~0=v_~f2_7~0_235, ~l_4~0=v_~l_4~0_67, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_109|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:21:47,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [815] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_24| 2)) (.cse1 (= v_~f1_2~0_Out_36 |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_32|)) (.cse2 (= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26| v_~f1_6~0_Out_26)) (.cse3 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_32| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|)) (.cse4 (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| 2147483647)) (.cse5 (= |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26| v_~f2_7~0_Out_26)) (.cse6 (= v_~f2_3~0_Out_36 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_36|)) (.cse7 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_36|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|)) (.cse8 (= v_~f1_2~0_Out_36 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_36|)) (.cse9 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_40|)) (.cse10 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_Out_22| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_22|) |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26|)) (.cse11 (<= v_~f1_2~0_Out_36 2147483647)) (.cse12 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| 2147483648))) (.cse13 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| (+ v_~f1_6~0_In_15 v_~f2_7~0_In_13))) (.cse14 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26| 2147483648))) (.cse15 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_26| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_26| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|))) 1 0))) (.cse16 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22| 2147483647)) (.cse17 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_26| 2147483647)) (.cse18 (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|)) (.cse19 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_22| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_26|)) (.cse20 (= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_32|) |v_thread1Thread1of1ForFork0_plus_#res#1_Out_36|)) (.cse21 (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_26| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|) |v_thread2Thread1of1ForFork1_minus_~a#1_Out_26|)) (.cse22 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| (+ v_~f2_7~0_In_13 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|))) (.cse23 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_30| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_26|)) (.cse24 (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|)) (.cse25 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_22| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|)) (.cse26 (<= 0 (+ v_~f1_2~0_Out_36 2147483648))) (.cse27 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_22|)) (.cse28 (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|))) (.cse29 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_22| v_~f1_6~0_Out_26)) (.cse30 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_Out_36| 2147483647)) (.cse31 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_22| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_22|)) (.cse32 (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|)) (.cse33 (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_26| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|)) (.cse34 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|) (= (+ v_~f2_3~0_In_18 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|) .cse8 .cse9 .cse10 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32| 2147483648)) (<= v_~f2_3~0_In_18 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_34| 2) .cse11 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32| (+ v_~f1_2~0_In_20 v_~f2_3~0_In_18)) (< |v_thread1Thread1of1ForFork0_~i~0#1_Out_34| (+ v_~n_0~0_In_25 1)) .cse12 .cse13 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32| 2147483647) .cse14 .cse15 .cse16 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32| 2147483648)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_~f2_3~0_In_18 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|) .cse8 .cse9 .cse10 .cse11 (= v_~f1_2~0_In_20 |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|) .cse12 .cse13 .cse14 .cse15 .cse16 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32| v_~f2_3~0_In_18) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_32| 0)) 1 0) 0)) .cse17 (< 1 v_~n_0~0_In_25) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_34| 1) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34))) InVars {~f2_7~0=v_~f2_7~0_In_13, ~f1_2~0=v_~f1_2~0_In_20, ~f2_3~0=v_~f2_3~0_In_18, ~f1_6~0=v_~f1_6~0_In_15, ~n_0~0=v_~n_0~0_In_25} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_22|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_32|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_Out_22|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_Out_32|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_26|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_26|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_24|, ~f1_6~0=v_~f1_6~0_Out_26, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_Out_22|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_26|, ~f1_2~0=v_~f1_2~0_Out_36, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_22|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_Out_26|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_Out_32|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_Out_22|, ~n_0~0=v_~n_0~0_In_25, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_Out_32|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_40|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_22|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_22|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_36|, ~f2_3~0=v_~f2_3~0_Out_36, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_32|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_26|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_22|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_30|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_32|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_36|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_32|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_34|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_32|, ~f2_7~0=v_~f2_7~0_Out_26, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_36|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_Out_22|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:21:50,062 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] [2022-12-13 10:21:50,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:21:50,714 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:21:50,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8306 [2022-12-13 10:21:50,714 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 507 flow [2022-12-13 10:21:50,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:21:50,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:50,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 10:21:50,715 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-13 10:21:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1101213883, now seen corresponding path program 1 times [2022-12-13 10:21:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:50,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831014812] [2022-12-13 10:21:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:50,747 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-13 10:21:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:50,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831014812] [2022-12-13 10:21:50,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831014812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:50,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:50,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:21:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345484670] [2022-12-13 10:21:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:50,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:21:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:21:50,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:21:50,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 10:21:50,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:50,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:50,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 10:21:50,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:50,829 INFO L130 PetriNetUnfolder]: 113/198 cut-off events. [2022-12-13 10:21:50,830 INFO L131 PetriNetUnfolder]: For 1138/1138 co-relation queries the response was YES. [2022-12-13 10:21:50,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 198 events. 113/198 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 595 event pairs, 35 based on Foata normal form. 14/210 useless extension candidates. Maximal degree in co-relation 971. Up to 185 conditions per place. [2022-12-13 10:21:50,832 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 4 changer transitions 2/44 dead transitions. [2022-12-13 10:21:50,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 540 flow [2022-12-13 10:21:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:21:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:21:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 10:21:50,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 10:21:50,832 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 507 flow. Second operand 3 states and 34 transitions. [2022-12-13 10:21:50,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 540 flow [2022-12-13 10:21:50,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 455 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-12-13 10:21:50,836 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 346 flow [2022-12-13 10:21:50,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-13 10:21:50,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2022-12-13 10:21:50,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:50,837 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 346 flow [2022-12-13 10:21:50,837 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:50,837 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:50,837 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 346 flow [2022-12-13 10:21:50,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 346 flow [2022-12-13 10:21:50,848 INFO L130 PetriNetUnfolder]: 26/76 cut-off events. [2022-12-13 10:21:50,848 INFO L131 PetriNetUnfolder]: For 199/213 co-relation queries the response was YES. [2022-12-13 10:21:50,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 76 events. 26/76 cut-off events. For 199/213 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 236 event pairs, 1 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 292. Up to 32 conditions per place. [2022-12-13 10:21:50,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 346 flow [2022-12-13 10:21:50,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 10:21:50,849 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:21:50,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 10:21:50,850 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 346 flow [2022-12-13 10:21:50,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:50,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:50,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:50,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 10:21:50,851 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-13 10:21:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2136587474, now seen corresponding path program 1 times [2022-12-13 10:21:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:50,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165867852] [2022-12-13 10:21:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:21:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165867852] [2022-12-13 10:21:51,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165867852] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:21:51,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158207965] [2022-12-13 10:21:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:51,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:21:51,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:21:51,311 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-13 10:21:51,351 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-13 10:21:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:51,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 10:21:51,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:21:52,215 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-13 10:21:52,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:21:53,074 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-13 10:21:53,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158207965] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:21:53,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:21:53,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:21:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761623650] [2022-12-13 10:21:53,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:21:53,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:21:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:21:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:21:53,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 10:21:53,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 346 flow. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:53,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:53,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 10:21:53,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:53,512 INFO L130 PetriNetUnfolder]: 111/219 cut-off events. [2022-12-13 10:21:53,512 INFO L131 PetriNetUnfolder]: For 631/631 co-relation queries the response was YES. [2022-12-13 10:21:53,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 219 events. 111/219 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 786 event pairs, 3 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 923. Up to 137 conditions per place. [2022-12-13 10:21:53,514 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 36 selfloop transitions, 12 changer transitions 10/58 dead transitions. [2022-12-13 10:21:53,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 552 flow [2022-12-13 10:21:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:21:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:21:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-13 10:21:53,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25142857142857145 [2022-12-13 10:21:53,515 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 346 flow. Second operand 7 states and 44 transitions. [2022-12-13 10:21:53,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 552 flow [2022-12-13 10:21:53,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 534 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 10:21:53,519 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 340 flow [2022-12-13 10:21:53,519 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2022-12-13 10:21:53,519 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 30 predicate places. [2022-12-13 10:21:53,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:53,519 INFO L89 Accepts]: Start accepts. Operand has 50 places, 38 transitions, 340 flow [2022-12-13 10:21:53,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:53,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:53,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 38 transitions, 340 flow [2022-12-13 10:21:53,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 340 flow [2022-12-13 10:21:53,530 INFO L130 PetriNetUnfolder]: 23/84 cut-off events. [2022-12-13 10:21:53,531 INFO L131 PetriNetUnfolder]: For 253/265 co-relation queries the response was YES. [2022-12-13 10:21:53,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 84 events. 23/84 cut-off events. For 253/265 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 298 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 326. Up to 32 conditions per place. [2022-12-13 10:21:53,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 340 flow [2022-12-13 10:21:53,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 10:21:54,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:21:54,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 724 [2022-12-13 10:21:54,243 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 334 flow [2022-12-13 10:21:54,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:21:54,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:21:54,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:21:54,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 10:21:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 10:21:54,448 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-13 10:21:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:21:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash -214797048, now seen corresponding path program 1 times [2022-12-13 10:21:54,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:21:54,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740992812] [2022-12-13 10:21:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:21:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:21:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:21:54,816 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-13 10:21:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:21:54,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740992812] [2022-12-13 10:21:54,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740992812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:21:54,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:21:54,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:21:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022446119] [2022-12-13 10:21:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:21:54,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:21:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:21:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:21:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:21:54,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:21:54,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 334 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:21:54,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:21:54,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:21:54,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:21:55,019 INFO L130 PetriNetUnfolder]: 119/233 cut-off events. [2022-12-13 10:21:55,020 INFO L131 PetriNetUnfolder]: For 835/835 co-relation queries the response was YES. [2022-12-13 10:21:55,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 233 events. 119/233 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 829 event pairs, 9 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 1136. Up to 196 conditions per place. [2022-12-13 10:21:55,022 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 38 selfloop transitions, 15 changer transitions 5/58 dead transitions. [2022-12-13 10:21:55,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 573 flow [2022-12-13 10:21:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:21:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:21:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-13 10:21:55,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26785714285714285 [2022-12-13 10:21:55,023 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 334 flow. Second operand 7 states and 45 transitions. [2022-12-13 10:21:55,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 573 flow [2022-12-13 10:21:55,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 518 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 10:21:55,027 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 386 flow [2022-12-13 10:21:55,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 10:21:55,028 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 10:21:55,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:21:55,028 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 386 flow [2022-12-13 10:21:55,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:21:55,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:21:55,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 386 flow [2022-12-13 10:21:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 386 flow [2022-12-13 10:21:55,041 INFO L130 PetriNetUnfolder]: 25/92 cut-off events. [2022-12-13 10:21:55,041 INFO L131 PetriNetUnfolder]: For 323/337 co-relation queries the response was YES. [2022-12-13 10:21:55,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 92 events. 25/92 cut-off events. For 323/337 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 341 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 362. Up to 33 conditions per place. [2022-12-13 10:21:55,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 386 flow [2022-12-13 10:21:55,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 10:21:58,192 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] $Ultimate##0-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_~a#1_125| |v_thread1Thread1of1ForFork0_plus_#in~a#1_107|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_137| |v_thread1Thread1of1ForFork0_minus_#in~b#1_105|) (= v_~f1_2~0_240 |v_thread1Thread1of1ForFork0_minus_#in~a#1_103|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_119| v_~f2_3~0_223) (< |v_thread1Thread1of1ForFork0_~i~0#1_169| (+ v_~n_0~0_157 1)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_107| |v_thread1Thread1of1ForFork0_minus_#in~b#1_105|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_137|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_137| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_137|))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_211|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_121| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_125| |v_thread1Thread1of1ForFork0_plus_~b#1_125|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_103| |v_thread1Thread1of1ForFork0_minus_~a#1_137|) (= v_~f1_2~0_240 |v_thread1Thread1of1ForFork0_plus_#res#1_121|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_107| |v_thread1Thread1of1ForFork0_plus_~b#1_125|) (let ((.cse0 (= v_~f2_7~0_259 |v_thread2Thread1of1ForFork1_minus_#res#1_129|)) (.cse1 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_121| 2147483647)) (.cse2 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_123| 2147483648))) (.cse3 (= |v_thread1Thread1of1ForFork0_plus_#res#1_122| |v_thread1Thread1of1ForFork0_plus_#in~a#1_107|)) (.cse4 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_104| |v_thread1Thread1of1ForFork0_plus_#in~a#1_107|)) (.cse5 (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| 2147483647)) (.cse6 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| |v_thread2Thread1of1ForFork1_plus_~a#1_139|)) (.cse7 (= |v_thread2Thread1of1ForFork1_plus_~b#1_141| |v_thread2Thread1of1ForFork1_plus_#in~b#1_115|)) (.cse8 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_123| v_~f1_6~0_254)) (.cse9 (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_138| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_138|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_138|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|)) (.cse10 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_138| |v_thread1Thread1of1ForFork0_minus_#res#1_120|) |v_thread1Thread1of1ForFork0_minus_~a#1_138|)) (.cse11 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| |v_thread1Thread1of1ForFork0_plus_~b#1_126|)) (.cse12 (= |v_thread2Thread1of1ForFork1_minus_~a#1_145| |v_thread2Thread1of1ForFork1_minus_#in~a#1_123|)) (.cse13 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|)) (.cse14 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_123| v_~f2_7~0_260))) (.cse15 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_107| |v_thread1Thread1of1ForFork0_minus_#res#1_120|)) (.cse16 (= |v_thread1Thread1of1ForFork0_plus_~a#1_126| |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|)) (.cse17 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| 2147483648))) (.cse18 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_121| 2147483648))) (.cse19 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_123| 2147483647)) (.cse20 (= |v_thread1Thread1of1ForFork0_minus_~b#1_138| |v_thread1Thread1of1ForFork0_minus_#in~b#1_106|)) (.cse21 (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_145| |v_thread2Thread1of1ForFork1_minus_#res#1_129|) |v_thread2Thread1of1ForFork1_minus_~a#1_145|)) (.cse22 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| (+ v_~f2_7~0_260 v_~f1_6~0_255))) (.cse23 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|)) (.cse24 (= |v_thread2Thread1of1ForFork1_plus_#res#1_121| v_~f1_6~0_254)) (.cse25 (= |v_thread2Thread1of1ForFork1_plus_#res#1_121| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_141| |v_thread2Thread1of1ForFork1_plus_~a#1_139|))) (.cse26 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_145| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_145|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_145|)) 1 0))) (.cse27 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_115| |v_thread2Thread1of1ForFork1_minus_#in~b#1_123|)) (.cse28 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_104| |v_thread1Thread1of1ForFork0_minus_~a#1_138|)) (.cse29 (= |v_thread2Thread1of1ForFork1_minus_~b#1_145| |v_thread2Thread1of1ForFork1_minus_#in~b#1_123|)) (.cse30 (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_199|)) (.cse31 (= |v_thread1Thread1of1ForFork0_plus_#res#1_122| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_126| |v_thread1Thread1of1ForFork0_plus_~b#1_126|)))) (or (and (= |v_thread1Thread1of1ForFork0_~i~0#1_169| 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_108| (+ v_~f1_2~0_242 v_~f2_3~0_225)) .cse9 .cse10 .cse11 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| |v_thread1Thread1of1ForFork0_minus_#in~b#1_106|) .cse12 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| 2147483647) .cse13 .cse14 .cse15 .cse16 .cse17 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| 2147483648)) (<= v_~f2_3~0_225 0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| v_~f2_3~0_225) |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_169| 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| v_~f2_3~0_225) .cse18 .cse19 .cse20 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_120| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_138| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_138| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_138|))) 1 0) 0)) .cse21 .cse22 .cse23 .cse24 (= v_~f1_2~0_242 |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_106| v_~f2_3~0_225) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31))) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_137| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_137| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_137|))) 1 0) 0)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_119| 2147483647) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_137| |v_thread1Thread1of1ForFork0_minus_#res#1_119|) |v_thread1Thread1of1ForFork0_minus_~a#1_137|) (<= v_~f1_2~0_240 2147483647) (<= 0 (+ v_~f1_2~0_240 2147483648))) InVars {~f1_2~0=v_~f1_2~0_242, ~f2_3~0=v_~f2_3~0_225, ~n_0~0=v_~n_0~0_157, ~f2_7~0=v_~f2_7~0_260, ~f1_6~0=v_~f1_6~0_255} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_103|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_121|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_139|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_107|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_199|, ~f1_6~0=v_~f1_6~0_254, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_123|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_145|, ~f1_2~0=v_~f1_2~0_240, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_103|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_123|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_121|, ~n_0~0=v_~n_0~0_157, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_141|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_113|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_211|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_123|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_111|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_119|, ~f2_3~0=v_~f2_3~0_223, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_125|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_145|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_125|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_115|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_105|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_137|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_169|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_137|, ~f2_7~0=v_~f2_7~0_259, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_121|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_107|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_123|} AuxVars[|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|, |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|, |v_thread1Thread1of1ForFork0_minus_~a#1_138|, |v_thread1Thread1of1ForFork0_plus_~b#1_126|, |v_thread1Thread1of1ForFork0_minus_#in~a#1_104|, |v_thread1Thread1of1ForFork0_plus_~a#1_126|, |v_thread1Thread1of1ForFork0_plus_#res#1_122|, |v_thread1Thread1of1ForFork0_minus_#in~b#1_106|, |v_thread1Thread1of1ForFork0_plus_#in~b#1_108|, |v_thread1Thread1of1ForFork0_minus_#res#1_120|, |v_thread1Thread1of1ForFork0_minus_~b#1_138|] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:22:01,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] $Ultimate##0-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_~a#1_125| |v_thread1Thread1of1ForFork0_plus_#in~a#1_107|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_137| |v_thread1Thread1of1ForFork0_minus_#in~b#1_105|) (= v_~f1_2~0_240 |v_thread1Thread1of1ForFork0_minus_#in~a#1_103|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_119| v_~f2_3~0_223) (< |v_thread1Thread1of1ForFork0_~i~0#1_169| (+ v_~n_0~0_157 1)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_107| |v_thread1Thread1of1ForFork0_minus_#in~b#1_105|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_137|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_137| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_137|))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_211|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_121| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_125| |v_thread1Thread1of1ForFork0_plus_~b#1_125|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_103| |v_thread1Thread1of1ForFork0_minus_~a#1_137|) (= v_~f1_2~0_240 |v_thread1Thread1of1ForFork0_plus_#res#1_121|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_107| |v_thread1Thread1of1ForFork0_plus_~b#1_125|) (let ((.cse0 (= v_~f2_7~0_259 |v_thread2Thread1of1ForFork1_minus_#res#1_129|)) (.cse1 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_121| 2147483647)) (.cse2 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_123| 2147483648))) (.cse3 (= |v_thread1Thread1of1ForFork0_plus_#res#1_122| |v_thread1Thread1of1ForFork0_plus_#in~a#1_107|)) (.cse4 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_104| |v_thread1Thread1of1ForFork0_plus_#in~a#1_107|)) (.cse5 (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| 2147483647)) (.cse6 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| |v_thread2Thread1of1ForFork1_plus_~a#1_139|)) (.cse7 (= |v_thread2Thread1of1ForFork1_plus_~b#1_141| |v_thread2Thread1of1ForFork1_plus_#in~b#1_115|)) (.cse8 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_123| v_~f1_6~0_254)) (.cse9 (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_138| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_138|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_138|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|)) (.cse10 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_138| |v_thread1Thread1of1ForFork0_minus_#res#1_120|) |v_thread1Thread1of1ForFork0_minus_~a#1_138|)) (.cse11 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| |v_thread1Thread1of1ForFork0_plus_~b#1_126|)) (.cse12 (= |v_thread2Thread1of1ForFork1_minus_~a#1_145| |v_thread2Thread1of1ForFork1_minus_#in~a#1_123|)) (.cse13 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|)) (.cse14 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_123| v_~f2_7~0_260))) (.cse15 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_107| |v_thread1Thread1of1ForFork0_minus_#res#1_120|)) (.cse16 (= |v_thread1Thread1of1ForFork0_plus_~a#1_126| |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|)) (.cse17 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| 2147483648))) (.cse18 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_121| 2147483648))) (.cse19 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_123| 2147483647)) (.cse20 (= |v_thread1Thread1of1ForFork0_minus_~b#1_138| |v_thread1Thread1of1ForFork0_minus_#in~b#1_106|)) (.cse21 (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_145| |v_thread2Thread1of1ForFork1_minus_#res#1_129|) |v_thread2Thread1of1ForFork1_minus_~a#1_145|)) (.cse22 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_111| (+ v_~f2_7~0_260 v_~f1_6~0_255))) (.cse23 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|)) (.cse24 (= |v_thread2Thread1of1ForFork1_plus_#res#1_121| v_~f1_6~0_254)) (.cse25 (= |v_thread2Thread1of1ForFork1_plus_#res#1_121| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_141| |v_thread2Thread1of1ForFork1_plus_~a#1_139|))) (.cse26 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_145| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_145|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_145|)) 1 0))) (.cse27 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_115| |v_thread2Thread1of1ForFork1_minus_#in~b#1_123|)) (.cse28 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_104| |v_thread1Thread1of1ForFork0_minus_~a#1_138|)) (.cse29 (= |v_thread2Thread1of1ForFork1_minus_~b#1_145| |v_thread2Thread1of1ForFork1_minus_#in~b#1_123|)) (.cse30 (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_199|)) (.cse31 (= |v_thread1Thread1of1ForFork0_plus_#res#1_122| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_126| |v_thread1Thread1of1ForFork0_plus_~b#1_126|)))) (or (and (= |v_thread1Thread1of1ForFork0_~i~0#1_169| 3) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_108| (+ v_~f1_2~0_242 v_~f2_3~0_225)) .cse9 .cse10 .cse11 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| |v_thread1Thread1of1ForFork0_minus_#in~b#1_106|) .cse12 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| 2147483647) .cse13 .cse14 .cse15 .cse16 .cse17 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| 2147483648)) (<= v_~f2_3~0_225 0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| v_~f2_3~0_225) |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_169| 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_108| v_~f2_3~0_225) .cse18 .cse19 .cse20 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_120| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_138| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_138| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_138|))) 1 0) 0)) .cse21 .cse22 .cse23 .cse24 (= v_~f1_2~0_242 |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_106| v_~f2_3~0_225) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31))) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_137| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_137| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_137|))) 1 0) 0)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_119| 2147483647) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_137| |v_thread1Thread1of1ForFork0_minus_#res#1_119|) |v_thread1Thread1of1ForFork0_minus_~a#1_137|) (<= v_~f1_2~0_240 2147483647) (<= 0 (+ v_~f1_2~0_240 2147483648))) InVars {~f1_2~0=v_~f1_2~0_242, ~f2_3~0=v_~f2_3~0_225, ~n_0~0=v_~n_0~0_157, ~f2_7~0=v_~f2_7~0_260, ~f1_6~0=v_~f1_6~0_255} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_103|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_121|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_139|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_107|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_189|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_199|, ~f1_6~0=v_~f1_6~0_254, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_123|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_145|, ~f1_2~0=v_~f1_2~0_240, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_103|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_123|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_121|, ~n_0~0=v_~n_0~0_157, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_141|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_113|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_211|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_123|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_111|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_119|, ~f2_3~0=v_~f2_3~0_223, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_125|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_145|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_125|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_115|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_105|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_137|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_169|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_137|, ~f2_7~0=v_~f2_7~0_259, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_121|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_107|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_123|} AuxVars[|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_212|, |v_thread1Thread1of1ForFork0_plus_#in~a#1_108|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|, |v_thread1Thread1of1ForFork0_minus_~a#1_138|, |v_thread1Thread1of1ForFork0_plus_~b#1_126|, |v_thread1Thread1of1ForFork0_minus_#in~a#1_104|, |v_thread1Thread1of1ForFork0_plus_~a#1_126|, |v_thread1Thread1of1ForFork0_plus_#res#1_122|, |v_thread1Thread1of1ForFork0_minus_#in~b#1_106|, |v_thread1Thread1of1ForFork0_plus_#in~b#1_108|, |v_thread1Thread1of1ForFork0_minus_#res#1_120|, |v_thread1Thread1of1ForFork0_minus_~b#1_138|] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] [2022-12-13 10:22:02,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:02,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_129| |v_thread2Thread1of1ForFork1_plus_~a#1_157|) (= |v_thread1Thread1of1ForFork0_~i~0#1_190| 2) (= |v_thread2Thread1of1ForFork1_minus_~a#1_163| |v_thread2Thread1of1ForFork1_minus_#in~a#1_141|) (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_129| 2147483647) (= |v_thread2Thread1of1ForFork1_#res#1.offset_35| 0) (= v_~f2_7~0_289 |v_thread2Thread1of1ForFork1_minus_#res#1_147|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_223|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_138| 2147483647) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_35|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_122| |v_thread1Thread1of1ForFork0_minus_~a#1_156|) (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_141| 2147483647) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_156| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_156|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_156|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198|) (not (= (ite (or (<= v_~f2_3~0_243 (+ 2147483648 |v_thread1Thread1of1ForFork0_plus_#in~a#1_126|)) (<= v_~f2_3~0_243 0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_126| v_~f2_3~0_243) |v_thread1Thread1of1ForFork0_plus_#in~a#1_126|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_133| |v_thread2Thread1of1ForFork1_minus_#in~b#1_141|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_156| |v_thread1Thread1of1ForFork0_minus_#res#1_138|) |v_thread1Thread1of1ForFork0_minus_~a#1_156|) (= (ite (< 0 v_~f1_6~0_286) 1 0) v_~l_8~0_78) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_126| |v_thread1Thread1of1ForFork0_minus_#in~b#1_124|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_139| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_126| |v_thread1Thread1of1ForFork0_plus_~b#1_144|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_139| v_~f1_6~0_286) (= |v_thread2Thread1of1ForFork1_plus_~b#1_159| |v_thread2Thread1of1ForFork1_plus_#in~b#1_133|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_156| |v_thread1Thread1of1ForFork0_minus_#in~b#1_124|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_163| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_163| |v_thread2Thread1of1ForFork1_minus_#res#1_147|)) (< |v_thread1Thread1of1ForFork0_~i~0#1_190| (+ v_~n_0~0_171 1)) (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_126| 2147483647) (<= v_~f1_2~0_266 2147483647) (= v_~f1_2~0_266 |v_thread1Thread1of1ForFork0_minus_#in~a#1_122|) (<= 0 (+ v_~f1_2~0_266 2147483648)) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_156| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_156|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_156| 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_141| v_~f1_6~0_286) (= |v_thread2Thread1of1ForFork1_minus_~b#1_163| |v_thread2Thread1of1ForFork1_minus_#in~b#1_141|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_140| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_144| |v_thread1Thread1of1ForFork0_plus_~b#1_144|)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_139| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_159| |v_thread2Thread1of1ForFork1_plus_~a#1_157|)) (= v_~f1_2~0_266 |v_thread1Thread1of1ForFork0_plus_#res#1_140|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_207| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_141| 2147483648)) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_163|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_163| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_163|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_207|) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_223| v_~n_0~0_171)) (= (+ v_~f1_2~0_267 v_~f2_3~0_243) |v_thread1Thread1of1ForFork0_plus_#in~a#1_126|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_139| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#res#1_138| v_~f2_3~0_242) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_129| 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_198| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_129| (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_141| v_~f2_7~0_290)) (= (+ v_~f2_7~0_290 v_~f1_6~0_287) |v_thread2Thread1of1ForFork1_plus_#in~a#1_129|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_144| |v_thread1Thread1of1ForFork0_plus_#in~a#1_126|)) InVars {~f1_2~0=v_~f1_2~0_267, ~f2_3~0=v_~f2_3~0_243, ~n_0~0=v_~n_0~0_171, ~f2_7~0=v_~f2_7~0_290, ~f1_6~0=v_~f1_6~0_287} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_133|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_122|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_35|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_134|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_157|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_126|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_147|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_207|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_223|, ~f1_6~0=v_~f1_6~0_286, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_141|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_163|, ~f1_2~0=v_~f1_2~0_266, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_116|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_141|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_139|, ~n_0~0=v_~n_0~0_171, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_159|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_126|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_230|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_141|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_129|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_138|, ~f2_3~0=v_~f2_3~0_242, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_144|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_163|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_144|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_133|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_124|, 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_198|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_35|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_156|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_190|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_156|, ~l_8~0=v_~l_8~0_78, ~f2_7~0=v_~f2_7~0_289, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_140|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_126|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_141|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:02,955 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:22:02,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7928 [2022-12-13 10:22:02,956 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 429 flow [2022-12-13 10:22:02,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:02,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:02,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:02,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 10:22:02,956 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-13 10:22:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash -480177198, now seen corresponding path program 2 times [2022-12-13 10:22:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:02,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041210692] [2022-12-13 10:22:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:03,496 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-13 10:22:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041210692] [2022-12-13 10:22:03,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041210692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:03,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:03,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:22:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139487629] [2022-12-13 10:22:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:03,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:22:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:22:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:22:03,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 10:22:03,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:03,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:03,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 10:22:03,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:03,722 INFO L130 PetriNetUnfolder]: 131/257 cut-off events. [2022-12-13 10:22:03,722 INFO L131 PetriNetUnfolder]: For 1336/1376 co-relation queries the response was YES. [2022-12-13 10:22:03,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 257 events. 131/257 cut-off events. For 1336/1376 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 993 event pairs, 6 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 1308. Up to 196 conditions per place. [2022-12-13 10:22:03,724 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 39 selfloop transitions, 19 changer transitions 8/67 dead transitions. [2022-12-13 10:22:03,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 721 flow [2022-12-13 10:22:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:22:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:22:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-12-13 10:22:03,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27232142857142855 [2022-12-13 10:22:03,725 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 429 flow. Second operand 8 states and 61 transitions. [2022-12-13 10:22:03,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 721 flow [2022-12-13 10:22:03,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 655 flow, removed 26 selfloop flow, removed 5 redundant places. [2022-12-13 10:22:03,734 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 487 flow [2022-12-13 10:22:03,734 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-13 10:22:03,737 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-13 10:22:03,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:03,737 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 487 flow [2022-12-13 10:22:03,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:03,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:03,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 487 flow [2022-12-13 10:22:03,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 487 flow [2022-12-13 10:22:03,752 INFO L130 PetriNetUnfolder]: 32/103 cut-off events. [2022-12-13 10:22:03,752 INFO L131 PetriNetUnfolder]: For 398/412 co-relation queries the response was YES. [2022-12-13 10:22:03,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 103 events. 32/103 cut-off events. For 398/412 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 390 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 417. Up to 40 conditions per place. [2022-12-13 10:22:03,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 487 flow [2022-12-13 10:22:03,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 10:22:04,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [837] L44-5-->thread1EXIT: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_167| |v_thread1Thread1of1ForFork0_minus_#res#1_149|) |v_thread1Thread1of1ForFork0_minus_~a#1_167|) (<= v_~f1_2~0_280 2147483647) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_201| 1) |v_thread1Thread1of1ForFork0_~i~0#1_200|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_133| |v_thread1Thread1of1ForFork0_minus_~a#1_167|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_31| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_200| v_~n_0~0_177)) (<= 0 (+ v_~f1_2~0_280 2147483648)) (= |v_thread1Thread1of1ForFork0_#res#1.base_31| 0) (< |v_thread1Thread1of1ForFork0_~i~0#1_201| v_~n_0~0_177) (= v_~f1_2~0_280 |v_thread1Thread1of1ForFork0_minus_#in~a#1_133|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_155| |v_thread1Thread1of1ForFork0_plus_#in~a#1_137|) (= (ite (< 0 v_~f1_2~0_280) 1 0) v_~l_4~0_78) (= v_~f1_2~0_281 |v_thread1Thread1of1ForFork0_plus_#in~a#1_137|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_209| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_241|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_167| |v_thread1Thread1of1ForFork0_minus_#in~b#1_135|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_137| |v_thread1Thread1of1ForFork0_plus_~b#1_155|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_167| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_167|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_167| 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_137| v_~f2_3~0_257) (= |v_thread1Thread1of1ForFork0_minus_#res#1_149| v_~f2_3~0_256) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_209| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_167| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_167|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_167|)) 1 0)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_149| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_135| v_~f2_3~0_257) (= |v_thread1Thread1of1ForFork0_plus_#res#1_151| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_155| |v_thread1Thread1of1ForFork0_plus_~b#1_155|)) (= v_~f1_2~0_280 |v_thread1Thread1of1ForFork0_plus_#res#1_151|)) InVars {~f1_2~0=v_~f1_2~0_281, ~f2_3~0=v_~f2_3~0_257, ~n_0~0=v_~n_0~0_177, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_201|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_149|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_31|, ~f2_3~0=v_~f2_3~0_256, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_155|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_133|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_142|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_155|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_137|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_135|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_209|, ~f1_2~0=v_~f1_2~0_280, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_124|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_167|, ~n_0~0=v_~n_0~0_177, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_200|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_134|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_167|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_241|, ~l_4~0=v_~l_4~0_78, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_151|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_137|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:22:04,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:22:04,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] [2022-12-13 10:22:04,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] [2022-12-13 10:22:04,635 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:22:04,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 899 [2022-12-13 10:22:04,636 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 479 flow [2022-12-13 10:22:04,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:04,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:04,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:04,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 10:22:04,636 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-13 10:22:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1514951291, now seen corresponding path program 1 times [2022-12-13 10:22:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:04,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232586933] [2022-12-13 10:22:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:04,695 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-13 10:22:04,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:04,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232586933] [2022-12-13 10:22:04,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232586933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:04,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:04,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:22:04,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142639572] [2022-12-13 10:22:04,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:04,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:22:04,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:04,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:22:04,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:22:04,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 10:22:04,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 479 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-13 10:22:04,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:04,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 10:22:04,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:04,790 INFO L130 PetriNetUnfolder]: 110/210 cut-off events. [2022-12-13 10:22:04,791 INFO L131 PetriNetUnfolder]: For 1172/1200 co-relation queries the response was YES. [2022-12-13 10:22:04,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 210 events. 110/210 cut-off events. For 1172/1200 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 707 event pairs, 33 based on Foata normal form. 8/218 useless extension candidates. Maximal degree in co-relation 1011. Up to 195 conditions per place. [2022-12-13 10:22:04,792 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 41 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 10:22:04,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 499 flow [2022-12-13 10:22:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:22:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:22:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 10:22:04,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43209876543209874 [2022-12-13 10:22:04,793 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 479 flow. Second operand 3 states and 35 transitions. [2022-12-13 10:22:04,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 499 flow [2022-12-13 10:22:04,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 429 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 10:22:04,797 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 328 flow [2022-12-13 10:22:04,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-13 10:22:04,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2022-12-13 10:22:04,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:04,799 INFO L89 Accepts]: Start accepts. Operand has 47 places, 41 transitions, 328 flow [2022-12-13 10:22:04,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:04,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:04,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 41 transitions, 328 flow [2022-12-13 10:22:04,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 328 flow [2022-12-13 10:22:04,812 INFO L130 PetriNetUnfolder]: 27/91 cut-off events. [2022-12-13 10:22:04,812 INFO L131 PetriNetUnfolder]: For 216/230 co-relation queries the response was YES. [2022-12-13 10:22:04,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 91 events. 27/91 cut-off events. For 216/230 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 307. Up to 30 conditions per place. [2022-12-13 10:22:04,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 328 flow [2022-12-13 10:22:04,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 10:22:04,813 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:04,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 10:22:04,814 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 328 flow [2022-12-13 10:22:04,814 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-13 10:22:04,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:04,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:04,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 10:22:04,815 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-13 10:22:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1559210018, now seen corresponding path program 1 times [2022-12-13 10:22:04,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:04,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531032863] [2022-12-13 10:22:04,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:05,393 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-13 10:22:05,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:05,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531032863] [2022-12-13 10:22:05,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531032863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:05,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:05,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:05,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149195602] [2022-12-13 10:22:05,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:05,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:22:05,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:05,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:22:05,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:22:05,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 10:22:05,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 328 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:05,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:05,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 10:22:05,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:05,619 INFO L130 PetriNetUnfolder]: 130/252 cut-off events. [2022-12-13 10:22:05,619 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 10:22:05,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 252 events. 130/252 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 924 event pairs, 9 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 1097. Up to 215 conditions per place. [2022-12-13 10:22:05,621 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 42 selfloop transitions, 15 changer transitions 5/62 dead transitions. [2022-12-13 10:22:05,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 571 flow [2022-12-13 10:22:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:22:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:22:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-13 10:22:05,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26785714285714285 [2022-12-13 10:22:05,622 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 328 flow. Second operand 7 states and 45 transitions. [2022-12-13 10:22:05,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 571 flow [2022-12-13 10:22:05,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 565 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:22:05,626 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 425 flow [2022-12-13 10:22:05,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=425, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 10:22:05,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-13 10:22:05,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:05,627 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 425 flow [2022-12-13 10:22:05,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:05,627 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:05,627 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 425 flow [2022-12-13 10:22:05,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 425 flow [2022-12-13 10:22:05,641 INFO L130 PetriNetUnfolder]: 30/102 cut-off events. [2022-12-13 10:22:05,641 INFO L131 PetriNetUnfolder]: For 382/396 co-relation queries the response was YES. [2022-12-13 10:22:05,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 102 events. 30/102 cut-off events. For 382/396 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 398 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 419. Up to 34 conditions per place. [2022-12-13 10:22:05,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 425 flow [2022-12-13 10:22:05,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 10:22:11,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] $Ultimate##0-->L54-5: Formula: (let ((.cse1 (< |v_thread2Thread1of1ForFork1_~i~1#1_Out_36| (+ v_~n_0~0_In_36 1))) (.cse4 (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_38| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|) |v_thread2Thread1of1ForFork1_minus_~a#1_Out_38|)) (.cse37 (= |v_thread2Thread1of1ForFork1_minus_#res#1_Out_38| v_~f2_7~0_Out_38)) (.cse38 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_Out_34| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_34|) |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38|)) (.cse39 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_34|)) (.cse43 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38| 2147483648))) (.cse44 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_42| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_38|)) (.cse45 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_34| v_~f1_6~0_Out_38)) (.cse2 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|)) (.cse28 (<= v_~f2_3~0_In_23 0)) (.cse35 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_44| 2)) (.cse33 (+ v_~f1_2~0_In_26 v_~f2_3~0_In_23)) (.cse0 (= v_~f1_2~0_Out_46 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_46|)) (.cse3 (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_42| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|)) (.cse11 (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_36| 3)) (.cse40 (= v_~f2_3~0_Out_46 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_46|)) (.cse41 (= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_42| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_42|) |v_thread1Thread1of1ForFork0_plus_#res#1_Out_46|)) (.cse42 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_42| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|)) (.cse46 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_46|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|)) (.cse47 (<= 0 (+ v_~f1_2~0_Out_46 2147483648))) (.cse48 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_46| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|)) 1 0))) (.cse49 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|)) (.cse52 (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42| 0)) 1 0) 0))) (.cse53 (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_42| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|)) (.cse55 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_46| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_50|)) (.cse56 (= v_~f1_2~0_Out_46 |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_42|)) (.cse57 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_Out_46| 2147483647)) (.cse59 (<= v_~f1_2~0_Out_46 2147483647)) (.cse36 (+ v_~f1_6~0_In_23 v_~f2_7~0_In_19)) (.cse50 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_34|)) (.cse51 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_34|)) (.cse54 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38| 2147483647)) (.cse58 (= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38| v_~f1_6~0_Out_38)) (.cse60 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_38|)) (.cse61 (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_34|)) (.cse62 (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_38| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_38|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse5 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_137| |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|)) (.cse6 (= |v_thread1Thread1of1ForFork0_plus_~a#1_159| |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|)) (.cse7 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_133| |v_thread2Thread1of1ForFork1_plus_~a#1_161|)) (.cse8 (= |v_thread2Thread1of1ForFork1_minus_~a#1_167| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_167| |v_thread2Thread1of1ForFork1_minus_#res#1_151|))) (.cse9 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_137| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|)) (.cse10 (= |v_thread1Thread1of1ForFork0_plus_#res#1_155| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|)) (.cse12 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_211| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_167| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_167|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_167|)) 1 0))) (.cse13 (= |v_thread1Thread1of1ForFork0_minus_~b#1_171| |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|)) (.cse14 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_133| .cse36)) (.cse15 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_163| |v_thread2Thread1of1ForFork1_plus_~a#1_161|) |v_thread2Thread1of1ForFork1_plus_#res#1_143|)) (.cse16 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_145| 2147483648))) (.cse17 (= |v_thread2Thread1of1ForFork1_plus_~b#1_163| |v_thread2Thread1of1ForFork1_plus_#in~b#1_137|)) (.cse18 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| |v_thread1Thread1of1ForFork0_plus_~b#1_159|)) (.cse19 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_145| |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34|)) (.cse20 (= |v_thread1Thread1of1ForFork0_plus_#res#1_155| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_159| |v_thread1Thread1of1ForFork0_plus_~b#1_159|))) (.cse21 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_plus_#res#1_143|)) (.cse22 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_145| 2147483647)) (.cse23 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42| |v_thread1Thread1of1ForFork0_minus_#res#1_153|)) (.cse24 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_137| |v_thread1Thread1of1ForFork0_minus_~a#1_171|)) (.cse25 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_171| |v_thread1Thread1of1ForFork0_minus_#res#1_153|) |v_thread1Thread1of1ForFork0_minus_~a#1_171|)) (.cse26 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_133| (+ v_~f2_7~0_In_19 |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|))) (.cse27 (= |v_thread2Thread1of1ForFork1_minus_~b#1_167| |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|)) (.cse29 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_245|)) (.cse30 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_171|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_171| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_171|))) 1 0))) (.cse31 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_211| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|)) (.cse32 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_minus_#res#1_151|)) (.cse34 (= |v_thread2Thread1of1ForFork1_minus_~a#1_167| |v_thread2Thread1of1ForFork1_minus_#in~a#1_145|))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|) .cse10 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| 2147483647) .cse11 .cse12 (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| v_~f2_3~0_In_23) |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (not (= (ite (or .cse28 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| 2147483648))) 1 0) 0)) .cse29 .cse30 .cse31 .cse32 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_44| 3) (= .cse33 |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|) .cse34) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= v_~f2_3~0_In_23 |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|) .cse13 .cse14 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| v_~f2_3~0_In_23) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse35 (= v_~f1_2~0_In_26 |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_171| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_171|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_171| 0)) 1 0) 0)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_153| 2147483647) .cse34))) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62) (and .cse1 .cse4 .cse37 .cse38 .cse39 .cse43 .cse44 .cse45 (let ((.cse63 (= |v_thread2Thread1of1ForFork1_plus_#res#1_144| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_164| |v_thread2Thread1of1ForFork1_plus_~a#1_162|))) (.cse64 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_146| 2147483648))) (.cse65 (= |v_thread2Thread1of1ForFork1_minus_~a#1_168| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_168| |v_thread2Thread1of1ForFork1_minus_#res#1_152|))) (.cse66 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_minus_#res#1_152|)) (.cse67 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_134| (+ v_~f2_7~0_In_19 |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|))) (.cse68 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_134| .cse36)) (.cse69 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_134| |v_thread2Thread1of1ForFork1_plus_~a#1_162|)) (.cse70 (= |v_thread2Thread1of1ForFork1_plus_~b#1_164| |v_thread2Thread1of1ForFork1_plus_#in~b#1_138|)) (.cse71 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_146| 2147483647)) (.cse72 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_138| |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|)) (.cse73 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_plus_#res#1_144|)) (.cse74 (= |v_thread2Thread1of1ForFork1_minus_~b#1_168| |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|)) (.cse75 (= |v_thread2Thread1of1ForFork1_minus_~a#1_168| |v_thread2Thread1of1ForFork1_minus_#in~a#1_146|)) (.cse76 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_146| |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34|)) (.cse77 (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_168|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_168| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_168|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|)) (.cse78 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_240|))) (or (and .cse63 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42| (+ v_~f2_3~0_In_23 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|)) .cse64 .cse0 .cse2 .cse65 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42| 2147483647) .cse3 .cse66 .cse67 .cse68 .cse11 .cse69 .cse70 .cse71 .cse40 .cse41 .cse42 .cse72 .cse73 .cse46 .cse47 .cse48 .cse49 .cse74 .cse75 .cse53 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42| 2147483648)) .cse28) 1 0) 0)) .cse35 .cse55 .cse56 .cse57 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42| 2147483648)) .cse59 .cse76 .cse77 (= .cse33 |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|) .cse78) (and .cse63 .cse64 .cse0 .cse65 .cse3 .cse66 .cse67 .cse68 (= v_~f1_2~0_In_26 |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|) .cse11 .cse69 .cse70 .cse71 .cse40 .cse41 .cse42 .cse72 .cse73 (= v_~f2_3~0_In_23 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|) .cse46 .cse47 .cse48 .cse49 .cse74 .cse75 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_44| 1) .cse52 .cse53 .cse55 .cse56 .cse57 .cse59 .cse76 .cse77 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42| v_~f2_3~0_In_23) .cse78))) .cse50 .cse51 .cse54 .cse58 .cse60 .cse61 .cse62))) InVars {~f2_7~0=v_~f2_7~0_In_19, ~f1_2~0=v_~f1_2~0_In_26, ~f2_3~0=v_~f2_3~0_In_23, ~f1_6~0=v_~f1_6~0_In_23, ~n_0~0=v_~n_0~0_In_36} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_34|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_42|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_Out_34|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_Out_42|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_38|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_38|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_36|, ~f1_6~0=v_~f1_6~0_Out_38, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_Out_34|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_38|, ~f1_2~0=v_~f1_2~0_Out_46, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_34|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_Out_38|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_Out_42|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_Out_34|, ~n_0~0=v_~n_0~0_In_36, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_Out_42|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_50|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_34|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_46|, ~f2_3~0=v_~f2_3~0_Out_46, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_42|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_42|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_42|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_46|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_44|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|, ~f2_7~0=v_~f2_7~0_Out_38, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_46|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_Out_34|} AuxVars[|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_245|, |v_thread2Thread1of1ForFork1_minus_~b#1_167|, |v_thread2Thread1of1ForFork1_minus_#res#1_151|, |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|, |v_thread2Thread1of1ForFork1_minus_~b#1_168|, |v_thread1Thread1of1ForFork0_plus_#res#1_155|, |v_thread1Thread1of1ForFork0_minus_~a#1_171|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_211|, |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|, |v_thread2Thread1of1ForFork1_plus_#in~b#1_137|, |v_thread2Thread1of1ForFork1_plus_#in~b#1_138|, |v_thread1Thread1of1ForFork0_plus_~a#1_159|, |v_thread2Thread1of1ForFork1_plus_~a#1_162|, |v_thread2Thread1of1ForFork1_plus_~a#1_161|, |v_thread1Thread1of1ForFork0_minus_~b#1_171|, |v_thread1Thread1of1ForFork0_plus_#in~b#1_141|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|, |v_thread2Thread1of1ForFork1_minus_#res#1_152|, |v_thread2Thread1of1ForFork1_plus_~b#1_164|, |v_thread2Thread1of1ForFork1_plus_~b#1_163|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_240|, |v_thread1Thread1of1ForFork0_minus_#in~a#1_137|, |v_thread2Thread1of1ForFork1_plus_#res#1_144|, |v_thread2Thread1of1ForFork1_plus_#res#1_143|, |v_thread2Thread1of1ForFork1_plus_#in~a#1_133|, |v_thread2Thread1of1ForFork1_plus_#in~a#1_134|, |v_thread1Thread1of1ForFork0_minus_#res#1_153|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213|, |v_thread1Thread1of1ForFork0_plus_~b#1_159|, |v_thread2Thread1of1ForFork1_minus_#in~a#1_146|, |v_thread2Thread1of1ForFork1_minus_#in~a#1_145|, |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|, |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|, |v_thread2Thread1of1ForFork1_minus_~a#1_167|, |v_thread2Thread1of1ForFork1_minus_~a#1_168|] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:17,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:18,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [843] $Ultimate##0-->thread2EXIT: Formula: (and (= (ite (< 0 v_~f1_6~0_304) 1 0) v_~l_8~0_92) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_237| v_~n_0~0_187)) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_minus_~b#1_173| |v_thread2Thread1of1ForFork1_minus_#in~b#1_151|)) (.cse38 (< |v_thread2Thread1of1ForFork1_~i~1#1_237| (+ v_~n_0~0_187 1))) (.cse4 (= v_~f1_2~0_294 |v_thread1Thread1of1ForFork0_plus_#res#1_159|)) (.cse39 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_149| 2147483648))) (.cse6 (= |v_thread1Thread1of1ForFork0_minus_#res#1_157| v_~f2_3~0_264)) (.cse7 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_217| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|)) (.cse40 (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_173| |v_thread2Thread1of1ForFork1_minus_#res#1_157|) |v_thread2Thread1of1ForFork1_minus_~a#1_173|)) (.cse9 (= |v_thread1Thread1of1ForFork0_plus_#res#1_159| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_163| |v_thread1Thread1of1ForFork0_plus_~b#1_163|))) (.cse10 (= |v_thread1Thread1of1ForFork0_minus_~b#1_175| |v_thread1Thread1of1ForFork0_minus_#in~b#1_143|)) (.cse11 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_217| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_175|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_175| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_175|))) 1 0))) (.cse36 (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_175| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_175|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_175| 0)) 1 0) 0))) (.cse12 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_157| 2147483647)) (.cse13 (<= 0 (+ v_~f1_2~0_294 2147483648))) (.cse41 (= v_~f2_7~0_297 |v_thread2Thread1of1ForFork1_minus_#res#1_157|)) (.cse42 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_151| v_~f1_6~0_304)) (.cse17 (= v_~f1_2~0_294 |v_thread1Thread1of1ForFork0_minus_#in~a#1_141|)) (.cse18 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| |v_thread1Thread1of1ForFork0_minus_#in~b#1_143|)) (.cse43 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_149| 2147483647)) (.cse44 (= |v_thread2Thread1of1ForFork1_plus_#res#1_149| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_169| |v_thread2Thread1of1ForFork1_plus_~a#1_167|))) (.cse19 (= |v_thread1Thread1of1ForFork0_plus_~a#1_163| |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|)) (.cse5 (= |v_thread1Thread1of1ForFork0_~i~0#1_214| 2)) (.cse27 (+ v_~f1_2~0_295 v_~f2_3~0_265)) (.cse20 (<= v_~f2_3~0_265 0)) (.cse14 (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_237|)) (.cse37 (+ v_~f2_7~0_298 v_~f1_6~0_305)) (.cse21 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_175| |v_thread1Thread1of1ForFork0_minus_#res#1_157|) |v_thread1Thread1of1ForFork0_minus_~a#1_175|)) (.cse45 (= |v_thread2Thread1of1ForFork1_plus_~b#1_169| |v_thread2Thread1of1ForFork1_plus_#in~b#1_143|)) (.cse28 (<= v_~f1_2~0_294 2147483647)) (.cse46 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_245|)) (.cse47 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_143| |v_thread2Thread1of1ForFork1_minus_#in~b#1_151|)) (.cse48 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_173|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_173| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_173|))) 1 0))) (.cse30 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_141| |v_thread1Thread1of1ForFork0_minus_~a#1_175|)) (.cse49 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_139| |v_thread2Thread1of1ForFork1_plus_~a#1_167|)) (.cse50 (= |v_thread2Thread1of1ForFork1_minus_~a#1_173| |v_thread2Thread1of1ForFork1_minus_#in~a#1_151|)) (.cse35 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| |v_thread1Thread1of1ForFork0_plus_~b#1_163|)) (.cse51 (= |v_thread2Thread1of1ForFork1_plus_#res#1_149| v_~f1_6~0_304))) (or (and .cse0 (let ((.cse1 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_152| 2147483648))) (.cse2 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_218| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|)) (.cse3 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_145| |v_thread2Thread1of1ForFork1_minus_#in~b#1_152|)) (.cse8 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_141| |v_thread2Thread1of1ForFork1_plus_~a#1_168|)) (.cse15 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_152| 2147483647)) (.cse16 (= |v_thread2Thread1of1ForFork1_plus_~b#1_170| |v_thread2Thread1of1ForFork1_plus_#in~b#1_145|)) (.cse22 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_139| |v_thread2Thread1of1ForFork1_minus_#in~a#1_152|)) (.cse23 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_170| |v_thread2Thread1of1ForFork1_plus_~a#1_168|) |v_thread2Thread1of1ForFork1_plus_#res#1_150|)) (.cse24 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_218| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_175| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_175|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_175|)) 1 0))) (.cse25 (= (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_152| v_~f2_7~0_298) |v_thread2Thread1of1ForFork1_plus_#in~a#1_141|)) (.cse26 (= |v_thread2Thread1of1ForFork1_minus_~a#1_175| |v_thread2Thread1of1ForFork1_minus_#in~a#1_152|)) (.cse29 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_143| |v_thread2Thread1of1ForFork1_minus_#res#1_159|)) (.cse31 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_141| .cse37)) (.cse32 (= |v_thread2Thread1of1ForFork1_minus_~a#1_175| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_175| |v_thread2Thread1of1ForFork1_minus_#res#1_159|))) (.cse33 (= |v_thread2Thread1of1ForFork1_minus_~b#1_175| |v_thread2Thread1of1ForFork1_minus_#in~b#1_152|)) (.cse34 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_139| |v_thread2Thread1of1ForFork1_plus_#res#1_150|))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| 2147483648)) .cse20) 1 0) 0)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= .cse27 |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|) .cse28 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| 2147483647) .cse29 .cse30 (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| v_~f2_3~0_265) |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|) .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse1 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| v_~f2_3~0_265) .cse2 .cse3 (= v_~f1_2~0_295 |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse36 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 (= |v_thread1Thread1of1ForFork0_~i~0#1_214| 1) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_143| v_~f2_3~0_265) .cse31 .cse32 .cse33 .cse34 .cse35))) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse38 .cse4 .cse39 .cse6 .cse7 .cse40 .cse9 .cse10 .cse11 .cse36 .cse12 .cse13 .cse41 .cse42 .cse17 .cse18 .cse43 .cse44 .cse19 (let ((.cse52 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|)) (.cse53 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_139| |v_thread2Thread1of1ForFork1_minus_#in~a#1_153|)) (.cse54 (= |v_thread1Thread1of1ForFork0_plus_#res#1_160| |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|)) (.cse55 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_143| |v_thread2Thread1of1ForFork1_minus_#res#1_158|)) (.cse56 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_140| (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_153| v_~f2_7~0_298))) (.cse57 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_171| |v_thread2Thread1of1ForFork1_plus_~a#1_169|) |v_thread2Thread1of1ForFork1_plus_#res#1_151|)) (.cse58 (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_176|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_176| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_176|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|)) (.cse59 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_153| 2147483647)) (.cse60 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_142| |v_thread1Thread1of1ForFork0_minus_~a#1_176|)) (.cse61 (= |v_thread2Thread1of1ForFork1_minus_~a#1_174| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_174| |v_thread2Thread1of1ForFork1_minus_#res#1_158|))) (.cse62 (= |v_thread2Thread1of1ForFork1_minus_~b#1_174| |v_thread2Thread1of1ForFork1_minus_#in~b#1_153|)) (.cse63 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_142| |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|)) (.cse64 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246|)) (.cse65 (= |v_thread1Thread1of1ForFork0_plus_~a#1_164| |v_thread1Thread1of1ForFork0_plus_#in~a#1_146|)) (.cse66 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| |v_thread1Thread1of1ForFork0_minus_#res#1_158|)) (.cse67 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_140| |v_thread2Thread1of1ForFork1_plus_~a#1_169|)) (.cse68 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_146| |v_thread1Thread1of1ForFork0_plus_~b#1_164|)) (.cse69 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_176| |v_thread1Thread1of1ForFork0_minus_#res#1_158|) |v_thread1Thread1of1ForFork0_minus_~a#1_176|)) (.cse70 (= |v_thread2Thread1of1ForFork1_minus_~a#1_174| |v_thread2Thread1of1ForFork1_minus_#in~a#1_153|)) (.cse71 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_174|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_174| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_174|))) 1 0))) (.cse72 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_140| .cse37)) (.cse73 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_139| |v_thread2Thread1of1ForFork1_plus_#res#1_151|)) (.cse74 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_144| |v_thread2Thread1of1ForFork1_minus_#in~b#1_153|)) (.cse75 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_153| 2147483648))) (.cse76 (= |v_thread1Thread1of1ForFork0_minus_~b#1_176| |v_thread1Thread1of1ForFork0_minus_#in~b#1_144|)) (.cse77 (= |v_thread1Thread1of1ForFork0_plus_#res#1_160| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_164| |v_thread1Thread1of1ForFork0_plus_~b#1_164|))) (.cse78 (= |v_thread2Thread1of1ForFork1_plus_~b#1_171| |v_thread2Thread1of1ForFork1_plus_#in~b#1_144|))) (or (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_146| v_~f2_3~0_265) .cse52 (= v_~f1_2~0_295 |v_thread1Thread1of1ForFork0_plus_#in~a#1_146|) .cse53 .cse54 .cse5 .cse55 .cse56 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_144| v_~f2_3~0_265) .cse14 .cse57 .cse58 .cse59 (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_176| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_176| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_176|))) 1 0) 0)) .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_158| 2147483647) .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78) (and .cse52 (= .cse27 |v_thread1Thread1of1ForFork0_plus_#in~a#1_146|) .cse53 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_146| 2147483648)) .cse20) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_146| v_~f2_3~0_265) |v_thread1Thread1of1ForFork0_plus_#in~a#1_146|) .cse54 .cse55 .cse56 .cse14 .cse57 .cse58 .cse59 .cse60 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_146| 2147483647) .cse61 .cse62 .cse63 .cse64 (= |v_thread1Thread1of1ForFork0_~i~0#1_214| 3) .cse65 .cse66 .cse67 .cse68 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_146| |v_thread1Thread1of1ForFork0_minus_#in~b#1_144|) .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78))) .cse21 .cse45 .cse28 .cse46 .cse47 .cse48 .cse30 .cse49 .cse50 .cse35 .cse51))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_49| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_49|)) InVars {~f1_2~0=v_~f1_2~0_295, ~f2_3~0=v_~f2_3~0_265, ~n_0~0=v_~n_0~0_187, ~f2_7~0=v_~f2_7~0_298, ~f1_6~0=v_~f1_6~0_305} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_137|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_141|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_49|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_167|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_146|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_157|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_237|, ~f1_6~0=v_~f1_6~0_304, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_145|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_173|, ~f1_2~0=v_~f1_2~0_294, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_151|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_149|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_128|, ~n_0~0=v_~n_0~0_187, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_169|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_138|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_151|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_139|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_157|, ~f2_3~0=v_~f2_3~0_264, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_163|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_173|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_163|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_143|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_245|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_143|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_217|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_49|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_175|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_214|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_175|, ~l_8~0=v_~l_8~0_92, ~f2_7~0=v_~f2_7~0_297, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_159|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_145|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_145|} AuxVars[|v_thread1Thread1of1ForFork0_plus_#in~b#1_146|, |v_thread2Thread1of1ForFork1_plus_~b#1_171|, |v_thread1Thread1of1ForFork0_minus_#in~a#1_142|, |v_thread2Thread1of1ForFork1_plus_~b#1_170|, |v_thread1Thread1of1ForFork0_minus_~a#1_176|, |v_thread2Thread1of1ForFork1_plus_#res#1_151|, |v_thread1Thread1of1ForFork0_plus_~a#1_164|, |v_thread2Thread1of1ForFork1_plus_#res#1_150|, |v_thread2Thread1of1ForFork1_plus_#in~a#1_140|, |v_thread2Thread1of1ForFork1_plus_#in~a#1_141|, |v_thread2Thread1of1ForFork1_minus_#in~a#1_153|, |v_thread2Thread1of1ForFork1_minus_#in~a#1_152|, |v_thread1Thread1of1ForFork0_minus_~b#1_176|, |v_thread2Thread1of1ForFork1_minus_~a#1_174|, |v_thread2Thread1of1ForFork1_minus_~a#1_175|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_218|, |v_thread1Thread1of1ForFork0_minus_#in~b#1_144|, |v_thread2Thread1of1ForFork1_minus_#res#1_158|, |v_thread2Thread1of1ForFork1_minus_#res#1_159|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219|, |v_thread2Thread1of1ForFork1_plus_~a#1_169|, |v_thread2Thread1of1ForFork1_minus_~b#1_175|, |v_thread2Thread1of1ForFork1_plus_~a#1_168|, |v_thread1Thread1of1ForFork0_minus_#res#1_158|, |v_thread1Thread1of1ForFork0_plus_#in~a#1_146|, |v_thread2Thread1of1ForFork1_minus_#in~b#1_152|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_250|, |v_thread2Thread1of1ForFork1_minus_~b#1_174|, |v_thread1Thread1of1ForFork0_plus_#res#1_160|, |v_thread1Thread1of1ForFork0_plus_~b#1_164|, |v_thread2Thread1of1ForFork1_minus_#in~b#1_153|, |v_thread2Thread1of1ForFork1_plus_#in~b#1_144|, |v_thread2Thread1of1ForFork1_plus_#in~b#1_145|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_218|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_246|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_247|] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:23,419 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:22:23,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17793 [2022-12-13 10:22:23,420 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 457 flow [2022-12-13 10:22:23,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:23,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:23,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:23,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 10:22:23,420 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-13 10:22:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1684980124, now seen corresponding path program 2 times [2022-12-13 10:22:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:23,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002578964] [2022-12-13 10:22:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:23,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:23,978 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-13 10:22:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002578964] [2022-12-13 10:22:23,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002578964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:23,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:23,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242663023] [2022-12-13 10:22:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:23,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:22:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:22:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:22:23,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:22:23,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 457 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:23,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:23,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:22:23,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:24,244 INFO L130 PetriNetUnfolder]: 130/252 cut-off events. [2022-12-13 10:22:24,244 INFO L131 PetriNetUnfolder]: For 1127/1127 co-relation queries the response was YES. [2022-12-13 10:22:24,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 252 events. 130/252 cut-off events. For 1127/1127 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 938 event pairs, 9 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 1313. Up to 215 conditions per place. [2022-12-13 10:22:24,250 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 39 selfloop transitions, 16 changer transitions 5/60 dead transitions. [2022-12-13 10:22:24,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 632 flow [2022-12-13 10:22:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:22:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:22:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-12-13 10:22:24,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2328042328042328 [2022-12-13 10:22:24,251 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 457 flow. Second operand 7 states and 44 transitions. [2022-12-13 10:22:24,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 632 flow [2022-12-13 10:22:24,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 572 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-13 10:22:24,256 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 452 flow [2022-12-13 10:22:24,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=452, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-13 10:22:24,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 37 predicate places. [2022-12-13 10:22:24,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:24,257 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 452 flow [2022-12-13 10:22:24,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:24,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:24,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 452 flow [2022-12-13 10:22:24,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 452 flow [2022-12-13 10:22:24,278 INFO L130 PetriNetUnfolder]: 30/104 cut-off events. [2022-12-13 10:22:24,278 INFO L131 PetriNetUnfolder]: For 366/384 co-relation queries the response was YES. [2022-12-13 10:22:24,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 104 events. 30/104 cut-off events. For 366/384 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 407 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 442. Up to 35 conditions per place. [2022-12-13 10:22:24,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 452 flow [2022-12-13 10:22:24,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 10:22:24,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:22:24,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] $Ultimate##0-->L54-5: Formula: (let ((.cse1 (< |v_thread2Thread1of1ForFork1_~i~1#1_Out_36| (+ v_~n_0~0_In_36 1))) (.cse4 (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_38| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|) |v_thread2Thread1of1ForFork1_minus_~a#1_Out_38|)) (.cse37 (= |v_thread2Thread1of1ForFork1_minus_#res#1_Out_38| v_~f2_7~0_Out_38)) (.cse38 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_Out_34| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_34|) |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38|)) (.cse39 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_34|)) (.cse43 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38| 2147483648))) (.cse44 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_42| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_38|)) (.cse45 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_34| v_~f1_6~0_Out_38)) (.cse2 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|)) (.cse28 (<= v_~f2_3~0_In_23 0)) (.cse35 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_44| 2)) (.cse33 (+ v_~f1_2~0_In_26 v_~f2_3~0_In_23)) (.cse0 (= v_~f1_2~0_Out_46 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_46|)) (.cse3 (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_42| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|)) (.cse11 (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_36| 3)) (.cse40 (= v_~f2_3~0_Out_46 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_46|)) (.cse41 (= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_42| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_42|) |v_thread1Thread1of1ForFork0_plus_#res#1_Out_46|)) (.cse42 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_42| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|)) (.cse46 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_46|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|)) (.cse47 (<= 0 (+ v_~f1_2~0_Out_46 2147483648))) (.cse48 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_46| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|)) 1 0))) (.cse49 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|)) (.cse52 (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_Out_42| 0)) 1 0) 0))) (.cse53 (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_42| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|)) (.cse55 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_46| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_50|)) (.cse56 (= v_~f1_2~0_Out_46 |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_42|)) (.cse57 (<= |v_thread1Thread1of1ForFork0_minus_#res#1_Out_46| 2147483647)) (.cse59 (<= v_~f1_2~0_Out_46 2147483647)) (.cse36 (+ v_~f1_6~0_In_23 v_~f2_7~0_In_19)) (.cse50 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_34|)) (.cse51 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_34|)) (.cse54 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38| 2147483647)) (.cse58 (= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_38| v_~f1_6~0_Out_38)) (.cse60 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_38|)) (.cse61 (= |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_34|)) (.cse62 (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_38| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_38|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse5 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_137| |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|)) (.cse6 (= |v_thread1Thread1of1ForFork0_plus_~a#1_159| |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|)) (.cse7 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_133| |v_thread2Thread1of1ForFork1_plus_~a#1_161|)) (.cse8 (= |v_thread2Thread1of1ForFork1_minus_~a#1_167| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_167| |v_thread2Thread1of1ForFork1_minus_#res#1_151|))) (.cse9 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_137| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|)) (.cse10 (= |v_thread1Thread1of1ForFork0_plus_#res#1_155| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|)) (.cse12 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_211| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_167| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_167|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_167|)) 1 0))) (.cse13 (= |v_thread1Thread1of1ForFork0_minus_~b#1_171| |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|)) (.cse14 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_133| .cse36)) (.cse15 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_163| |v_thread2Thread1of1ForFork1_plus_~a#1_161|) |v_thread2Thread1of1ForFork1_plus_#res#1_143|)) (.cse16 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_145| 2147483648))) (.cse17 (= |v_thread2Thread1of1ForFork1_plus_~b#1_163| |v_thread2Thread1of1ForFork1_plus_#in~b#1_137|)) (.cse18 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| |v_thread1Thread1of1ForFork0_plus_~b#1_159|)) (.cse19 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_145| |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34|)) (.cse20 (= |v_thread1Thread1of1ForFork0_plus_#res#1_155| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_159| |v_thread1Thread1of1ForFork0_plus_~b#1_159|))) (.cse21 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_plus_#res#1_143|)) (.cse22 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_145| 2147483647)) (.cse23 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42| |v_thread1Thread1of1ForFork0_minus_#res#1_153|)) (.cse24 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_137| |v_thread1Thread1of1ForFork0_minus_~a#1_171|)) (.cse25 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_171| |v_thread1Thread1of1ForFork0_minus_#res#1_153|) |v_thread1Thread1of1ForFork0_minus_~a#1_171|)) (.cse26 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_133| (+ v_~f2_7~0_In_19 |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|))) (.cse27 (= |v_thread2Thread1of1ForFork1_minus_~b#1_167| |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|)) (.cse29 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_245|)) (.cse30 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_171|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_171| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_171|))) 1 0))) (.cse31 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_211| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|)) (.cse32 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_minus_#res#1_151|)) (.cse34 (= |v_thread2Thread1of1ForFork1_minus_~a#1_167| |v_thread2Thread1of1ForFork1_minus_#in~a#1_145|))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|) .cse10 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| 2147483647) .cse11 .cse12 (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| v_~f2_3~0_In_23) |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (not (= (ite (or .cse28 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| 2147483648))) 1 0) 0)) .cse29 .cse30 .cse31 .cse32 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_44| 3) (= .cse33 |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|) .cse34) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= v_~f2_3~0_In_23 |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|) .cse13 .cse14 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_141| v_~f2_3~0_In_23) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse35 (= v_~f1_2~0_In_26 |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_171| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_171|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_171| 0)) 1 0) 0)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_153| 2147483647) .cse34))) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62) (and .cse1 .cse4 .cse37 .cse38 .cse39 .cse43 .cse44 .cse45 (let ((.cse63 (= |v_thread2Thread1of1ForFork1_plus_#res#1_144| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_164| |v_thread2Thread1of1ForFork1_plus_~a#1_162|))) (.cse64 (<= 0 (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_146| 2147483648))) (.cse65 (= |v_thread2Thread1of1ForFork1_minus_~a#1_168| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_168| |v_thread2Thread1of1ForFork1_minus_#res#1_152|))) (.cse66 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34| |v_thread2Thread1of1ForFork1_minus_#res#1_152|)) (.cse67 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_134| (+ v_~f2_7~0_In_19 |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|))) (.cse68 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_134| .cse36)) (.cse69 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_134| |v_thread2Thread1of1ForFork1_plus_~a#1_162|)) (.cse70 (= |v_thread2Thread1of1ForFork1_plus_~b#1_164| |v_thread2Thread1of1ForFork1_plus_#in~b#1_138|)) (.cse71 (<= |v_thread2Thread1of1ForFork1_minus_#in~b#1_146| 2147483647)) (.cse72 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_138| |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|)) (.cse73 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34| |v_thread2Thread1of1ForFork1_plus_#res#1_144|)) (.cse74 (= |v_thread2Thread1of1ForFork1_minus_~b#1_168| |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|)) (.cse75 (= |v_thread2Thread1of1ForFork1_minus_~a#1_168| |v_thread2Thread1of1ForFork1_minus_#in~a#1_146|)) (.cse76 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_146| |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34|)) (.cse77 (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_168|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_168| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_168|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|)) (.cse78 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_240|))) (or (and .cse63 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42| (+ v_~f2_3~0_In_23 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|)) .cse64 .cse0 .cse2 .cse65 (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42| 2147483647) .cse3 .cse66 .cse67 .cse68 .cse11 .cse69 .cse70 .cse71 .cse40 .cse41 .cse42 .cse72 .cse73 .cse46 .cse47 .cse48 .cse49 .cse74 .cse75 .cse53 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42| 2147483648)) .cse28) 1 0) 0)) .cse35 .cse55 .cse56 .cse57 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42| 2147483648)) .cse59 .cse76 .cse77 (= .cse33 |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|) .cse78) (and .cse63 .cse64 .cse0 .cse65 .cse3 .cse66 .cse67 .cse68 (= v_~f1_2~0_In_26 |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|) .cse11 .cse69 .cse70 .cse71 .cse40 .cse41 .cse42 .cse72 .cse73 (= v_~f2_3~0_In_23 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|) .cse46 .cse47 .cse48 .cse49 .cse74 .cse75 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_44| 1) .cse52 .cse53 .cse55 .cse56 .cse57 .cse59 .cse76 .cse77 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42| v_~f2_3~0_In_23) .cse78))) .cse50 .cse51 .cse54 .cse58 .cse60 .cse61 .cse62))) InVars {~f2_7~0=v_~f2_7~0_In_19, ~f1_2~0=v_~f1_2~0_In_26, ~f2_3~0=v_~f2_3~0_In_23, ~f1_6~0=v_~f1_6~0_In_23, ~n_0~0=v_~n_0~0_In_36} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_34|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_42|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_Out_34|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_Out_42|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_38|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_38|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_36|, ~f1_6~0=v_~f1_6~0_Out_38, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_Out_34|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_38|, ~f1_2~0=v_~f1_2~0_Out_46, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_34|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_Out_38|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_Out_42|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_Out_34|, ~n_0~0=v_~n_0~0_In_36, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_Out_42|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_50|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_34|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_34|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_46|, ~f2_3~0=v_~f2_3~0_Out_46, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_42|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_38|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_42|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_34|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_42|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_42|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_46|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_42|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_44|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_42|, ~f2_7~0=v_~f2_7~0_Out_38, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_46|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_42|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_Out_34|} AuxVars[|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_245|, |v_thread2Thread1of1ForFork1_minus_~b#1_167|, |v_thread2Thread1of1ForFork1_minus_#res#1_151|, |v_thread2Thread1of1ForFork1_minus_#in~b#1_146|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_212|, |v_thread2Thread1of1ForFork1_minus_~b#1_168|, |v_thread1Thread1of1ForFork0_plus_#res#1_155|, |v_thread1Thread1of1ForFork0_minus_~a#1_171|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_211|, |v_thread2Thread1of1ForFork1_minus_#in~b#1_145|, |v_thread2Thread1of1ForFork1_plus_#in~b#1_137|, |v_thread2Thread1of1ForFork1_plus_#in~b#1_138|, |v_thread1Thread1of1ForFork0_plus_~a#1_159|, |v_thread2Thread1of1ForFork1_plus_~a#1_162|, |v_thread2Thread1of1ForFork1_plus_~a#1_161|, |v_thread1Thread1of1ForFork0_minus_~b#1_171|, |v_thread1Thread1of1ForFork0_plus_#in~b#1_141|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|, |v_thread2Thread1of1ForFork1_minus_#res#1_152|, |v_thread2Thread1of1ForFork1_plus_~b#1_164|, |v_thread2Thread1of1ForFork1_plus_~b#1_163|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_240|, |v_thread1Thread1of1ForFork0_minus_#in~a#1_137|, |v_thread2Thread1of1ForFork1_plus_#res#1_144|, |v_thread2Thread1of1ForFork1_plus_#res#1_143|, |v_thread2Thread1of1ForFork1_plus_#in~a#1_133|, |v_thread2Thread1of1ForFork1_plus_#in~a#1_134|, |v_thread1Thread1of1ForFork0_minus_#res#1_153|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_213|, |v_thread1Thread1of1ForFork0_plus_~b#1_159|, |v_thread2Thread1of1ForFork1_minus_#in~a#1_146|, |v_thread2Thread1of1ForFork1_minus_#in~a#1_145|, |v_thread1Thread1of1ForFork0_minus_#in~b#1_139|, |v_thread1Thread1of1ForFork0_plus_#in~a#1_141|, |v_thread2Thread1of1ForFork1_minus_~a#1_167|, |v_thread2Thread1of1ForFork1_minus_~a#1_168|] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [849] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_~b#1_193| |v_thread2Thread1of1ForFork1_plus_#in~b#1_167|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_173| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_163| v_~f1_6~0_319) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_175| v_~f2_7~0_310) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_163| |v_thread2Thread1of1ForFork1_plus_~a#1_191|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_197| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_197| |v_thread2Thread1of1ForFork1_minus_#res#1_181|)) (= v_~f2_7~0_309 |v_thread2Thread1of1ForFork1_minus_#res#1_181|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_173| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_41| 0) (< |v_thread2Thread1of1ForFork1_~i~1#1_246| v_~n_0~0_195) (<= v_~f2_7~0_309 2147483647) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_246| 1) |v_thread2Thread1of1ForFork1_~i~1#1_245|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_41| 0) (= (ite (< 0 v_~f1_2~0_314) 1 0) v_~l_4~0_88) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_193| |v_thread2Thread1of1ForFork1_plus_~a#1_191|) |v_thread2Thread1of1ForFork1_plus_#res#1_173|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_228| v_~n_0~0_195)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_167| v_~f2_7~0_310) (= |v_thread2Thread1of1ForFork1_plus_#res#1_173| v_~f1_6~0_318) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_197| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_197|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_197|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_197| |v_thread2Thread1of1ForFork1_minus_#in~b#1_175|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_197| |v_thread2Thread1of1ForFork1_minus_#in~a#1_175|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_175| v_~f1_6~0_318) (<= 0 (+ v_~f2_7~0_309 2147483648))) InVars {~f1_2~0=v_~f1_2~0_314, ~n_0~0=v_~n_0~0_195, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_228|, ~f2_7~0=v_~f2_7~0_310, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_246|, ~f1_6~0=v_~f1_6~0_319} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_163|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_143|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_41|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_197|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_191|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_181|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_245|, ~f1_6~0=v_~f1_6~0_318, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_151|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_167|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_197|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|, ~f1_2~0=v_~f1_2~0_314, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_175|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_173|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_193|, ~n_0~0=v_~n_0~0_195, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_228|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_175|, ~f2_7~0=v_~f2_7~0_309, ~l_4~0=v_~l_4~0_88, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_151|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:22:32,029 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:22:32,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7773 [2022-12-13 10:22:32,030 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 491 flow [2022-12-13 10:22:32,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:32,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:32,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:32,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 10:22:32,030 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-13 10:22:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1918529968, now seen corresponding path program 1 times [2022-12-13 10:22:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:32,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710424586] [2022-12-13 10:22:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:32,864 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-13 10:22:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:32,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710424586] [2022-12-13 10:22:32,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710424586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:32,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:32,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:22:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862808248] [2022-12-13 10:22:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:32,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:22:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:32,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:22:32,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:22:32,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 10:22:32,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 491 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:32,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:32,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 10:22:32,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:33,036 INFO L130 PetriNetUnfolder]: 123/239 cut-off events. [2022-12-13 10:22:33,036 INFO L131 PetriNetUnfolder]: For 1161/1161 co-relation queries the response was YES. [2022-12-13 10:22:33,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 239 events. 123/239 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 883 event pairs, 9 based on Foata normal form. 3/240 useless extension candidates. Maximal degree in co-relation 1277. Up to 219 conditions per place. [2022-12-13 10:22:33,039 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 35 selfloop transitions, 12 changer transitions 7/54 dead transitions. [2022-12-13 10:22:33,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 606 flow [2022-12-13 10:22:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:22:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:22:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 10:22:33,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2022-12-13 10:22:33,040 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 491 flow. Second operand 5 states and 38 transitions. [2022-12-13 10:22:33,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 606 flow [2022-12-13 10:22:33,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 547 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-13 10:22:33,045 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 407 flow [2022-12-13 10:22:33,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 10:22:33,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 10:22:33,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:33,046 INFO L89 Accepts]: Start accepts. Operand has 56 places, 44 transitions, 407 flow [2022-12-13 10:22:33,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:33,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:33,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 407 flow [2022-12-13 10:22:33,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 407 flow [2022-12-13 10:22:33,064 INFO L130 PetriNetUnfolder]: 29/94 cut-off events. [2022-12-13 10:22:33,065 INFO L131 PetriNetUnfolder]: For 362/378 co-relation queries the response was YES. [2022-12-13 10:22:33,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 94 events. 29/94 cut-off events. For 362/378 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 406. Up to 32 conditions per place. [2022-12-13 10:22:33,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 407 flow [2022-12-13 10:22:33,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 10:22:35,194 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:22:35,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2148 [2022-12-13 10:22:35,195 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 401 flow [2022-12-13 10:22:35,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:35,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:35,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:35,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 10:22:35,195 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-13 10:22:35,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:35,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1242911069, now seen corresponding path program 1 times [2022-12-13 10:22:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:35,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911405678] [2022-12-13 10:22:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:35,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:35,959 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-13 10:22:35,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:35,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911405678] [2022-12-13 10:22:35,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911405678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:35,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:35,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:35,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403718270] [2022-12-13 10:22:35,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:35,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:22:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:35,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:22:35,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:22:35,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 10:22:35,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 401 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:35,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:35,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 10:22:35,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:36,212 INFO L130 PetriNetUnfolder]: 176/320 cut-off events. [2022-12-13 10:22:36,212 INFO L131 PetriNetUnfolder]: For 1355/1355 co-relation queries the response was YES. [2022-12-13 10:22:36,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 320 events. 176/320 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1199 event pairs, 9 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 1728. Up to 211 conditions per place. [2022-12-13 10:22:36,215 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 46 selfloop transitions, 35 changer transitions 1/82 dead transitions. [2022-12-13 10:22:36,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 866 flow [2022-12-13 10:22:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:22:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:22:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-12-13 10:22:36,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2606837606837607 [2022-12-13 10:22:36,216 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 401 flow. Second operand 9 states and 61 transitions. [2022-12-13 10:22:36,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 866 flow [2022-12-13 10:22:36,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 775 flow, removed 29 selfloop flow, removed 6 redundant places. [2022-12-13 10:22:36,222 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 650 flow [2022-12-13 10:22:36,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=650, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2022-12-13 10:22:36,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 37 predicate places. [2022-12-13 10:22:36,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:36,223 INFO L89 Accepts]: Start accepts. Operand has 57 places, 60 transitions, 650 flow [2022-12-13 10:22:36,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:36,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:36,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 60 transitions, 650 flow [2022-12-13 10:22:36,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 650 flow [2022-12-13 10:22:36,241 INFO L130 PetriNetUnfolder]: 43/133 cut-off events. [2022-12-13 10:22:36,242 INFO L131 PetriNetUnfolder]: For 579/595 co-relation queries the response was YES. [2022-12-13 10:22:36,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 133 events. 43/133 cut-off events. For 579/595 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 578 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 597. Up to 47 conditions per place. [2022-12-13 10:22:36,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 60 transitions, 650 flow [2022-12-13 10:22:36,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-13 10:22:36,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:22:36,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] [2022-12-13 10:22:36,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [813] $Ultimate##0-->L44-5: Formula: (and (= v_~f2_7~0_225 |v_thread2Thread1of1ForFork1_minus_#res#1_109|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_107| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_111| |v_thread1Thread1of1ForFork0_plus_~b#1_111|)) (not (= (ite (or (<= v_~f2_3~0_199 0) (<= 0 (+ v_~f1_2~0_214 2147483648))) 1 0) 0)) (<= v_~f1_2~0_214 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_101| 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_103| v_~f1_6~0_220) (= v_~f1_2~0_212 |v_thread1Thread1of1ForFork0_plus_#res#1_107|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_103| v_~f2_7~0_226) (= |v_thread2Thread1of1ForFork1_plus_~a#1_119| |v_thread2Thread1of1ForFork1_plus_#in~a#1_91|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_121| |v_thread2Thread1of1ForFork1_plus_~a#1_119|) |v_thread2Thread1of1ForFork1_plus_#res#1_101|) (= v_~f1_6~0_221 |v_thread2Thread1of1ForFork1_plus_#in~a#1_91|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_197|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_101| v_~f1_6~0_220) (<= v_~f1_2~0_212 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_125| |v_thread2Thread1of1ForFork1_minus_#in~a#1_103|) (= v_~f1_2~0_212 |v_thread1Thread1of1ForFork0_minus_#in~a#1_89|) (= v_~f2_7~0_226 |v_thread2Thread1of1ForFork1_plus_#in~b#1_95|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_93| |v_thread1Thread1of1ForFork0_plus_~b#1_111|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_125| |v_thread2Thread1of1ForFork1_minus_#in~b#1_103|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_123| |v_thread1Thread1of1ForFork0_minus_#res#1_105|) |v_thread1Thread1of1ForFork0_minus_~a#1_123|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_101| 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_123| |v_thread1Thread1of1ForFork0_minus_#in~b#1_91|) (= |v_thread1Thread1of1ForFork0_~i~0#1_151| 3) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_93| (+ (* v_~f1_2~0_214 2) v_~f2_3~0_199)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_89| |v_thread1Thread1of1ForFork0_minus_~a#1_123|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_125| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_125|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_125|)) 1 0)) (< 2 v_~n_0~0_143) (= |v_thread1Thread1of1ForFork0_plus_~a#1_111| |v_thread1Thread1of1ForFork0_plus_#in~a#1_93|) (<= 0 (+ v_~f1_2~0_212 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_125| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_125| |v_thread2Thread1of1ForFork1_minus_#res#1_109|)) (= |v_thread2Thread1of1ForFork1_~i~1#1_177| 1) (<= v_~f2_7~0_225 2147483647) (= (+ v_~f1_2~0_214 |v_thread1Thread1of1ForFork0_plus_#in~b#1_93|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_93|) (<= 0 (+ v_~f2_7~0_225 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_121| |v_thread2Thread1of1ForFork1_plus_#in~b#1_95|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_105| v_~f2_3~0_197) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_123| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_123|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_123|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_93| |v_thread1Thread1of1ForFork0_minus_#in~b#1_91|)) InVars {~f1_2~0=v_~f1_2~0_214, ~f2_3~0=v_~f2_3~0_199, ~n_0~0=v_~n_0~0_143, ~f2_7~0=v_~f2_7~0_226, ~f1_6~0=v_~f1_6~0_221} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_89|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_107|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_119|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_93|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_109|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_169|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_177|, ~f1_6~0=v_~f1_6~0_220, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_103|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_125|, ~f1_2~0=v_~f1_2~0_212, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_89|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_103|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_101|, ~n_0~0=v_~n_0~0_143, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_121|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_103|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_91|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_105|, ~f2_3~0=v_~f2_3~0_197, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_111|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_125|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_111|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_95|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_91|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_151|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_123|, ~f2_7~0=v_~f2_7~0_225, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_107|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_93|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_103|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:22:38,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [829] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_~b#1_149| |v_thread2Thread1of1ForFork1_plus_#in~b#1_123|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_119| (+ v_~f2_7~0_275 (* 2 v_~f1_6~0_272))) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_119| |v_thread2Thread1of1ForFork1_plus_~a#1_147|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_153| |v_thread2Thread1of1ForFork1_minus_#in~b#1_131|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_153|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_153| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_153|))) 1 0)) (<= v_~f1_6~0_272 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_153| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_153| |v_thread2Thread1of1ForFork1_minus_#res#1_137|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_123| |v_thread2Thread1of1ForFork1_minus_#in~b#1_131|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_129| 2147483647) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_213|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_129| v_~f1_6~0_270) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_149| |v_thread2Thread1of1ForFork1_plus_~a#1_147|) |v_thread2Thread1of1ForFork1_plus_#res#1_129|) (< 2 v_~n_0~0_165) (= |v_thread1Thread1of1ForFork0_~i~0#1_182| 0) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_129| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_153| |v_thread2Thread1of1ForFork1_minus_#in~a#1_131|) (<= 0 (+ v_~f1_6~0_272 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_131| v_~f1_6~0_270) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_119| (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_123| v_~f1_6~0_272)) (= v_~f2_7~0_273 |v_thread2Thread1of1ForFork1_minus_#res#1_137|)) InVars {~n_0~0=v_~n_0~0_165, ~f2_7~0=v_~f2_7~0_275, ~f1_6~0=v_~f1_6~0_272} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_119|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_153|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_147|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_137|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_197|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_213|, ~f1_6~0=v_~f1_6~0_270, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_131|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_123|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_153|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_131|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_129|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_149|, ~n_0~0=v_~n_0~0_165, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_182|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_131|, ~f2_7~0=v_~f2_7~0_273, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_131|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:39,243 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:22:39,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3020 [2022-12-13 10:22:39,243 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 689 flow [2022-12-13 10:22:39,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:39,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:39,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:39,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 10:22:39,244 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-13 10:22:39,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1593158818, now seen corresponding path program 1 times [2022-12-13 10:22:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:39,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477675964] [2022-12-13 10:22:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:22:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:39,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477675964] [2022-12-13 10:22:39,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477675964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:39,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:39,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:22:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604034610] [2022-12-13 10:22:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:39,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:22:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:39,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:22:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:22:39,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 10:22:39,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 689 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-13 10:22:39,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:39,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 10:22:39,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:39,409 INFO L130 PetriNetUnfolder]: 165/302 cut-off events. [2022-12-13 10:22:39,409 INFO L131 PetriNetUnfolder]: For 2123/2123 co-relation queries the response was YES. [2022-12-13 10:22:39,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 302 events. 165/302 cut-off events. For 2123/2123 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1117 event pairs, 33 based on Foata normal form. 2/298 useless extension candidates. Maximal degree in co-relation 1618. Up to 167 conditions per place. [2022-12-13 10:22:39,412 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 58 selfloop transitions, 6 changer transitions 1/65 dead transitions. [2022-12-13 10:22:39,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 871 flow [2022-12-13 10:22:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:22:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:22:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 10:22:39,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-13 10:22:39,413 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 689 flow. Second operand 3 states and 34 transitions. [2022-12-13 10:22:39,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 871 flow [2022-12-13 10:22:39,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 776 flow, removed 40 selfloop flow, removed 3 redundant places. [2022-12-13 10:22:39,420 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 605 flow [2022-12-13 10:22:39,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2022-12-13 10:22:39,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 10:22:39,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:39,421 INFO L89 Accepts]: Start accepts. Operand has 56 places, 58 transitions, 605 flow [2022-12-13 10:22:39,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:39,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:39,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 58 transitions, 605 flow [2022-12-13 10:22:39,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 58 transitions, 605 flow [2022-12-13 10:22:39,442 INFO L130 PetriNetUnfolder]: 42/129 cut-off events. [2022-12-13 10:22:39,442 INFO L131 PetriNetUnfolder]: For 608/627 co-relation queries the response was YES. [2022-12-13 10:22:39,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 129 events. 42/129 cut-off events. For 608/627 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 552 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 556. Up to 47 conditions per place. [2022-12-13 10:22:39,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 58 transitions, 605 flow [2022-12-13 10:22:39,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 10:22:39,444 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:39,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 10:22:39,445 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 605 flow [2022-12-13 10:22:39,445 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-13 10:22:39,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:39,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:39,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 10:22:39,445 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-13 10:22:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2146284070, now seen corresponding path program 1 times [2022-12-13 10:22:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:39,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153769128] [2022-12-13 10:22:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:39,590 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-13 10:22:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:39,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153769128] [2022-12-13 10:22:39,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153769128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:39,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:39,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:22:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250848878] [2022-12-13 10:22:39,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:39,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:22:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:22:39,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:22:39,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 10:22:39,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:39,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:39,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 10:22:39,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:39,703 INFO L130 PetriNetUnfolder]: 153/288 cut-off events. [2022-12-13 10:22:39,703 INFO L131 PetriNetUnfolder]: For 1681/1681 co-relation queries the response was YES. [2022-12-13 10:22:39,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 288 events. 153/288 cut-off events. For 1681/1681 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1094 event pairs, 49 based on Foata normal form. 8/296 useless extension candidates. Maximal degree in co-relation 1419. Up to 275 conditions per place. [2022-12-13 10:22:39,706 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 56 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2022-12-13 10:22:39,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 719 flow [2022-12-13 10:22:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:22:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:22:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 10:22:39,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-13 10:22:39,707 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 605 flow. Second operand 3 states and 34 transitions. [2022-12-13 10:22:39,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 719 flow [2022-12-13 10:22:39,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 705 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:22:39,713 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 565 flow [2022-12-13 10:22:39,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2022-12-13 10:22:39,713 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 10:22:39,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:39,713 INFO L89 Accepts]: Start accepts. Operand has 56 places, 56 transitions, 565 flow [2022-12-13 10:22:39,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:39,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:39,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 565 flow [2022-12-13 10:22:39,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 565 flow [2022-12-13 10:22:39,731 INFO L130 PetriNetUnfolder]: 38/120 cut-off events. [2022-12-13 10:22:39,732 INFO L131 PetriNetUnfolder]: For 500/519 co-relation queries the response was YES. [2022-12-13 10:22:39,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 120 events. 38/120 cut-off events. For 500/519 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 498 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 540. Up to 46 conditions per place. [2022-12-13 10:22:39,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 565 flow [2022-12-13 10:22:39,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-13 10:22:39,734 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:39,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 10:22:39,734 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 565 flow [2022-12-13 10:22:39,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:39,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:39,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:39,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 10:22:39,735 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-13 10:22:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1122214641, now seen corresponding path program 1 times [2022-12-13 10:22:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:39,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785938511] [2022-12-13 10:22:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:39,767 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-13 10:22:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785938511] [2022-12-13 10:22:39,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785938511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:39,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:39,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:22:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846523391] [2022-12-13 10:22:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:39,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:22:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:22:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:22:39,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 10:22:39,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:39,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:39,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 10:22:39,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:39,873 INFO L130 PetriNetUnfolder]: 156/294 cut-off events. [2022-12-13 10:22:39,873 INFO L131 PetriNetUnfolder]: For 1516/1554 co-relation queries the response was YES. [2022-12-13 10:22:39,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 294 events. 156/294 cut-off events. For 1516/1554 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1149 event pairs, 47 based on Foata normal form. 6/300 useless extension candidates. Maximal degree in co-relation 1524. Up to 269 conditions per place. [2022-12-13 10:22:39,876 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 56 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2022-12-13 10:22:39,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 740 flow [2022-12-13 10:22:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:22:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:22:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-13 10:22:39,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 10:22:39,877 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 565 flow. Second operand 3 states and 36 transitions. [2022-12-13 10:22:39,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 740 flow [2022-12-13 10:22:39,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 718 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 10:22:39,882 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 576 flow [2022-12-13 10:22:39,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2022-12-13 10:22:39,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 38 predicate places. [2022-12-13 10:22:39,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:39,883 INFO L89 Accepts]: Start accepts. Operand has 58 places, 57 transitions, 576 flow [2022-12-13 10:22:39,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:39,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:39,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 57 transitions, 576 flow [2022-12-13 10:22:39,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 576 flow [2022-12-13 10:22:39,903 INFO L130 PetriNetUnfolder]: 40/126 cut-off events. [2022-12-13 10:22:39,904 INFO L131 PetriNetUnfolder]: For 584/603 co-relation queries the response was YES. [2022-12-13 10:22:39,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 126 events. 40/126 cut-off events. For 584/603 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 549 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 581. Up to 48 conditions per place. [2022-12-13 10:22:39,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 57 transitions, 576 flow [2022-12-13 10:22:39,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 10:22:39,906 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:39,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 10:22:39,909 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 576 flow [2022-12-13 10:22:39,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:39,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:39,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:39,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 10:22:39,909 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-13 10:22:39,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1885410459, now seen corresponding path program 2 times [2022-12-13 10:22:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:39,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032005506] [2022-12-13 10:22:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:40,761 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-13 10:22:40,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:40,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032005506] [2022-12-13 10:22:40,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032005506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:40,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:40,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999634231] [2022-12-13 10:22:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:40,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:22:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:22:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:22:40,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:22:40,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 576 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:40,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:40,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:22:40,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:41,014 INFO L130 PetriNetUnfolder]: 184/349 cut-off events. [2022-12-13 10:22:41,014 INFO L131 PetriNetUnfolder]: For 1872/1872 co-relation queries the response was YES. [2022-12-13 10:22:41,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2083 conditions, 349 events. 184/349 cut-off events. For 1872/1872 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1440 event pairs, 9 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 1867. Up to 236 conditions per place. [2022-12-13 10:22:41,017 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 44 selfloop transitions, 35 changer transitions 6/85 dead transitions. [2022-12-13 10:22:41,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 996 flow [2022-12-13 10:22:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:22:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:22:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-12-13 10:22:41,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24074074074074073 [2022-12-13 10:22:41,018 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 576 flow. Second operand 8 states and 52 transitions. [2022-12-13 10:22:41,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 996 flow [2022-12-13 10:22:41,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 971 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 10:22:41,027 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 812 flow [2022-12-13 10:22:41,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=812, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2022-12-13 10:22:41,027 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 48 predicate places. [2022-12-13 10:22:41,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:41,027 INFO L89 Accepts]: Start accepts. Operand has 68 places, 67 transitions, 812 flow [2022-12-13 10:22:41,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:41,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:41,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 812 flow [2022-12-13 10:22:41,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 67 transitions, 812 flow [2022-12-13 10:22:41,049 INFO L130 PetriNetUnfolder]: 46/143 cut-off events. [2022-12-13 10:22:41,049 INFO L131 PetriNetUnfolder]: For 972/991 co-relation queries the response was YES. [2022-12-13 10:22:41,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 143 events. 46/143 cut-off events. For 972/991 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 636 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 804. Up to 55 conditions per place. [2022-12-13 10:22:41,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 67 transitions, 812 flow [2022-12-13 10:22:41,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-13 10:22:41,051 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:41,052 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 10:22:41,052 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 812 flow [2022-12-13 10:22:41,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-13 10:22:41,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:41,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:41,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 10:22:41,052 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-13 10:22:41,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1670564396, now seen corresponding path program 1 times [2022-12-13 10:22:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:41,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124089929] [2022-12-13 10:22:41,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:41,081 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-13 10:22:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:41,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124089929] [2022-12-13 10:22:41,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124089929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:41,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:41,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:22:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65885879] [2022-12-13 10:22:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:41,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:22:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:22:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:22:41,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:22:41,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 812 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-13 10:22:41,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:41,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:22:41,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:41,195 INFO L130 PetriNetUnfolder]: 178/327 cut-off events. [2022-12-13 10:22:41,195 INFO L131 PetriNetUnfolder]: For 2755/2755 co-relation queries the response was YES. [2022-12-13 10:22:41,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 327 events. 178/327 cut-off events. For 2755/2755 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1264 event pairs, 54 based on Foata normal form. 8/335 useless extension candidates. Maximal degree in co-relation 2141. Up to 314 conditions per place. [2022-12-13 10:22:41,199 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 67 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2022-12-13 10:22:41,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 987 flow [2022-12-13 10:22:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:22:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:22:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 10:22:41,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2022-12-13 10:22:41,200 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 812 flow. Second operand 3 states and 32 transitions. [2022-12-13 10:22:41,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 987 flow [2022-12-13 10:22:41,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 939 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-13 10:22:41,211 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 780 flow [2022-12-13 10:22:41,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2022-12-13 10:22:41,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 47 predicate places. [2022-12-13 10:22:41,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:41,211 INFO L89 Accepts]: Start accepts. Operand has 67 places, 67 transitions, 780 flow [2022-12-13 10:22:41,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:41,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:41,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 67 transitions, 780 flow [2022-12-13 10:22:41,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 67 transitions, 780 flow [2022-12-13 10:22:41,232 INFO L130 PetriNetUnfolder]: 47/138 cut-off events. [2022-12-13 10:22:41,233 INFO L131 PetriNetUnfolder]: For 987/1006 co-relation queries the response was YES. [2022-12-13 10:22:41,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 138 events. 47/138 cut-off events. For 987/1006 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 598 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 763. Up to 56 conditions per place. [2022-12-13 10:22:41,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 67 transitions, 780 flow [2022-12-13 10:22:41,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-13 10:22:41,235 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:41,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 10:22:41,237 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 780 flow [2022-12-13 10:22:41,237 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-13 10:22:41,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:41,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:41,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 10:22:41,237 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-13 10:22:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1504131379, now seen corresponding path program 1 times [2022-12-13 10:22:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:41,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228963105] [2022-12-13 10:22:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:41,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:41,270 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-13 10:22:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:41,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228963105] [2022-12-13 10:22:41,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228963105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:41,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:41,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718097358] [2022-12-13 10:22:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:41,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:22:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:22:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:22:41,272 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:22:41,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 780 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-13 10:22:41,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:41,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:22:41,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:41,413 INFO L130 PetriNetUnfolder]: 184/337 cut-off events. [2022-12-13 10:22:41,413 INFO L131 PetriNetUnfolder]: For 2965/2965 co-relation queries the response was YES. [2022-12-13 10:22:41,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 337 events. 184/337 cut-off events. For 2965/2965 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1315 event pairs, 38 based on Foata normal form. 4/341 useless extension candidates. Maximal degree in co-relation 2047. Up to 230 conditions per place. [2022-12-13 10:22:41,416 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 64 selfloop transitions, 21 changer transitions 0/85 dead transitions. [2022-12-13 10:22:41,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 1105 flow [2022-12-13 10:22:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:22:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:22:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-13 10:22:41,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2022-12-13 10:22:41,417 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 780 flow. Second operand 5 states and 47 transitions. [2022-12-13 10:22:41,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 1105 flow [2022-12-13 10:22:41,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 1080 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 10:22:41,429 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 834 flow [2022-12-13 10:22:41,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=834, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2022-12-13 10:22:41,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 51 predicate places. [2022-12-13 10:22:41,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:41,430 INFO L89 Accepts]: Start accepts. Operand has 71 places, 68 transitions, 834 flow [2022-12-13 10:22:41,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:41,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:41,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 68 transitions, 834 flow [2022-12-13 10:22:41,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 68 transitions, 834 flow [2022-12-13 10:22:41,452 INFO L130 PetriNetUnfolder]: 49/140 cut-off events. [2022-12-13 10:22:41,453 INFO L131 PetriNetUnfolder]: For 1181/1200 co-relation queries the response was YES. [2022-12-13 10:22:41,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 140 events. 49/140 cut-off events. For 1181/1200 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 583 event pairs, 1 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 827. Up to 59 conditions per place. [2022-12-13 10:22:41,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 68 transitions, 834 flow [2022-12-13 10:22:41,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-13 10:22:41,455 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:41,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 10:22:41,456 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 834 flow [2022-12-13 10:22:41,456 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-13 10:22:41,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:41,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:41,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 10:22:41,456 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-13 10:22:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash -871729981, now seen corresponding path program 1 times [2022-12-13 10:22:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:41,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016442907] [2022-12-13 10:22:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:41,491 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-13 10:22:41,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:41,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016442907] [2022-12-13 10:22:41,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016442907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:41,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:41,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598375017] [2022-12-13 10:22:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:41,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:22:41,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:41,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:22:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:22:41,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:22:41,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 834 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-13 10:22:41,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:41,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:22:41,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:41,643 INFO L130 PetriNetUnfolder]: 192/351 cut-off events. [2022-12-13 10:22:41,644 INFO L131 PetriNetUnfolder]: For 3418/3418 co-relation queries the response was YES. [2022-12-13 10:22:41,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 351 events. 192/351 cut-off events. For 3418/3418 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1394 event pairs, 50 based on Foata normal form. 6/357 useless extension candidates. Maximal degree in co-relation 2169. Up to 266 conditions per place. [2022-12-13 10:22:41,647 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 74 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2022-12-13 10:22:41,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 1172 flow [2022-12-13 10:22:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:22:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:22:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 10:22:41,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 10:22:41,648 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 834 flow. Second operand 4 states and 45 transitions. [2022-12-13 10:22:41,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 1172 flow [2022-12-13 10:22:41,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 1140 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 10:22:41,660 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 846 flow [2022-12-13 10:22:41,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=846, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2022-12-13 10:22:41,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 53 predicate places. [2022-12-13 10:22:41,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:41,661 INFO L89 Accepts]: Start accepts. Operand has 73 places, 69 transitions, 846 flow [2022-12-13 10:22:41,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:41,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:41,662 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 69 transitions, 846 flow [2022-12-13 10:22:41,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 69 transitions, 846 flow [2022-12-13 10:22:41,684 INFO L130 PetriNetUnfolder]: 51/146 cut-off events. [2022-12-13 10:22:41,684 INFO L131 PetriNetUnfolder]: For 1386/1412 co-relation queries the response was YES. [2022-12-13 10:22:41,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 146 events. 51/146 cut-off events. For 1386/1412 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 633 event pairs, 1 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 875. Up to 62 conditions per place. [2022-12-13 10:22:41,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 69 transitions, 846 flow [2022-12-13 10:22:41,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-13 10:22:41,688 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:41,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 10:22:41,688 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 846 flow [2022-12-13 10:22:41,688 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-13 10:22:41,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:41,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:41,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 10:22:41,689 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-13 10:22:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1867089354, now seen corresponding path program 1 times [2022-12-13 10:22:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:41,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998336862] [2022-12-13 10:22:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:41,950 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-13 10:22:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:41,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998336862] [2022-12-13 10:22:41,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998336862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:22:41,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821913143] [2022-12-13 10:22:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:22:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:22:41,956 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-13 10:22:41,959 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-13 10:22:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:42,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 10:22:42,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:22:42,200 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-13 10:22:42,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:22:42,313 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-13 10:22:42,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821913143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:22:42,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:22:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:22:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820030740] [2022-12-13 10:22:42,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:22:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:22:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:22:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:22:42,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-13 10:22:42,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 846 flow. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:42,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:42,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-13 10:22:42,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:42,675 INFO L130 PetriNetUnfolder]: 210/391 cut-off events. [2022-12-13 10:22:42,675 INFO L131 PetriNetUnfolder]: For 3905/3943 co-relation queries the response was YES. [2022-12-13 10:22:42,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 391 events. 210/391 cut-off events. For 3905/3943 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1661 event pairs, 10 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 2510. Up to 332 conditions per place. [2022-12-13 10:22:42,680 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 68 selfloop transitions, 21 changer transitions 5/95 dead transitions. [2022-12-13 10:22:42,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 95 transitions, 1281 flow [2022-12-13 10:22:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:22:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:22:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-13 10:22:42,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31216931216931215 [2022-12-13 10:22:42,681 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 846 flow. Second operand 7 states and 59 transitions. [2022-12-13 10:22:42,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 95 transitions, 1281 flow [2022-12-13 10:22:42,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 1253 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 10:22:42,695 INFO L231 Difference]: Finished difference. Result has 81 places, 76 transitions, 1014 flow [2022-12-13 10:22:42,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1014, PETRI_PLACES=81, PETRI_TRANSITIONS=76} [2022-12-13 10:22:42,696 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 61 predicate places. [2022-12-13 10:22:42,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:42,696 INFO L89 Accepts]: Start accepts. Operand has 81 places, 76 transitions, 1014 flow [2022-12-13 10:22:42,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:42,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:42,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 76 transitions, 1014 flow [2022-12-13 10:22:42,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 76 transitions, 1014 flow [2022-12-13 10:22:42,722 INFO L130 PetriNetUnfolder]: 55/162 cut-off events. [2022-12-13 10:22:42,722 INFO L131 PetriNetUnfolder]: For 1946/1972 co-relation queries the response was YES. [2022-12-13 10:22:42,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 162 events. 55/162 cut-off events. For 1946/1972 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 759 event pairs, 2 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 1074. Up to 68 conditions per place. [2022-12-13 10:22:42,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 76 transitions, 1014 flow [2022-12-13 10:22:42,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-13 10:22:42,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:43,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:43,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:22:43,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 567 [2022-12-13 10:22:43,263 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 1048 flow [2022-12-13 10:22:43,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:43,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:43,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:43,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 10:22:43,468 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,SelfDestructingSolverStorable40 [2022-12-13 10:22:43,469 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-13 10:22:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash 798558894, now seen corresponding path program 1 times [2022-12-13 10:22:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:43,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910104565] [2022-12-13 10:22:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:43,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:43,508 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-13 10:22:43,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:43,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910104565] [2022-12-13 10:22:43,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910104565] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:22:43,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015076444] [2022-12-13 10:22:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:22:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:22:43,512 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-13 10:22:43,538 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-13 10:22:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:43,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 10:22:43,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:22:43,682 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-13 10:22:43,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:22:43,695 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-13 10:22:43,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015076444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:22:43,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:22:43,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:22:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085032634] [2022-12-13 10:22:43,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:22:43,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:22:43,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:22:43,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:22:43,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 10:22:43,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 1048 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:43,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:43,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 10:22:43,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:43,867 INFO L130 PetriNetUnfolder]: 219/400 cut-off events. [2022-12-13 10:22:43,868 INFO L131 PetriNetUnfolder]: For 5560/5560 co-relation queries the response was YES. [2022-12-13 10:22:43,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 400 events. 219/400 cut-off events. For 5560/5560 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1633 event pairs, 59 based on Foata normal form. 4/404 useless extension candidates. Maximal degree in co-relation 2932. Up to 325 conditions per place. [2022-12-13 10:22:43,879 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 73 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2022-12-13 10:22:43,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 1373 flow [2022-12-13 10:22:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:22:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:22:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-13 10:22:43,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25862068965517243 [2022-12-13 10:22:43,880 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 1048 flow. Second operand 6 states and 45 transitions. [2022-12-13 10:22:43,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 1373 flow [2022-12-13 10:22:43,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 89 transitions, 1296 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-12-13 10:22:43,899 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 999 flow [2022-12-13 10:22:43,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=999, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2022-12-13 10:22:43,899 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 63 predicate places. [2022-12-13 10:22:43,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:43,899 INFO L89 Accepts]: Start accepts. Operand has 83 places, 76 transitions, 999 flow [2022-12-13 10:22:43,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:43,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:43,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 76 transitions, 999 flow [2022-12-13 10:22:43,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 76 transitions, 999 flow [2022-12-13 10:22:43,927 INFO L130 PetriNetUnfolder]: 57/165 cut-off events. [2022-12-13 10:22:43,928 INFO L131 PetriNetUnfolder]: For 2088/2114 co-relation queries the response was YES. [2022-12-13 10:22:43,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 165 events. 57/165 cut-off events. For 2088/2114 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 755 event pairs, 1 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 1067. Up to 70 conditions per place. [2022-12-13 10:22:43,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 76 transitions, 999 flow [2022-12-13 10:22:43,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 10:22:46,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:22:46,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2201 [2022-12-13 10:22:46,100 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 1077 flow [2022-12-13 10:22:46,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:46,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:46,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:46,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 10:22:46,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:22:46,306 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:22:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash 936206766, now seen corresponding path program 1 times [2022-12-13 10:22:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:46,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590992933] [2022-12-13 10:22:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:46,787 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-13 10:22:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590992933] [2022-12-13 10:22:46,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590992933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:22:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594723992] [2022-12-13 10:22:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:46,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:22:46,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:22:46,790 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-13 10:22:46,817 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-13 10:22:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:46,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 10:22:46,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:22:47,584 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-13 10:22:47,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:22:48,363 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-13 10:22:48,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594723992] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:22:48,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:22:48,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-13 10:22:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169351767] [2022-12-13 10:22:48,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:22:48,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 10:22:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 10:22:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:22:48,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 10:22:48,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 1077 flow. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:48,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:48,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 10:22:48,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:49,093 INFO L130 PetriNetUnfolder]: 253/470 cut-off events. [2022-12-13 10:22:49,093 INFO L131 PetriNetUnfolder]: For 6355/6393 co-relation queries the response was YES. [2022-12-13 10:22:49,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 470 events. 253/470 cut-off events. For 6355/6393 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2109 event pairs, 10 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 3287. Up to 348 conditions per place. [2022-12-13 10:22:49,098 INFO L137 encePairwiseOnDemand]: 14/32 looper letters, 81 selfloop transitions, 36 changer transitions 8/126 dead transitions. [2022-12-13 10:22:49,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 126 transitions, 1809 flow [2022-12-13 10:22:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:22:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:22:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-12-13 10:22:49,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26136363636363635 [2022-12-13 10:22:49,101 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 1077 flow. Second operand 11 states and 92 transitions. [2022-12-13 10:22:49,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 126 transitions, 1809 flow [2022-12-13 10:22:49,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 126 transitions, 1676 flow, removed 50 selfloop flow, removed 4 redundant places. [2022-12-13 10:22:49,123 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 1273 flow [2022-12-13 10:22:49,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1273, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2022-12-13 10:22:49,125 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 73 predicate places. [2022-12-13 10:22:49,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:49,125 INFO L89 Accepts]: Start accepts. Operand has 93 places, 89 transitions, 1273 flow [2022-12-13 10:22:49,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:49,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:49,126 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 89 transitions, 1273 flow [2022-12-13 10:22:49,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 89 transitions, 1273 flow [2022-12-13 10:22:49,155 INFO L130 PetriNetUnfolder]: 66/191 cut-off events. [2022-12-13 10:22:49,156 INFO L131 PetriNetUnfolder]: For 2711/2757 co-relation queries the response was YES. [2022-12-13 10:22:49,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 191 events. 66/191 cut-off events. For 2711/2757 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 949 event pairs, 2 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 1341. Up to 81 conditions per place. [2022-12-13 10:22:49,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 89 transitions, 1273 flow [2022-12-13 10:22:49,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 10:22:49,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [803] $Ultimate##0-->L44-5: Formula: (and (<= v_~f2_7~0_203 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_77| |v_thread1Thread1of1ForFork0_plus_~a#1_95|) (= v_~f1_2~0_186 |v_thread1Thread1of1ForFork0_plus_#res#1_91|) (= v_~f1_2~0_186 |v_thread1Thread1of1ForFork0_minus_#in~a#1_73|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_91| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_95| |v_thread1Thread1of1ForFork0_plus_~b#1_95|)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_77| (+ v_~f1_2~0_188 v_~f2_3~0_173)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_77| |v_thread1Thread1of1ForFork0_plus_~b#1_95|) (= v_~f1_6~0_198 |v_thread2Thread1of1ForFork1_minus_#in~a#1_91|) (= v_~f2_7~0_204 |v_thread2Thread1of1ForFork1_plus_#in~b#1_83|) (<= |v_thread1Thread1of1ForFork0_plus_#in~a#1_77| 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_113| |v_thread2Thread1of1ForFork1_minus_#in~a#1_91|) (= |v_thread2Thread1of1ForFork1_~i~1#1_163| 1) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_89| 2147483648)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_107|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_107| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_107|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_149|) (not (= (ite (or (<= v_~f2_3~0_173 0) (<= 0 (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_75| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_77| (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_75| v_~f2_3~0_173)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_113| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_113| |v_thread2Thread1of1ForFork1_minus_#res#1_97|)) (= v_~f1_6~0_199 |v_thread2Thread1of1ForFork1_plus_#in~a#1_79|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_107| |v_thread1Thread1of1ForFork0_minus_#res#1_89|) |v_thread1Thread1of1ForFork0_minus_~a#1_107|) (<= |v_thread1Thread1of1ForFork0_minus_#in~b#1_75| 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_89| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_157| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_185|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_89| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_109| |v_thread2Thread1of1ForFork1_plus_~a#1_107|)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_107| |v_thread1Thread1of1ForFork0_minus_#in~b#1_75|) (<= v_~f1_2~0_186 2147483647) (< 0 v_~n_0~0_131) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#in~a#1_77| 2147483648)) (<= 0 (+ v_~f1_2~0_186 2147483648)) (= |v_thread1Thread1of1ForFork0_~i~0#1_123| (+ |v_thread1Thread1of1ForFork0_~i~0#1_125| 2)) (<= 0 (+ v_~f2_7~0_203 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_109| |v_thread2Thread1of1ForFork1_plus_#in~b#1_83|) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_125| 1) v_~n_0~0_131) (= |v_thread2Thread1of1ForFork1_plus_~a#1_107| |v_thread2Thread1of1ForFork1_plus_#in~a#1_79|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_77| |v_thread1Thread1of1ForFork0_minus_#in~b#1_75|) (= v_~f2_7~0_204 |v_thread2Thread1of1ForFork1_minus_#in~b#1_91|) (= v_~f2_7~0_203 |v_thread2Thread1of1ForFork1_minus_#res#1_97|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_89| v_~f1_6~0_198) (= |v_thread2Thread1of1ForFork1_minus_~b#1_113| |v_thread2Thread1of1ForFork1_minus_#in~b#1_91|) (= v_~f2_3~0_171 |v_thread1Thread1of1ForFork0_minus_#res#1_89|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_149| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_181|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_157| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_113|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_113| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_113|))) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_73| |v_thread1Thread1of1ForFork0_minus_~a#1_107|)) InVars {~f1_2~0=v_~f1_2~0_188, ~f2_3~0=v_~f2_3~0_173, ~n_0~0=v_~n_0~0_131, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_125|, ~f2_7~0=v_~f2_7~0_204, ~f1_6~0=v_~f1_6~0_199} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_83|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_73|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_91|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_107|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_77|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_97|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_157|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_163|, ~f1_6~0=v_~f1_6~0_198, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_91|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_113|, ~f1_2~0=v_~f1_2~0_186, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_73|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_91|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_89|, ~n_0~0=v_~n_0~0_131, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_109|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_83|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_181|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_91|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_79|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_89|, ~f2_3~0=v_~f2_3~0_171, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_95|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_113|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_95|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_83|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_75|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_185|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_149|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_107|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_123|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_107|, ~f2_7~0=v_~f2_7~0_203, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_91|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_77|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_91|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:22:51,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:52,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:52,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:52,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:22:54,265 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:22:54,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5141 [2022-12-13 10:22:54,266 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 1385 flow [2022-12-13 10:22:54,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:54,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:54,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:54,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 10:22:54,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:22:54,472 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:22:54,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:54,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1375554510, now seen corresponding path program 1 times [2022-12-13 10:22:54,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:54,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302939865] [2022-12-13 10:22:54,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:54,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:54,508 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-13 10:22:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:54,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302939865] [2022-12-13 10:22:54,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302939865] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:22:54,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312253486] [2022-12-13 10:22:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:54,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:22:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:22:54,510 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-13 10:22:54,513 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-13 10:22:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:54,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 10:22:54,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:22:54,654 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-13 10:22:54,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:22:54,664 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-13 10:22:54,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312253486] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:22:54,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:22:54,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:22:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946781028] [2022-12-13 10:22:54,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:22:54,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:22:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:22:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:22:54,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 10:22:54,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 1385 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:54,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:54,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 10:22:54,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:54,813 INFO L130 PetriNetUnfolder]: 256/467 cut-off events. [2022-12-13 10:22:54,813 INFO L131 PetriNetUnfolder]: For 7658/7658 co-relation queries the response was YES. [2022-12-13 10:22:54,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 467 events. 256/467 cut-off events. For 7658/7658 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2019 event pairs, 74 based on Foata normal form. 4/471 useless extension candidates. Maximal degree in co-relation 3654. Up to 400 conditions per place. [2022-12-13 10:22:54,818 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 81 selfloop transitions, 16 changer transitions 1/98 dead transitions. [2022-12-13 10:22:54,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 98 transitions, 1656 flow [2022-12-13 10:22:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:22:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:22:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 10:22:54,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25263157894736843 [2022-12-13 10:22:54,819 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 1385 flow. Second operand 5 states and 48 transitions. [2022-12-13 10:22:54,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 98 transitions, 1656 flow [2022-12-13 10:22:54,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 98 transitions, 1525 flow, removed 54 selfloop flow, removed 5 redundant places. [2022-12-13 10:22:54,842 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 1219 flow [2022-12-13 10:22:54,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1219, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2022-12-13 10:22:54,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 71 predicate places. [2022-12-13 10:22:54,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:54,843 INFO L89 Accepts]: Start accepts. Operand has 91 places, 87 transitions, 1219 flow [2022-12-13 10:22:54,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:54,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:54,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 87 transitions, 1219 flow [2022-12-13 10:22:54,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 87 transitions, 1219 flow [2022-12-13 10:22:54,874 INFO L130 PetriNetUnfolder]: 66/185 cut-off events. [2022-12-13 10:22:54,874 INFO L131 PetriNetUnfolder]: For 2506/2533 co-relation queries the response was YES. [2022-12-13 10:22:54,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 185 events. 66/185 cut-off events. For 2506/2533 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 890 event pairs, 2 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 1267. Up to 80 conditions per place. [2022-12-13 10:22:54,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 87 transitions, 1219 flow [2022-12-13 10:22:54,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-13 10:22:54,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (+ v_~f2_7~0_337 v_~f1_6~0_348))) (and (<= v_~f1_2~0_337 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| 2147483647) (= v_~f2_7~0_335 |v_thread2Thread1of1ForFork1_minus_#res#1_219|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_201| |v_thread2Thread1of1ForFork1_plus_~a#1_229|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_192| |v_thread1Thread1of1ForFork0_plus_~b#1_210|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_211| v_~f1_6~0_346) (<= 0 (+ v_~f1_2~0_336 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| v_~f1_6~0_348) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_235|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_235| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_235|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_210| |v_thread1Thread1of1ForFork0_plus_#in~a#1_192|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_206| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_210| |v_thread1Thread1of1ForFork0_plus_~b#1_210|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_192| |v_thread1Thread1of1ForFork0_minus_#in~b#1_190|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_201| .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_244| 3) (not (= (ite (or (<= 0 (+ v_~f1_2~0_337 2147483648)) (<= v_~f2_3~0_301 0)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_267|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_204| v_~f2_3~0_300) (= |v_thread2Thread1of1ForFork1_plus_#res#1_211| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_231| |v_thread2Thread1of1ForFork1_plus_~a#1_229|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_296|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_235| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_235| |v_thread2Thread1of1ForFork1_minus_#res#1_219|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_235| |v_thread2Thread1of1ForFork1_minus_#in~a#1_213|) (<= .cse0 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_231| |v_thread2Thread1of1ForFork1_plus_#in~b#1_205|) (= v_~f1_2~0_336 |v_thread1Thread1of1ForFork0_plus_#res#1_206|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_211| 2147483648)) (<= v_~f1_2~0_336 2147483647) (<= 0 (+ v_~f2_7~0_337 v_~f1_6~0_348 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_222|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_222| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_222|))) 1 0)) (= (+ v_~f1_2~0_337 |v_thread1Thread1of1ForFork0_plus_#in~b#1_192|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_192|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_222| |v_thread1Thread1of1ForFork0_minus_#res#1_204|) |v_thread1Thread1of1ForFork0_minus_~a#1_222|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_307|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_188| |v_thread1Thread1of1ForFork0_minus_~a#1_222|) (= v_~f1_2~0_336 |v_thread1Thread1of1ForFork0_minus_#in~a#1_188|) (< 2 v_~n_0~0_209) (= |v_thread2Thread1of1ForFork1_minus_~b#1_235| |v_thread2Thread1of1ForFork1_minus_#in~b#1_213|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| |v_thread2Thread1of1ForFork1_minus_#in~b#1_213|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_213| v_~f1_6~0_346) (= |v_thread1Thread1of1ForFork0_minus_~b#1_222| |v_thread1Thread1of1ForFork0_minus_#in~b#1_190|) (= (+ (* v_~f1_2~0_337 2) v_~f2_3~0_301) |v_thread1Thread1of1ForFork0_plus_#in~a#1_192|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_211| 2147483647))) InVars {~f1_2~0=v_~f1_2~0_337, ~f2_3~0=v_~f2_3~0_301, ~n_0~0=v_~n_0~0_209, ~f2_7~0=v_~f2_7~0_337, ~f1_6~0=v_~f1_6~0_348} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_159|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_188|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_229|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_168|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_219|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_192|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_267|, ~f1_6~0=v_~f1_6~0_346, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_167|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_235|, ~f1_2~0=v_~f1_2~0_336, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_213|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_211|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_150|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_231|, ~n_0~0=v_~n_0~0_209, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_296|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_213|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_201|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_204|, ~f2_3~0=v_~f2_3~0_300, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_210|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_235|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_210|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_205|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_307|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_190|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_222|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_244|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_222|, ~f2_7~0=v_~f2_7~0_335, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_206|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_192|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:22:56,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:22:56,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1533 [2022-12-13 10:22:56,376 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 1232 flow [2022-12-13 10:22:56,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:22:56,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:56,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:56,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 10:22:56,582 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,SelfDestructingSolverStorable43 [2022-12-13 10:22:56,583 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:22:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1006908865, now seen corresponding path program 1 times [2022-12-13 10:22:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:56,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164730278] [2022-12-13 10:22:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:56,641 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-13 10:22:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:56,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164730278] [2022-12-13 10:22:56,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164730278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:56,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:56,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419962837] [2022-12-13 10:22:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:56,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:22:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:22:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:22:56,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 10:22:56,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 1232 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-13 10:22:56,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:56,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 10:22:56,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:56,818 INFO L130 PetriNetUnfolder]: 267/492 cut-off events. [2022-12-13 10:22:56,818 INFO L131 PetriNetUnfolder]: For 7516/7516 co-relation queries the response was YES. [2022-12-13 10:22:56,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 492 events. 267/492 cut-off events. For 7516/7516 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2208 event pairs, 57 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 3595. Up to 345 conditions per place. [2022-12-13 10:22:56,823 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 86 selfloop transitions, 23 changer transitions 0/109 dead transitions. [2022-12-13 10:22:56,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 109 transitions, 1670 flow [2022-12-13 10:22:56,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:22:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:22:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 10:22:56,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-13 10:22:56,824 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 1232 flow. Second operand 4 states and 57 transitions. [2022-12-13 10:22:56,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 109 transitions, 1670 flow [2022-12-13 10:22:56,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 1594 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-13 10:22:56,845 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 1218 flow [2022-12-13 10:22:56,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1218, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2022-12-13 10:22:56,846 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2022-12-13 10:22:56,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:56,846 INFO L89 Accepts]: Start accepts. Operand has 88 places, 87 transitions, 1218 flow [2022-12-13 10:22:56,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:56,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:56,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 87 transitions, 1218 flow [2022-12-13 10:22:56,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 1218 flow [2022-12-13 10:22:56,878 INFO L130 PetriNetUnfolder]: 69/203 cut-off events. [2022-12-13 10:22:56,878 INFO L131 PetriNetUnfolder]: For 2814/2843 co-relation queries the response was YES. [2022-12-13 10:22:56,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 203 events. 69/203 cut-off events. For 2814/2843 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1018 event pairs, 2 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 1375. Up to 85 conditions per place. [2022-12-13 10:22:56,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 87 transitions, 1218 flow [2022-12-13 10:22:56,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 10:22:56,881 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:22:56,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 10:22:56,882 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 1218 flow [2022-12-13 10:22:56,882 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-13 10:22:56,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:22:56,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:22:56,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 10:22:56,882 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:22:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:22:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1469954648, now seen corresponding path program 1 times [2022-12-13 10:22:56,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:22:56,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948404088] [2022-12-13 10:22:56,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:22:56,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:22:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:22:57,063 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-13 10:22:57,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:22:57,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948404088] [2022-12-13 10:22:57,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948404088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:22:57,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:22:57,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:22:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596360476] [2022-12-13 10:22:57,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:22:57,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:22:57,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:22:57,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:22:57,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:22:57,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 10:22:57,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 1218 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:22:57,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:22:57,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 10:22:57,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:22:57,321 INFO L130 PetriNetUnfolder]: 262/483 cut-off events. [2022-12-13 10:22:57,321 INFO L131 PetriNetUnfolder]: For 6859/6903 co-relation queries the response was YES. [2022-12-13 10:22:57,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3760 conditions, 483 events. 262/483 cut-off events. For 6859/6903 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2142 event pairs, 20 based on Foata normal form. 1/484 useless extension candidates. Maximal degree in co-relation 3562. Up to 460 conditions per place. [2022-12-13 10:22:57,326 INFO L137 encePairwiseOnDemand]: 17/36 looper letters, 74 selfloop transitions, 18 changer transitions 5/98 dead transitions. [2022-12-13 10:22:57,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 98 transitions, 1478 flow [2022-12-13 10:22:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:22:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:22:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-13 10:22:57,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2022-12-13 10:22:57,327 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 1218 flow. Second operand 6 states and 56 transitions. [2022-12-13 10:22:57,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 98 transitions, 1478 flow [2022-12-13 10:22:57,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 1441 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 10:22:57,346 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 1259 flow [2022-12-13 10:22:57,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1259, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2022-12-13 10:22:57,347 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 73 predicate places. [2022-12-13 10:22:57,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:22:57,347 INFO L89 Accepts]: Start accepts. Operand has 93 places, 88 transitions, 1259 flow [2022-12-13 10:22:57,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:22:57,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:22:57,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 1259 flow [2022-12-13 10:22:57,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 88 transitions, 1259 flow [2022-12-13 10:22:57,379 INFO L130 PetriNetUnfolder]: 69/202 cut-off events. [2022-12-13 10:22:57,379 INFO L131 PetriNetUnfolder]: For 2934/2963 co-relation queries the response was YES. [2022-12-13 10:22:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 202 events. 69/202 cut-off events. For 2934/2963 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1016 event pairs, 2 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 1418. Up to 85 conditions per place. [2022-12-13 10:22:57,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 88 transitions, 1259 flow [2022-12-13 10:22:57,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-13 10:22:58,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [872] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| v_~f2_7~0_358))) (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_221| .cse0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_258| |v_thread1Thread1of1ForFork0_minus_#res#1_240|) |v_thread1Thread1of1ForFork0_minus_~a#1_258|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_255| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_255| |v_thread2Thread1of1ForFork1_minus_#res#1_239|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_228| |v_thread1Thread1of1ForFork0_plus_~b#1_246|) (= |v_thread1Thread1of1ForFork0_~i~0#1_291| (+ |v_thread1Thread1of1ForFork0_~i~0#1_292| 2)) (not (= (ite (or (<= v_~f2_3~0_345 0) (<= 0 (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_226| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_332|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|) (= v_~f1_2~0_384 |v_thread1Thread1of1ForFork0_minus_#in~a#1_224|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_233| v_~f1_6~0_373) (= |v_thread2Thread1of1ForFork1_plus_#res#1_231| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_251| |v_thread2Thread1of1ForFork1_plus_~a#1_249|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_224| |v_thread1Thread1of1ForFork0_minus_~a#1_258|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| v_~f2_7~0_358 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_255| |v_thread2Thread1of1ForFork1_minus_#in~b#1_233|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_251| |v_thread2Thread1of1ForFork1_plus_#in~b#1_225|) (= v_~f1_2~0_384 |v_thread1Thread1of1ForFork0_plus_#res#1_242|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_258| |v_thread1Thread1of1ForFork0_minus_#in~b#1_226|) (<= .cse0 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|)) (= (+ v_~f1_2~0_385 v_~f2_3~0_345) |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|) (<= 0 (+ v_~f1_2~0_384 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_242| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_246| |v_thread1Thread1of1ForFork0_plus_~b#1_246|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| |v_thread2Thread1of1ForFork1_minus_#in~b#1_233|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_240| v_~f2_3~0_344) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_255| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_255|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_255|)) 1 0)) (= v_~f2_7~0_356 |v_thread2Thread1of1ForFork1_minus_#res#1_239|) (= (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_226| v_~f2_3~0_345) |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_231| v_~f1_6~0_373) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_289|) (<= |v_thread1Thread1of1ForFork0_minus_#in~b#1_226| 2147483647) (<= v_~f1_2~0_384 2147483647) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_258|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_258| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_258|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_231| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_255| |v_thread2Thread1of1ForFork1_minus_#in~a#1_233|) (<= |v_thread1Thread1of1ForFork0_plus_#in~a#1_228| 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_231| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_228| |v_thread1Thread1of1ForFork0_minus_#in~b#1_226|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| 2147483648)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_292| 1) v_~n_0~0_227) (= |v_thread1Thread1of1ForFork0_plus_~a#1_246| |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_221| |v_thread2Thread1of1ForFork1_plus_~a#1_249|) (< 1 v_~n_0~0_227) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| v_~f1_6~0_375))) InVars {~f1_2~0=v_~f1_2~0_385, ~f2_3~0=v_~f2_3~0_345, ~n_0~0=v_~n_0~0_227, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_292|, ~f2_7~0=v_~f2_7~0_358, ~f1_6~0=v_~f1_6~0_375} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_174|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_224|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_249|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_198|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_239|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_228|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_289|, ~f1_6~0=v_~f1_6~0_373, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_182|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_255|, ~f1_2~0=v_~f1_2~0_384, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_233|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_231|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_180|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_251|, ~n_0~0=v_~n_0~0_227, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_190|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_332|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_233|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_221|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_240|, ~f2_3~0=v_~f2_3~0_344, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_246|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_255|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_246|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_225|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_226|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_258|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_291|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_258|, ~f2_7~0=v_~f2_7~0_356, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_242|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_228|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_182|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:23:00,326 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [872] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| v_~f2_7~0_358))) (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_221| .cse0) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_258| |v_thread1Thread1of1ForFork0_minus_#res#1_240|) |v_thread1Thread1of1ForFork0_minus_~a#1_258|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_255| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_255| |v_thread2Thread1of1ForFork1_minus_#res#1_239|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_228| |v_thread1Thread1of1ForFork0_plus_~b#1_246|) (= |v_thread1Thread1of1ForFork0_~i~0#1_291| (+ |v_thread1Thread1of1ForFork0_~i~0#1_292| 2)) (not (= (ite (or (<= v_~f2_3~0_345 0) (<= 0 (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_226| 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_332|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|) (= v_~f1_2~0_384 |v_thread1Thread1of1ForFork0_minus_#in~a#1_224|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_233| v_~f1_6~0_373) (= |v_thread2Thread1of1ForFork1_plus_#res#1_231| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_251| |v_thread2Thread1of1ForFork1_plus_~a#1_249|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_224| |v_thread1Thread1of1ForFork0_minus_~a#1_258|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| v_~f2_7~0_358 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_255| |v_thread2Thread1of1ForFork1_minus_#in~b#1_233|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_251| |v_thread2Thread1of1ForFork1_plus_#in~b#1_225|) (= v_~f1_2~0_384 |v_thread1Thread1of1ForFork0_plus_#res#1_242|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_258| |v_thread1Thread1of1ForFork0_minus_#in~b#1_226|) (<= .cse0 2147483647) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|)) (= (+ v_~f1_2~0_385 v_~f2_3~0_345) |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|) (<= 0 (+ v_~f1_2~0_384 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_242| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_246| |v_thread1Thread1of1ForFork0_plus_~b#1_246|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| |v_thread2Thread1of1ForFork1_minus_#in~b#1_233|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_240| v_~f2_3~0_344) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_255| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_255|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_255|)) 1 0)) (= v_~f2_7~0_356 |v_thread2Thread1of1ForFork1_minus_#res#1_239|) (= (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_226| v_~f2_3~0_345) |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_231| v_~f1_6~0_373) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_289|) (<= |v_thread1Thread1of1ForFork0_minus_#in~b#1_226| 2147483647) (<= v_~f1_2~0_384 2147483647) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_258|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_258| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_258|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_231| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_255| |v_thread2Thread1of1ForFork1_minus_#in~a#1_233|) (<= |v_thread1Thread1of1ForFork0_plus_#in~a#1_228| 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_231| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_228| |v_thread1Thread1of1ForFork0_minus_#in~b#1_226|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| 2147483648)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_292| 1) v_~n_0~0_227) (= |v_thread1Thread1of1ForFork0_plus_~a#1_246| |v_thread1Thread1of1ForFork0_plus_#in~a#1_228|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_221| |v_thread2Thread1of1ForFork1_plus_~a#1_249|) (< 1 v_~n_0~0_227) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_225| v_~f1_6~0_375))) InVars {~f1_2~0=v_~f1_2~0_385, ~f2_3~0=v_~f2_3~0_345, ~n_0~0=v_~n_0~0_227, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_292|, ~f2_7~0=v_~f2_7~0_358, ~f1_6~0=v_~f1_6~0_375} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_174|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_224|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_249|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_198|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_239|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_299|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_228|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_289|, ~f1_6~0=v_~f1_6~0_373, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_182|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_255|, ~f1_2~0=v_~f1_2~0_384, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_233|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_231|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_180|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_251|, ~n_0~0=v_~n_0~0_227, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_190|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_332|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_233|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_221|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_240|, ~f2_3~0=v_~f2_3~0_344, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_246|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_255|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_246|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_225|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_226|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_258|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_291|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_258|, ~f2_7~0=v_~f2_7~0_356, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_242|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_228|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_182|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:23:01,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [887] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_244| v_~f2_7~0_390))) (and (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_274|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_274| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_274|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_252| v_~f1_6~0_412) (<= v_~f1_2~0_433 2147483647) (<= 0 (+ v_~f1_2~0_433 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_240| .cse0) (= |v_thread1Thread1of1ForFork0_minus_#res#1_269| v_~f2_3~0_393) (= (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_255| v_~f2_3~0_394) |v_thread1Thread1of1ForFork0_plus_#in~a#1_257|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_274| |v_thread2Thread1of1ForFork1_minus_#in~b#1_252|) (= v_~f1_2~0_433 |v_thread1Thread1of1ForFork0_minus_#in~a#1_253|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_244| v_~f2_7~0_390 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_240| |v_thread2Thread1of1ForFork1_plus_~a#1_268|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_257| |v_thread1Thread1of1ForFork0_minus_#in~b#1_255|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_316|) (= v_~f2_7~0_389 |v_thread2Thread1of1ForFork1_minus_#res#1_258|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346|) (= |v_thread1Thread1of1ForFork0_~i~0#1_338| (+ |v_thread1Thread1of1ForFork0_~i~0#1_339| 2)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_250| 2147483648)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_338| v_~n_0~0_247)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_244| |v_thread2Thread1of1ForFork1_minus_#in~b#1_252|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_274| |v_thread2Thread1of1ForFork1_minus_#in~a#1_252|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_329| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_361|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_244| v_~f1_6~0_413) (= |v_thread2Thread1of1ForFork1_plus_#res#1_250| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_270| |v_thread2Thread1of1ForFork1_plus_~a#1_268|)) (<= |v_thread1Thread1of1ForFork0_minus_#in~b#1_255| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_270| |v_thread2Thread1of1ForFork1_plus_#in~b#1_244|) (= (+ v_~f1_2~0_434 v_~f2_3~0_394) |v_thread1Thread1of1ForFork0_plus_#in~a#1_257|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_287| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_287|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_287|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_329|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_274| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_274| |v_thread2Thread1of1ForFork1_minus_#res#1_258|)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_275| |v_thread1Thread1of1ForFork0_plus_#in~a#1_257|) (= |v_thread1Thread1of1ForFork0_#res#1.base_59| 0) (= |v_thread1Thread1of1ForFork0_minus_~b#1_287| |v_thread1Thread1of1ForFork0_minus_#in~b#1_255|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_59| 0) (= |v_thread1Thread1of1ForFork0_plus_#res#1_271| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_275| |v_thread1Thread1of1ForFork0_plus_~b#1_275|)) (= v_~f1_2~0_433 |v_thread1Thread1of1ForFork0_plus_#res#1_271|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork0_plus_#in~a#1_257|)) (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_255| 2147483648)) (<= v_~f2_3~0_394 0)) 1 0) 0)) (<= .cse0 2147483647) (= v_~l_4~0_104 (ite (< 0 v_~f1_2~0_433) 1 0)) (< (+ |v_thread1Thread1of1ForFork0_~i~0#1_339| 1) v_~n_0~0_247) (= |v_thread2Thread1of1ForFork1_plus_#res#1_250| v_~f1_6~0_412) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_253| |v_thread1Thread1of1ForFork0_minus_~a#1_287|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_257| |v_thread1Thread1of1ForFork0_plus_~b#1_275|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_244| 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_287| |v_thread1Thread1of1ForFork0_minus_#res#1_269|) |v_thread1Thread1of1ForFork0_minus_~a#1_287|) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_244| 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_#in~a#1_257| 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_250| 2147483647) (< 1 v_~n_0~0_247))) InVars {~f1_2~0=v_~f1_2~0_434, ~f2_3~0=v_~f2_3~0_394, ~n_0~0=v_~n_0~0_247, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_339|, ~f2_7~0=v_~f2_7~0_390, ~f1_6~0=v_~f1_6~0_413} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_193|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_253|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_268|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_227|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_258|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_318|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_257|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_316|, ~f1_6~0=v_~f1_6~0_412, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_201|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_274|, ~f1_2~0=v_~f1_2~0_433, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_252|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_250|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_209|, ~n_0~0=v_~n_0~0_247, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_270|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_219|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_361|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_252|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_59|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_240|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_269|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_59|, ~f2_3~0=v_~f2_3~0_393, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_275|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_274|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_275|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_244|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_346|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_255|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_329|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_287|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_287|, ~f2_7~0=v_~f2_7~0_389, ~l_4~0=v_~l_4~0_104, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_271|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_257|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_201|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:02,925 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:23:02,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5578 [2022-12-13 10:23:02,925 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 1291 flow [2022-12-13 10:23:02,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:02,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:02,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:02,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 10:23:02,926 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:02,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1173879295, now seen corresponding path program 1 times [2022-12-13 10:23:02,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:02,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640944276] [2022-12-13 10:23:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:02,970 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-13 10:23:02,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:02,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640944276] [2022-12-13 10:23:02,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640944276] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:23:02,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163890012] [2022-12-13 10:23:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:02,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:23:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:23:02,972 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-13 10:23:02,974 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-13 10:23:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:03,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 10:23:03,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:23:03,112 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-13 10:23:03,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:23:03,122 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-13 10:23:03,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163890012] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:23:03,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:23:03,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:23:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230215818] [2022-12-13 10:23:03,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:23:03,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:23:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:23:03,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:23:03,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 10:23:03,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 1291 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-13 10:23:03,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:03,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 10:23:03,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:03,341 INFO L130 PetriNetUnfolder]: 317/612 cut-off events. [2022-12-13 10:23:03,341 INFO L131 PetriNetUnfolder]: For 10704/10704 co-relation queries the response was YES. [2022-12-13 10:23:03,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4912 conditions, 612 events. 317/612 cut-off events. For 10704/10704 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2959 event pairs, 77 based on Foata normal form. 4/616 useless extension candidates. Maximal degree in co-relation 4818. Up to 363 conditions per place. [2022-12-13 10:23:03,346 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 109 selfloop transitions, 25 changer transitions 1/135 dead transitions. [2022-12-13 10:23:03,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 135 transitions, 2163 flow [2022-12-13 10:23:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:23:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:23:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-12-13 10:23:03,347 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27884615384615385 [2022-12-13 10:23:03,347 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 1291 flow. Second operand 8 states and 87 transitions. [2022-12-13 10:23:03,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 135 transitions, 2163 flow [2022-12-13 10:23:03,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 2054 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:03,369 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 1328 flow [2022-12-13 10:23:03,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1328, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2022-12-13 10:23:03,369 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2022-12-13 10:23:03,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:03,370 INFO L89 Accepts]: Start accepts. Operand has 96 places, 90 transitions, 1328 flow [2022-12-13 10:23:03,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:03,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:03,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 90 transitions, 1328 flow [2022-12-13 10:23:03,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 1328 flow [2022-12-13 10:23:03,410 INFO L130 PetriNetUnfolder]: 79/258 cut-off events. [2022-12-13 10:23:03,411 INFO L131 PetriNetUnfolder]: For 4656/4687 co-relation queries the response was YES. [2022-12-13 10:23:03,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 258 events. 79/258 cut-off events. For 4656/4687 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1450 event pairs, 4 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 1822. Up to 103 conditions per place. [2022-12-13 10:23:03,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 1328 flow [2022-12-13 10:23:03,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 10:23:03,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:03,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:04,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:04,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [890] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#res#1_258| v_~f1_6~0_424) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_259| |v_thread1Thread1of1ForFork0_minus_~a#1_293|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_349| 1) |v_thread1Thread1of1ForFork0_~i~0#1_348|) (<= v_~f1_2~0_443 2147483647) (<= 0 (+ v_~f1_2~0_443 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_282| |v_thread2Thread1of1ForFork1_minus_#in~a#1_260|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_275| v_~f2_3~0_403) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_367|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_293| |v_thread1Thread1of1ForFork0_minus_#res#1_275|) |v_thread1Thread1of1ForFork0_minus_~a#1_293|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_261| v_~f2_3~0_404) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_278| |v_thread2Thread1of1ForFork1_plus_~a#1_276|) |v_thread2Thread1of1ForFork1_plus_#res#1_258|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_277| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_281| |v_thread1Thread1of1ForFork0_plus_~b#1_281|)) (= v_~f1_2~0_443 |v_thread1Thread1of1ForFork0_plus_#res#1_277|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_263| v_~f2_3~0_404) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_258| 2147483648)) (<= 0 (+ v_~f2_7~0_401 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_282| |v_thread2Thread1of1ForFork1_minus_#in~b#1_260|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_252| v_~f2_7~0_402) (< |v_thread2Thread1of1ForFork1_~i~1#1_326| v_~n_0~0_251) (= v_~f2_7~0_401 |v_thread2Thread1of1ForFork1_minus_#res#1_266|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_293| |v_thread1Thread1of1ForFork0_minus_#in~b#1_261|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_248| v_~f1_6~0_425) (= |v_thread1Thread1of1ForFork0_plus_~a#1_281| |v_thread1Thread1of1ForFork0_plus_#in~a#1_263|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_282|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_282| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_282|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_248| |v_thread2Thread1of1ForFork1_plus_~a#1_276|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_282| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_282| |v_thread2Thread1of1ForFork1_minus_#res#1_266|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_293| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_293|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_293|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_260| v_~f1_6~0_424) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_263| |v_thread1Thread1of1ForFork0_plus_~b#1_281|) (<= v_~f2_7~0_401 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_275| 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_260| v_~f2_7~0_402) (= v_~f1_2~0_443 |v_thread1Thread1of1ForFork0_minus_#in~a#1_259|) (= v_~f1_2~0_444 |v_thread1Thread1of1ForFork0_plus_#in~a#1_263|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_278| |v_thread2Thread1of1ForFork1_plus_#in~b#1_252|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_258| 2147483647) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_326| 1) |v_thread2Thread1of1ForFork1_~i~1#1_325|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_293| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_293| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_293|))) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_349| v_~n_0~0_251) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_354|)) InVars {~f1_2~0=v_~f1_2~0_444, ~f2_3~0=v_~f2_3~0_404, ~n_0~0=v_~n_0~0_251, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_349|, ~f2_7~0=v_~f2_7~0_402, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_326|, ~f1_6~0=v_~f1_6~0_425} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_201|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_259|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_276|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_233|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_266|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_326|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_263|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_325|, ~f1_6~0=v_~f1_6~0_424, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_209|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_282|, ~f1_2~0=v_~f1_2~0_443, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_260|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_258|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_215|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_278|, ~n_0~0=v_~n_0~0_251, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_225|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_367|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_260|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_248|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_275|, ~f2_3~0=v_~f2_3~0_403, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_281|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_282|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_281|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_252|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_354|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_261|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_335|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_293|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_348|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_293|, ~f2_7~0=v_~f2_7~0_401, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_277|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_263|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_209|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:05,835 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:23:05,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2467 [2022-12-13 10:23:05,836 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 1394 flow [2022-12-13 10:23:05,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-13 10:23:05,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:05,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:05,843 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-13 10:23:06,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:23:06,037 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 410869522, now seen corresponding path program 1 times [2022-12-13 10:23:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194830494] [2022-12-13 10:23:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:06,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:06,067 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-13 10:23:06,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:06,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194830494] [2022-12-13 10:23:06,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194830494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:06,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:06,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:23:06,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104845417] [2022-12-13 10:23:06,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:06,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:23:06,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:06,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:23:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:23:06,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 10:23:06,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 1394 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-13 10:23:06,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:06,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 10:23:06,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:06,208 INFO L130 PetriNetUnfolder]: 312/605 cut-off events. [2022-12-13 10:23:06,208 INFO L131 PetriNetUnfolder]: For 12718/12718 co-relation queries the response was YES. [2022-12-13 10:23:06,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4960 conditions, 605 events. 312/605 cut-off events. For 12718/12718 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2996 event pairs, 110 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 4589. Up to 548 conditions per place. [2022-12-13 10:23:06,213 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 90 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2022-12-13 10:23:06,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 1670 flow [2022-12-13 10:23:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:23:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:23:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-13 10:23:06,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42735042735042733 [2022-12-13 10:23:06,217 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 1394 flow. Second operand 3 states and 50 transitions. [2022-12-13 10:23:06,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 1670 flow [2022-12-13 10:23:06,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 101 transitions, 1549 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:06,244 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 1277 flow [2022-12-13 10:23:06,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1277, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2022-12-13 10:23:06,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 74 predicate places. [2022-12-13 10:23:06,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:06,245 INFO L89 Accepts]: Start accepts. Operand has 94 places, 89 transitions, 1277 flow [2022-12-13 10:23:06,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:06,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:06,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 1277 flow [2022-12-13 10:23:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 1277 flow [2022-12-13 10:23:06,283 INFO L130 PetriNetUnfolder]: 77/256 cut-off events. [2022-12-13 10:23:06,283 INFO L131 PetriNetUnfolder]: For 3944/3974 co-relation queries the response was YES. [2022-12-13 10:23:06,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 256 events. 77/256 cut-off events. For 3944/3974 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1494 event pairs, 3 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 1676. Up to 101 conditions per place. [2022-12-13 10:23:06,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 1277 flow [2022-12-13 10:23:06,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 10:23:08,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:23:08,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2220 [2022-12-13 10:23:08,465 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 1287 flow [2022-12-13 10:23:08,465 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-13 10:23:08,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:08,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:08,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 10:23:08,466 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1438013614, now seen corresponding path program 1 times [2022-12-13 10:23:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:08,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231833164] [2022-12-13 10:23:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:08,499 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-13 10:23:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:08,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231833164] [2022-12-13 10:23:08,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231833164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:08,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:08,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233589373] [2022-12-13 10:23:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:08,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:23:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:23:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:23:08,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 10:23:08,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 1287 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-13 10:23:08,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:08,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 10:23:08,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:08,702 INFO L130 PetriNetUnfolder]: 318/615 cut-off events. [2022-12-13 10:23:08,702 INFO L131 PetriNetUnfolder]: For 10413/10413 co-relation queries the response was YES. [2022-12-13 10:23:08,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4802 conditions, 615 events. 318/615 cut-off events. For 10413/10413 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3076 event pairs, 102 based on Foata normal form. 4/619 useless extension candidates. Maximal degree in co-relation 4443. Up to 500 conditions per place. [2022-12-13 10:23:08,706 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 83 selfloop transitions, 24 changer transitions 0/107 dead transitions. [2022-12-13 10:23:08,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 107 transitions, 1691 flow [2022-12-13 10:23:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:23:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:23:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 10:23:08,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 10:23:08,707 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 1287 flow. Second operand 5 states and 57 transitions. [2022-12-13 10:23:08,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 107 transitions, 1691 flow [2022-12-13 10:23:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 107 transitions, 1651 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 10:23:08,724 INFO L231 Difference]: Finished difference. Result has 97 places, 90 transitions, 1346 flow [2022-12-13 10:23:08,724 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1346, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2022-12-13 10:23:08,724 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 77 predicate places. [2022-12-13 10:23:08,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:08,725 INFO L89 Accepts]: Start accepts. Operand has 97 places, 90 transitions, 1346 flow [2022-12-13 10:23:08,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:08,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:08,725 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 90 transitions, 1346 flow [2022-12-13 10:23:08,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 90 transitions, 1346 flow [2022-12-13 10:23:08,755 INFO L130 PetriNetUnfolder]: 79/254 cut-off events. [2022-12-13 10:23:08,756 INFO L131 PetriNetUnfolder]: For 4719/4751 co-relation queries the response was YES. [2022-12-13 10:23:08,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 254 events. 79/254 cut-off events. For 4719/4751 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1465 event pairs, 4 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 1796. Up to 104 conditions per place. [2022-12-13 10:23:08,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 90 transitions, 1346 flow [2022-12-13 10:23:08,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-13 10:23:08,758 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:08,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 10:23:08,759 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 1346 flow [2022-12-13 10:23:08,759 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-13 10:23:08,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:08,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:08,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 10:23:08,759 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -739041456, now seen corresponding path program 1 times [2022-12-13 10:23:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633207690] [2022-12-13 10:23:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:08,933 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-13 10:23:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:08,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633207690] [2022-12-13 10:23:08,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633207690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:08,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:08,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153751217] [2022-12-13 10:23:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:08,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:08,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 10:23:08,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 1346 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:08,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:08,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 10:23:08,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:09,202 INFO L130 PetriNetUnfolder]: 328/641 cut-off events. [2022-12-13 10:23:09,202 INFO L131 PetriNetUnfolder]: For 11760/11810 co-relation queries the response was YES. [2022-12-13 10:23:09,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5140 conditions, 641 events. 328/641 cut-off events. For 11760/11810 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3278 event pairs, 38 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 4778. Up to 608 conditions per place. [2022-12-13 10:23:09,206 INFO L137 encePairwiseOnDemand]: 17/38 looper letters, 83 selfloop transitions, 21 changer transitions 5/110 dead transitions. [2022-12-13 10:23:09,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 110 transitions, 1761 flow [2022-12-13 10:23:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-13 10:23:09,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27631578947368424 [2022-12-13 10:23:09,207 INFO L175 Difference]: Start difference. First operand has 97 places, 90 transitions, 1346 flow. Second operand 6 states and 63 transitions. [2022-12-13 10:23:09,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 110 transitions, 1761 flow [2022-12-13 10:23:09,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 110 transitions, 1712 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:09,227 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 1457 flow [2022-12-13 10:23:09,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1457, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2022-12-13 10:23:09,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 82 predicate places. [2022-12-13 10:23:09,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:09,228 INFO L89 Accepts]: Start accepts. Operand has 102 places, 95 transitions, 1457 flow [2022-12-13 10:23:09,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:09,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:09,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 95 transitions, 1457 flow [2022-12-13 10:23:09,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 95 transitions, 1457 flow [2022-12-13 10:23:09,266 INFO L130 PetriNetUnfolder]: 82/267 cut-off events. [2022-12-13 10:23:09,267 INFO L131 PetriNetUnfolder]: For 5174/5206 co-relation queries the response was YES. [2022-12-13 10:23:09,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 267 events. 82/267 cut-off events. For 5174/5206 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1564 event pairs, 4 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 1978. Up to 108 conditions per place. [2022-12-13 10:23:09,270 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 95 transitions, 1457 flow [2022-12-13 10:23:09,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 10:23:10,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [896] $Ultimate##0-->L54-5: Formula: (and (= v_~f2_7~0_419 |v_thread2Thread1of1ForFork1_minus_#res#1_276|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_271| |v_thread1Thread1of1ForFork0_minus_#in~b#1_269|) (<= v_~f1_2~0_459 2147483647) (<= 0 (+ v_~f1_2~0_459 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_285| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_289| |v_thread1Thread1of1ForFork0_plus_~b#1_289|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_262| |v_thread2Thread1of1ForFork1_minus_#in~b#1_270|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_283| v_~f2_3~0_419) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_292| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_292|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_292|)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_364| 4) (< |v_thread1Thread1of1ForFork0_~i~0#1_364| (+ v_~n_0~0_259 1)) (= v_~f1_2~0_459 |v_thread1Thread1of1ForFork0_plus_#res#1_285|) (<= v_~f1_2~0_461 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_262| (+ (* 2 v_~f1_6~0_444) v_~f2_7~0_421)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_301| |v_thread1Thread1of1ForFork0_minus_#res#1_283|) |v_thread1Thread1of1ForFork0_minus_~a#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_301| |v_thread1Thread1of1ForFork0_minus_#in~b#1_269|) (= (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_258| v_~f1_6~0_444) (* |v_thread2Thread1of1ForFork1_plus_#in~b#1_262| 2)) (not (= (ite (or (<= 0 (+ v_~f1_2~0_461 2147483648)) (<= v_~f2_3~0_421 0)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_288| |v_thread2Thread1of1ForFork1_plus_~a#1_286|) |v_thread2Thread1of1ForFork1_plus_#res#1_268|) (= |v_thread2Thread1of1ForFork1_~i~1#1_343| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_292| |v_thread2Thread1of1ForFork1_minus_#in~b#1_270|) (= v_~f1_2~0_459 |v_thread1Thread1of1ForFork0_minus_#in~a#1_267|) (<= 0 (+ v_~f1_6~0_444 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_258| |v_thread2Thread1of1ForFork1_plus_~a#1_286|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_289| |v_thread1Thread1of1ForFork0_plus_#in~a#1_271|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_267| |v_thread1Thread1of1ForFork0_minus_~a#1_301|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_270| v_~f1_6~0_442) (= (+ v_~f1_2~0_461 |v_thread1Thread1of1ForFork0_plus_#in~a#1_271|) (* 2 |v_thread1Thread1of1ForFork0_minus_#in~b#1_269|)) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_301| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_301|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_301|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_268| 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_375|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_271| |v_thread1Thread1of1ForFork0_plus_~b#1_289|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_269| (+ (* v_~f1_2~0_461 2) v_~f2_3~0_421)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_268| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_268| v_~f1_6~0_442) (= |v_thread2Thread1of1ForFork1_plus_~b#1_288| |v_thread2Thread1of1ForFork1_plus_#in~b#1_262|) (<= v_~f1_6~0_444 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_292| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_292| |v_thread2Thread1of1ForFork1_minus_#res#1_276|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_292| |v_thread2Thread1of1ForFork1_minus_#in~a#1_270|)) InVars {~f1_2~0=v_~f1_2~0_461, ~f2_3~0=v_~f2_3~0_421, ~n_0~0=v_~n_0~0_259, ~f2_7~0=v_~f2_7~0_421, ~f1_6~0=v_~f1_6~0_444} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_211|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_267|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_286|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_241|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_276|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_271|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_343|, ~f1_6~0=v_~f1_6~0_442, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_219|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_292|, ~f1_2~0=v_~f1_2~0_459, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_270|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_268|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_223|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_288|, ~n_0~0=v_~n_0~0_259, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_233|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_375|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_270|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_258|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_283|, ~f2_3~0=v_~f2_3~0_419, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_289|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_292|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_289|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_262|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_269|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_301|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_364|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_301|, ~f2_7~0=v_~f2_7~0_419, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_285|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_271|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_219|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:23:12,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:23:12,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [897] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_305| |v_thread1Thread1of1ForFork0_minus_#in~b#1_273|) (= |v_thread1Thread1of1ForFork0_~i~0#1_368| 4) (= (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_262| v_~f1_6~0_449) (* |v_thread2Thread1of1ForFork1_plus_#in~b#1_266| 2)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_262| |v_thread2Thread1of1ForFork1_plus_~a#1_290|) (< |v_thread1Thread1of1ForFork0_~i~0#1_368| (+ v_~n_0~0_261 1)) (= v_~l_8~0_121 (ite (< 0 v_~f1_6~0_448) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_340| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_296|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_296| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_296|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_292| |v_thread2Thread1of1ForFork1_plus_#in~b#1_266|) (= v_~f2_7~0_425 |v_thread2Thread1of1ForFork1_minus_#res#1_280|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_266| |v_thread2Thread1of1ForFork1_minus_#in~b#1_274|) (= v_~f1_2~0_465 |v_thread1Thread1of1ForFork0_minus_#in~a#1_271|) (<= v_~f1_2~0_466 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#res#1_289| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_293| |v_thread1Thread1of1ForFork0_plus_~b#1_293|)) (= (* 2 |v_thread1Thread1of1ForFork0_minus_#in~b#1_273|) (+ v_~f1_2~0_466 |v_thread1Thread1of1ForFork0_plus_#in~a#1_275|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_296| |v_thread2Thread1of1ForFork1_minus_#in~b#1_274|) (<= v_~f1_6~0_449 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_275| |v_thread1Thread1of1ForFork0_plus_~b#1_293|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_274| v_~f1_6~0_448) (= |v_thread2Thread1of1ForFork1_minus_~a#1_296| |v_thread2Thread1of1ForFork1_minus_#in~a#1_274|) (<= v_~f1_2~0_465 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_272| 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_271| |v_thread1Thread1of1ForFork0_minus_~a#1_305|) (= |v_thread2Thread1of1ForFork1_~i~1#1_347| 4) (= |v_thread1Thread1of1ForFork0_plus_~a#1_293| |v_thread1Thread1of1ForFork0_plus_#in~a#1_275|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_340| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_272| 2147483647) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_292| |v_thread2Thread1of1ForFork1_plus_~a#1_290|) |v_thread2Thread1of1ForFork1_plus_#res#1_272|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_272| v_~f1_6~0_448) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_266| (+ v_~f2_7~0_426 (* 2 v_~f1_6~0_449))) (<= 0 (+ v_~f1_6~0_449 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_305| |v_thread1Thread1of1ForFork0_minus_#res#1_287|) |v_thread1Thread1of1ForFork0_minus_~a#1_305|) (= (+ (* v_~f1_2~0_466 2) v_~f2_3~0_426) |v_thread1Thread1of1ForFork0_minus_#in~b#1_273|) (not (= (ite (or (<= v_~f2_3~0_426 0) (<= 0 (+ v_~f1_2~0_466 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_296| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_296| |v_thread2Thread1of1ForFork1_minus_#res#1_280|)) (<= 0 (+ v_~f1_2~0_465 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_347| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_379|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_80|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_347| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_305| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_305|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_305|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_275| |v_thread1Thread1of1ForFork0_minus_#in~b#1_273|) (= v_~f1_2~0_465 |v_thread1Thread1of1ForFork0_plus_#res#1_289|) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_347| v_~n_0~0_261)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_80| 0) (= |v_thread1Thread1of1ForFork0_minus_#res#1_287| v_~f2_3~0_425)) InVars {~f1_2~0=v_~f1_2~0_466, ~f2_3~0=v_~f2_3~0_426, ~n_0~0=v_~n_0~0_261, ~f2_7~0=v_~f2_7~0_426, ~f1_6~0=v_~f1_6~0_449} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_215|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_271|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_80|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_290|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_245|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_280|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_340|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_275|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_347|, ~f1_6~0=v_~f1_6~0_448, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_223|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_296|, ~f1_2~0=v_~f1_2~0_465, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_274|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_272|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_227|, ~n_0~0=v_~n_0~0_261, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_292|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_237|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_379|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_274|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_262|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_287|, ~f2_3~0=v_~f2_3~0_425, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_293|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_296|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_293|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_266|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_273|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_347|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_80|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_305|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_368|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_305|, ~l_8~0=v_~l_8~0_121, ~f2_7~0=v_~f2_7~0_425, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_289|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_275|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_223|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:23:12,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:13,241 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [902] $Ultimate##0-->L44-5: Formula: false InVars {} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_219|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_279|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_253|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_84|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_294|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_283|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_284|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_344|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_353|, ~f1_6~0=v_~f1_6~0_458, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_227|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_300|, ~f1_2~0=v_~f1_2~0_479, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_235|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_278|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_276|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_296|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_245|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_387|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_278|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_266|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_295|, ~f2_3~0=v_~f2_3~0_439, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_301|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_300|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_301|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_270|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_281|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_355|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_84|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_313|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_378|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_313|, ~l_8~0=v_~l_8~0_125, ~f2_7~0=v_~f2_7~0_433, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_297|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_283|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_227|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:13,245 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:23:13,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4017 [2022-12-13 10:23:13,245 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 1591 flow [2022-12-13 10:23:13,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:13,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:13,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:13,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 10:23:13,246 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1004421606, now seen corresponding path program 2 times [2022-12-13 10:23:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:13,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357482915] [2022-12-13 10:23:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:13,416 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-13 10:23:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357482915] [2022-12-13 10:23:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357482915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:13,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:13,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006998763] [2022-12-13 10:23:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:13,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:13,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-13 10:23:13,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 1591 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:13,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:13,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-13 10:23:13,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:13,682 INFO L130 PetriNetUnfolder]: 322/627 cut-off events. [2022-12-13 10:23:13,683 INFO L131 PetriNetUnfolder]: For 12918/12976 co-relation queries the response was YES. [2022-12-13 10:23:13,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 627 events. 322/627 cut-off events. For 12918/12976 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3194 event pairs, 38 based on Foata normal form. 3/630 useless extension candidates. Maximal degree in co-relation 5052. Up to 604 conditions per place. [2022-12-13 10:23:13,688 INFO L137 encePairwiseOnDemand]: 21/43 looper letters, 78 selfloop transitions, 20 changer transitions 5/104 dead transitions. [2022-12-13 10:23:13,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 1714 flow [2022-12-13 10:23:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-13 10:23:13,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23255813953488372 [2022-12-13 10:23:13,689 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 1591 flow. Second operand 6 states and 60 transitions. [2022-12-13 10:23:13,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 1714 flow [2022-12-13 10:23:13,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 104 transitions, 1644 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:13,720 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 1456 flow [2022-12-13 10:23:13,720 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1456, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2022-12-13 10:23:13,720 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 85 predicate places. [2022-12-13 10:23:13,720 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:13,721 INFO L89 Accepts]: Start accepts. Operand has 105 places, 94 transitions, 1456 flow [2022-12-13 10:23:13,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:13,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:13,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 94 transitions, 1456 flow [2022-12-13 10:23:13,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 94 transitions, 1456 flow [2022-12-13 10:23:13,761 INFO L130 PetriNetUnfolder]: 80/263 cut-off events. [2022-12-13 10:23:13,761 INFO L131 PetriNetUnfolder]: For 5256/5290 co-relation queries the response was YES. [2022-12-13 10:23:13,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 263 events. 80/263 cut-off events. For 5256/5290 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1560 event pairs, 4 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 1947. Up to 105 conditions per place. [2022-12-13 10:23:13,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 94 transitions, 1456 flow [2022-12-13 10:23:13,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-13 10:23:15,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:15,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [896] $Ultimate##0-->L54-5: Formula: (and (= v_~f2_7~0_419 |v_thread2Thread1of1ForFork1_minus_#res#1_276|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_271| |v_thread1Thread1of1ForFork0_minus_#in~b#1_269|) (<= v_~f1_2~0_459 2147483647) (<= 0 (+ v_~f1_2~0_459 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_285| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_289| |v_thread1Thread1of1ForFork0_plus_~b#1_289|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_262| |v_thread2Thread1of1ForFork1_minus_#in~b#1_270|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_283| v_~f2_3~0_419) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_292| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_292|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_292|)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_364| 4) (< |v_thread1Thread1of1ForFork0_~i~0#1_364| (+ v_~n_0~0_259 1)) (= v_~f1_2~0_459 |v_thread1Thread1of1ForFork0_plus_#res#1_285|) (<= v_~f1_2~0_461 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_262| (+ (* 2 v_~f1_6~0_444) v_~f2_7~0_421)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_301| |v_thread1Thread1of1ForFork0_minus_#res#1_283|) |v_thread1Thread1of1ForFork0_minus_~a#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_301| |v_thread1Thread1of1ForFork0_minus_#in~b#1_269|) (= (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_258| v_~f1_6~0_444) (* |v_thread2Thread1of1ForFork1_plus_#in~b#1_262| 2)) (not (= (ite (or (<= 0 (+ v_~f1_2~0_461 2147483648)) (<= v_~f2_3~0_421 0)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_288| |v_thread2Thread1of1ForFork1_plus_~a#1_286|) |v_thread2Thread1of1ForFork1_plus_#res#1_268|) (= |v_thread2Thread1of1ForFork1_~i~1#1_343| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_292| |v_thread2Thread1of1ForFork1_minus_#in~b#1_270|) (= v_~f1_2~0_459 |v_thread1Thread1of1ForFork0_minus_#in~a#1_267|) (<= 0 (+ v_~f1_6~0_444 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_258| |v_thread2Thread1of1ForFork1_plus_~a#1_286|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_289| |v_thread1Thread1of1ForFork0_plus_#in~a#1_271|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_267| |v_thread1Thread1of1ForFork0_minus_~a#1_301|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_270| v_~f1_6~0_442) (= (+ v_~f1_2~0_461 |v_thread1Thread1of1ForFork0_plus_#in~a#1_271|) (* 2 |v_thread1Thread1of1ForFork0_minus_#in~b#1_269|)) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_301| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_301|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_301|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_268| 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_375|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_271| |v_thread1Thread1of1ForFork0_plus_~b#1_289|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_269| (+ (* v_~f1_2~0_461 2) v_~f2_3~0_421)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_268| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_268| v_~f1_6~0_442) (= |v_thread2Thread1of1ForFork1_plus_~b#1_288| |v_thread2Thread1of1ForFork1_plus_#in~b#1_262|) (<= v_~f1_6~0_444 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_292| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_292| |v_thread2Thread1of1ForFork1_minus_#res#1_276|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_292| |v_thread2Thread1of1ForFork1_minus_#in~a#1_270|)) InVars {~f1_2~0=v_~f1_2~0_461, ~f2_3~0=v_~f2_3~0_421, ~n_0~0=v_~n_0~0_259, ~f2_7~0=v_~f2_7~0_421, ~f1_6~0=v_~f1_6~0_444} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_211|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_267|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_286|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_241|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_276|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_336|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_271|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_343|, ~f1_6~0=v_~f1_6~0_442, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_219|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_292|, ~f1_2~0=v_~f1_2~0_459, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_270|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_268|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_223|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_288|, ~n_0~0=v_~n_0~0_259, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_233|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_375|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_270|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_258|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_283|, ~f2_3~0=v_~f2_3~0_419, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_289|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_292|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_289|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_262|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_269|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_343|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_301|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_364|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_301|, ~f2_7~0=v_~f2_7~0_419, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_285|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_271|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_219|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [907] L44-5-->L54-5: Formula: (and (<= 0 (+ v_~f2_7~0_451 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_288| v_~f1_6~0_476) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_278| v_~f1_6~0_477) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_390| v_~n_0~0_275)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_290| v_~f2_7~0_452) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_290| v_~f1_6~0_476) (= |v_thread2Thread1of1ForFork1_minus_~a#1_312| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_312| |v_thread2Thread1of1ForFork1_minus_#res#1_296|)) (= v_~f2_7~0_451 |v_thread2Thread1of1ForFork1_minus_#res#1_296|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_282| v_~f2_7~0_452) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_288| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_308| |v_thread2Thread1of1ForFork1_plus_#in~b#1_282|) (= |v_thread1Thread1of1ForFork0_#res#1.base_64| 0) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_288| 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_368| 1) |v_thread2Thread1of1ForFork1_~i~1#1_367|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_308| |v_thread2Thread1of1ForFork1_plus_~a#1_306|) |v_thread2Thread1of1ForFork1_plus_#res#1_288|) (<= v_~f2_7~0_451 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_356| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_312|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_312| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_312|))) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_64| 0) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_278| |v_thread2Thread1of1ForFork1_plus_~a#1_306|) (= (ite (< 0 v_~f1_2~0_495) 1 0) v_~l_4~0_109) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_356| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_384|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_312| |v_thread2Thread1of1ForFork1_minus_#in~b#1_290|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_312| |v_thread2Thread1of1ForFork1_minus_#in~a#1_290|) (< |v_thread2Thread1of1ForFork1_~i~1#1_368| v_~n_0~0_275)) InVars {~f1_2~0=v_~f1_2~0_495, ~n_0~0=v_~n_0~0_275, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_390|, ~f2_7~0=v_~f2_7~0_452, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_368|, ~f1_6~0=v_~f1_6~0_477} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_278|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_231|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_64|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_312|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_306|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_296|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_356|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_367|, ~f1_6~0=v_~f1_6~0_476, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_239|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_282|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_312|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_384|, ~f1_2~0=v_~f1_2~0_495, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_290|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_288|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_308|, ~n_0~0=v_~n_0~0_275, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_390|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_290|, ~f2_7~0=v_~f2_7~0_451, ~l_4~0=v_~l_4~0_109, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_239|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_64|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:23:15,961 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:23:15,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2241 [2022-12-13 10:23:15,961 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 1455 flow [2022-12-13 10:23:15,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:15,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:15,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:15,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 10:23:15,962 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1923469587, now seen corresponding path program 1 times [2022-12-13 10:23:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:15,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297094877] [2022-12-13 10:23:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:15,988 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-13 10:23:15,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:15,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297094877] [2022-12-13 10:23:15,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297094877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:15,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:15,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:23:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195636340] [2022-12-13 10:23:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:15,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:23:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:15,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:23:15,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:23:15,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-13 10:23:15,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 92 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:15,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:15,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-13 10:23:15,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:16,149 INFO L130 PetriNetUnfolder]: 306/586 cut-off events. [2022-12-13 10:23:16,149 INFO L131 PetriNetUnfolder]: For 12647/12705 co-relation queries the response was YES. [2022-12-13 10:23:16,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 586 events. 306/586 cut-off events. For 12647/12705 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2869 event pairs, 112 based on Foata normal form. 8/594 useless extension candidates. Maximal degree in co-relation 4754. Up to 574 conditions per place. [2022-12-13 10:23:16,155 INFO L137 encePairwiseOnDemand]: 37/41 looper letters, 93 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2022-12-13 10:23:16,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 1666 flow [2022-12-13 10:23:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:23:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:23:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-13 10:23:16,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2022-12-13 10:23:16,156 INFO L175 Difference]: Start difference. First operand has 100 places, 92 transitions, 1455 flow. Second operand 3 states and 50 transitions. [2022-12-13 10:23:16,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 1666 flow [2022-12-13 10:23:16,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 1583 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 10:23:16,183 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 1328 flow [2022-12-13 10:23:16,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2022-12-13 10:23:16,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 77 predicate places. [2022-12-13 10:23:16,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:16,184 INFO L89 Accepts]: Start accepts. Operand has 97 places, 91 transitions, 1328 flow [2022-12-13 10:23:16,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:16,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:16,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 91 transitions, 1328 flow [2022-12-13 10:23:16,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 91 transitions, 1328 flow [2022-12-13 10:23:16,223 INFO L130 PetriNetUnfolder]: 78/248 cut-off events. [2022-12-13 10:23:16,223 INFO L131 PetriNetUnfolder]: For 4671/4705 co-relation queries the response was YES. [2022-12-13 10:23:16,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 248 events. 78/248 cut-off events. For 4671/4705 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1408 event pairs, 3 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 1728. Up to 101 conditions per place. [2022-12-13 10:23:16,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 91 transitions, 1328 flow [2022-12-13 10:23:16,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 10:23:16,227 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:16,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 10:23:16,228 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 1328 flow [2022-12-13 10:23:16,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:16,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:16,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:16,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 10:23:16,228 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1429921762, now seen corresponding path program 1 times [2022-12-13 10:23:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:16,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610451070] [2022-12-13 10:23:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:16,252 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-13 10:23:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:16,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610451070] [2022-12-13 10:23:16,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610451070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:16,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:16,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:23:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230738150] [2022-12-13 10:23:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:16,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:23:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:16,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:23:16,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:23:16,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 10:23:16,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 1328 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-13 10:23:16,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:16,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 10:23:16,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:16,442 INFO L130 PetriNetUnfolder]: 317/604 cut-off events. [2022-12-13 10:23:16,442 INFO L131 PetriNetUnfolder]: For 11443/11443 co-relation queries the response was YES. [2022-12-13 10:23:16,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4864 conditions, 604 events. 317/604 cut-off events. For 11443/11443 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2957 event pairs, 107 based on Foata normal form. 4/608 useless extension candidates. Maximal degree in co-relation 4501. Up to 541 conditions per place. [2022-12-13 10:23:16,448 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 78 selfloop transitions, 17 changer transitions 0/95 dead transitions. [2022-12-13 10:23:16,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 1596 flow [2022-12-13 10:23:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:23:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:23:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 10:23:16,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 10:23:16,449 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 1328 flow. Second operand 3 states and 45 transitions. [2022-12-13 10:23:16,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 1596 flow [2022-12-13 10:23:16,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 1592 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:23:16,476 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 1413 flow [2022-12-13 10:23:16,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1413, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2022-12-13 10:23:16,477 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 78 predicate places. [2022-12-13 10:23:16,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:16,477 INFO L89 Accepts]: Start accepts. Operand has 98 places, 92 transitions, 1413 flow [2022-12-13 10:23:16,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:16,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:16,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 92 transitions, 1413 flow [2022-12-13 10:23:16,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 92 transitions, 1413 flow [2022-12-13 10:23:16,515 INFO L130 PetriNetUnfolder]: 79/249 cut-off events. [2022-12-13 10:23:16,515 INFO L131 PetriNetUnfolder]: For 5270/5298 co-relation queries the response was YES. [2022-12-13 10:23:16,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 249 events. 79/249 cut-off events. For 5270/5298 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1411 event pairs, 4 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1840. Up to 104 conditions per place. [2022-12-13 10:23:16,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 92 transitions, 1413 flow [2022-12-13 10:23:16,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 10:23:16,527 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:16,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 10:23:16,527 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 1413 flow [2022-12-13 10:23:16,527 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-13 10:23:16,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:16,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:16,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 10:23:16,528 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1664190046, now seen corresponding path program 1 times [2022-12-13 10:23:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668905032] [2022-12-13 10:23:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:16,563 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-13 10:23:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:16,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668905032] [2022-12-13 10:23:16,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668905032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:16,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:16,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607683726] [2022-12-13 10:23:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:23:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:16,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:23:16,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:23:16,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 10:23:16,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 1413 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-13 10:23:16,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:16,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 10:23:16,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:16,780 INFO L130 PetriNetUnfolder]: 310/583 cut-off events. [2022-12-13 10:23:16,780 INFO L131 PetriNetUnfolder]: For 12044/12044 co-relation queries the response was YES. [2022-12-13 10:23:16,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4835 conditions, 583 events. 310/583 cut-off events. For 12044/12044 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2807 event pairs, 88 based on Foata normal form. 6/589 useless extension candidates. Maximal degree in co-relation 4469. Up to 474 conditions per place. [2022-12-13 10:23:16,786 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 87 selfloop transitions, 23 changer transitions 0/110 dead transitions. [2022-12-13 10:23:16,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 1825 flow [2022-12-13 10:23:16,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:23:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:23:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-13 10:23:16,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3625 [2022-12-13 10:23:16,787 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 1413 flow. Second operand 4 states and 58 transitions. [2022-12-13 10:23:16,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 1825 flow [2022-12-13 10:23:16,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 110 transitions, 1790 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 10:23:16,817 INFO L231 Difference]: Finished difference. Result has 101 places, 92 transitions, 1441 flow [2022-12-13 10:23:16,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1441, PETRI_PLACES=101, PETRI_TRANSITIONS=92} [2022-12-13 10:23:16,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 81 predicate places. [2022-12-13 10:23:16,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:16,818 INFO L89 Accepts]: Start accepts. Operand has 101 places, 92 transitions, 1441 flow [2022-12-13 10:23:16,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:16,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:16,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 92 transitions, 1441 flow [2022-12-13 10:23:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 92 transitions, 1441 flow [2022-12-13 10:23:16,856 INFO L130 PetriNetUnfolder]: 79/238 cut-off events. [2022-12-13 10:23:16,856 INFO L131 PetriNetUnfolder]: For 5170/5204 co-relation queries the response was YES. [2022-12-13 10:23:16,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 238 events. 79/238 cut-off events. For 5170/5204 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1295 event pairs, 3 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 1821. Up to 101 conditions per place. [2022-12-13 10:23:16,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 92 transitions, 1441 flow [2022-12-13 10:23:16,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 10:23:16,861 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:16,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 10:23:16,862 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 1441 flow [2022-12-13 10:23:16,862 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-13 10:23:16,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:16,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:16,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 10:23:16,863 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:16,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash -415548917, now seen corresponding path program 1 times [2022-12-13 10:23:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:16,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347201697] [2022-12-13 10:23:16,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:16,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:17,122 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-13 10:23:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347201697] [2022-12-13 10:23:17,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347201697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:23:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399837736] [2022-12-13 10:23:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:17,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:23:17,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:23:17,125 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-13 10:23:17,127 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-13 10:23:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:17,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 10:23:17,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:23:17,334 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-13 10:23:17,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:23:17,440 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-13 10:23:17,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399837736] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:23:17,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:23:17,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:23:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894513109] [2022-12-13 10:23:17,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:23:17,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:23:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:17,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:23:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:23:17,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 10:23:17,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 1441 flow. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:17,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:17,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 10:23:17,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:17,807 INFO L130 PetriNetUnfolder]: 327/623 cut-off events. [2022-12-13 10:23:17,807 INFO L131 PetriNetUnfolder]: For 13219/13273 co-relation queries the response was YES. [2022-12-13 10:23:17,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5329 conditions, 623 events. 327/623 cut-off events. For 13219/13273 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3098 event pairs, 30 based on Foata normal form. 2/625 useless extension candidates. Maximal degree in co-relation 5110. Up to 562 conditions per place. [2022-12-13 10:23:17,813 INFO L137 encePairwiseOnDemand]: 16/40 looper letters, 73 selfloop transitions, 34 changer transitions 5/113 dead transitions. [2022-12-13 10:23:17,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 113 transitions, 1942 flow [2022-12-13 10:23:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:23:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:23:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-13 10:23:17,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22142857142857142 [2022-12-13 10:23:17,815 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 1441 flow. Second operand 7 states and 62 transitions. [2022-12-13 10:23:17,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 113 transitions, 1942 flow [2022-12-13 10:23:17,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 113 transitions, 1896 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:17,846 INFO L231 Difference]: Finished difference. Result has 107 places, 104 transitions, 1726 flow [2022-12-13 10:23:17,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1726, PETRI_PLACES=107, PETRI_TRANSITIONS=104} [2022-12-13 10:23:17,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 87 predicate places. [2022-12-13 10:23:17,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:17,847 INFO L89 Accepts]: Start accepts. Operand has 107 places, 104 transitions, 1726 flow [2022-12-13 10:23:17,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:17,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:17,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 104 transitions, 1726 flow [2022-12-13 10:23:17,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 104 transitions, 1726 flow [2022-12-13 10:23:17,889 INFO L130 PetriNetUnfolder]: 85/252 cut-off events. [2022-12-13 10:23:17,889 INFO L131 PetriNetUnfolder]: For 6206/6233 co-relation queries the response was YES. [2022-12-13 10:23:17,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 252 events. 85/252 cut-off events. For 6206/6233 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1386 event pairs, 3 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 2110. Up to 111 conditions per place. [2022-12-13 10:23:17,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 104 transitions, 1726 flow [2022-12-13 10:23:17,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 10:23:21,837 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:23:21,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3991 [2022-12-13 10:23:21,838 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 1813 flow [2022-12-13 10:23:21,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:21,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:21,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:21,851 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-13 10:23:22,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:23:22,044 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:22,044 INFO L85 PathProgramCache]: Analyzing trace with hash -311388129, now seen corresponding path program 1 times [2022-12-13 10:23:22,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:22,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461821302] [2022-12-13 10:23:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:22,243 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-13 10:23:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:22,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461821302] [2022-12-13 10:23:22,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461821302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:22,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:22,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002115522] [2022-12-13 10:23:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:22,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:22,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:22,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-13 10:23:22,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 1813 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:22,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:22,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-13 10:23:22,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:22,583 INFO L130 PetriNetUnfolder]: 338/639 cut-off events. [2022-12-13 10:23:22,583 INFO L131 PetriNetUnfolder]: For 15667/15721 co-relation queries the response was YES. [2022-12-13 10:23:22,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5825 conditions, 639 events. 338/639 cut-off events. For 15667/15721 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3174 event pairs, 26 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 5732. Up to 606 conditions per place. [2022-12-13 10:23:22,590 INFO L137 encePairwiseOnDemand]: 23/46 looper letters, 94 selfloop transitions, 23 changer transitions 5/123 dead transitions. [2022-12-13 10:23:22,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 123 transitions, 2309 flow [2022-12-13 10:23:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 10:23:22,591 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2572463768115942 [2022-12-13 10:23:22,591 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 1813 flow. Second operand 6 states and 71 transitions. [2022-12-13 10:23:22,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 123 transitions, 2309 flow [2022-12-13 10:23:22,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 123 transitions, 2069 flow, removed 111 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:22,637 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 1788 flow [2022-12-13 10:23:22,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1788, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2022-12-13 10:23:22,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 90 predicate places. [2022-12-13 10:23:22,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:22,637 INFO L89 Accepts]: Start accepts. Operand has 110 places, 108 transitions, 1788 flow [2022-12-13 10:23:22,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:22,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:22,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 108 transitions, 1788 flow [2022-12-13 10:23:22,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 108 transitions, 1788 flow [2022-12-13 10:23:22,682 INFO L130 PetriNetUnfolder]: 88/265 cut-off events. [2022-12-13 10:23:22,683 INFO L131 PetriNetUnfolder]: For 6687/6715 co-relation queries the response was YES. [2022-12-13 10:23:22,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 265 events. 88/265 cut-off events. For 6687/6715 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1506 event pairs, 3 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 2162. Up to 114 conditions per place. [2022-12-13 10:23:22,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 108 transitions, 1788 flow [2022-12-13 10:23:22,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 10:23:22,696 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:23:22,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:23:24,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [911] $Ultimate##0-->L44-5: Formula: (and (<= v_~f1_2~0_505 2147483647) (<= 0 (+ v_~f1_2~0_507 v_~f2_3~0_464 2147483648)) (= v_~f1_2~0_507 |v_thread1Thread1of1ForFork0_plus_#in~b#1_298|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_286| (+ v_~f2_7~0_463 v_~f1_6~0_489)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_286| (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| v_~f2_7~0_463)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_402|) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| 2147483647) (<= 0 (+ v_~f1_2~0_505 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_296| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_316| |v_thread2Thread1of1ForFork1_plus_~a#1_314|)) (= v_~f1_2~0_505 |v_thread1Thread1of1ForFork0_plus_#res#1_312|) (= (+ v_~f1_2~0_507 v_~f2_3~0_464) |v_thread1Thread1of1ForFork0_plus_#in~a#1_298|) (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_298| 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_296| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_320| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_320|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_320|)) 1 0)) (= v_~f1_2~0_505 |v_thread1Thread1of1ForFork0_minus_#in~a#1_294|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_294| |v_thread1Thread1of1ForFork0_minus_~a#1_328|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_296| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_312| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_316| |v_thread1Thread1of1ForFork0_plus_~b#1_316|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_328| |v_thread1Thread1of1ForFork0_minus_#res#1_310|) |v_thread1Thread1of1ForFork0_minus_~a#1_328|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| |v_thread2Thread1of1ForFork1_minus_#in~b#1_298|) (<= v_~f2_7~0_462 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_316| |v_thread1Thread1of1ForFork0_plus_#in~a#1_298|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_298| v_~f1_6~0_488) (= |v_thread1Thread1of1ForFork0_minus_#res#1_310| v_~f2_3~0_462) (<= 0 (+ v_~f2_7~0_463 v_~f1_6~0_489 2147483648)) (= |v_thread1Thread1of1ForFork0_~i~0#1_397| 2) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_298| |v_thread1Thread1of1ForFork0_plus_~b#1_316|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_298| |v_thread1Thread1of1ForFork0_minus_#in~b#1_296|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_310| 2147483647) (= v_~f2_7~0_462 |v_thread2Thread1of1ForFork1_minus_#res#1_304|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_320| |v_thread2Thread1of1ForFork1_minus_#in~a#1_298|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_328|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_328| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_328|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_286| |v_thread2Thread1of1ForFork1_plus_~a#1_314|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_320| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_320| |v_thread2Thread1of1ForFork1_minus_#res#1_304|)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_296| v_~f1_6~0_488) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_377|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_328| |v_thread1Thread1of1ForFork0_minus_#in~b#1_296|) (not (= (ite (or (<= v_~f2_3~0_464 0) (<= 0 (+ v_~f1_2~0_507 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_316| |v_thread2Thread1of1ForFork1_plus_#in~b#1_290|) (< 1 v_~n_0~0_279) (= |v_thread2Thread1of1ForFork1_minus_~b#1_320| |v_thread2Thread1of1ForFork1_minus_#in~b#1_298|)) InVars {~f1_2~0=v_~f1_2~0_507, ~f2_3~0=v_~f2_3~0_464, ~n_0~0=v_~n_0~0_279, ~f2_7~0=v_~f2_7~0_463, ~f1_6~0=v_~f1_6~0_489} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_239|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_294|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_268|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_314|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_298|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_304|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_377|, ~f1_6~0=v_~f1_6~0_488, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_247|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_320|, ~f1_2~0=v_~f1_2~0_505, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_250|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_298|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_296|, ~n_0~0=v_~n_0~0_279, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_316|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_402|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_298|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_286|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_310|, ~f2_3~0=v_~f2_3~0_462, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_316|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_320|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_316|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_290|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_296|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_328|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_397|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_328|, ~f2_7~0=v_~f2_7~0_462, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_312|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_298|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_247|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [923] L54-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#res#1_336| v_~f2_3~0_502) (= v_~f1_2~0_545 |v_thread1Thread1of1ForFork0_minus_#in~a#1_320|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_354| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_354| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_354|))) 1 0) 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_92|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_396| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_354|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_354| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_354|))) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_92| 0) (= |v_thread1Thread1of1ForFork0_plus_#res#1_338| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_342| |v_thread1Thread1of1ForFork0_plus_~b#1_342|)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_381| v_~n_0~0_293)) (<= v_~f1_2~0_545 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_396| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_428|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_320| |v_thread1Thread1of1ForFork0_minus_~a#1_354|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_354| |v_thread1Thread1of1ForFork0_minus_#res#1_336|) |v_thread1Thread1of1ForFork0_minus_~a#1_354|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_354| |v_thread1Thread1of1ForFork0_minus_#in~b#1_322|) (= v_~f1_2~0_545 |v_thread1Thread1of1ForFork0_plus_#res#1_338|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_324| v_~f2_3~0_503) (< |v_thread1Thread1of1ForFork0_~i~0#1_434| v_~n_0~0_293) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_336| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_322| v_~f2_3~0_503) (= v_~f1_2~0_546 |v_thread1Thread1of1ForFork0_plus_#in~a#1_324|) (<= 0 (+ v_~f1_2~0_545 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_434| 1) |v_thread1Thread1of1ForFork0_~i~0#1_433|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_342| |v_thread1Thread1of1ForFork0_plus_#in~a#1_324|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_324| |v_thread1Thread1of1ForFork0_plus_~b#1_342|) (= (ite (< 0 v_~f1_6~0_494) 1 0) v_~l_8~0_132)) InVars {~f1_2~0=v_~f1_2~0_546, ~f2_3~0=v_~f2_3~0_503, ~n_0~0=v_~n_0~0_293, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_434|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_381|, ~f1_6~0=v_~f1_6~0_494} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_336|, ~f2_3~0=v_~f2_3~0_502, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_342|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_320|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_294|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_92|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_342|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_324|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_381|, ~f1_6~0=v_~f1_6~0_494, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_322|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_396|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_92|, ~f1_2~0=v_~f1_2~0_545, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_276|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_354|, ~n_0~0=v_~n_0~0_293, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_433|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_286|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_354|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_428|, ~l_8~0=v_~l_8~0_132, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_338|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_324|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~l_8~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:23:24,647 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:23:24,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2010 [2022-12-13 10:23:24,648 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 1850 flow [2022-12-13 10:23:24,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:24,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:24,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:24,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 10:23:24,648 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash -576768279, now seen corresponding path program 2 times [2022-12-13 10:23:24,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:24,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513509150] [2022-12-13 10:23:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:23:24,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:24,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513509150] [2022-12-13 10:23:24,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513509150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:24,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:24,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:23:24,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872672351] [2022-12-13 10:23:24,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:24,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:23:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:24,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:23:24,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:23:24,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 10:23:24,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 1850 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:24,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:24,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 10:23:24,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:25,289 INFO L130 PetriNetUnfolder]: 334/627 cut-off events. [2022-12-13 10:23:25,290 INFO L131 PetriNetUnfolder]: For 16182/16242 co-relation queries the response was YES. [2022-12-13 10:23:25,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 627 events. 334/627 cut-off events. For 16182/16242 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3086 event pairs, 26 based on Foata normal form. 3/630 useless extension candidates. Maximal degree in co-relation 5482. Up to 604 conditions per place. [2022-12-13 10:23:25,296 INFO L137 encePairwiseOnDemand]: 25/49 looper letters, 89 selfloop transitions, 22 changer transitions 5/117 dead transitions. [2022-12-13 10:23:25,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 117 transitions, 2046 flow [2022-12-13 10:23:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-13 10:23:25,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22789115646258504 [2022-12-13 10:23:25,297 INFO L175 Difference]: Start difference. First operand has 109 places, 108 transitions, 1850 flow. Second operand 6 states and 67 transitions. [2022-12-13 10:23:25,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 117 transitions, 2046 flow [2022-12-13 10:23:25,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 117 transitions, 1940 flow, removed 43 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:25,336 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 1730 flow [2022-12-13 10:23:25,336 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1730, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2022-12-13 10:23:25,336 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 93 predicate places. [2022-12-13 10:23:25,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:25,336 INFO L89 Accepts]: Start accepts. Operand has 113 places, 107 transitions, 1730 flow [2022-12-13 10:23:25,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:25,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:25,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 107 transitions, 1730 flow [2022-12-13 10:23:25,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 107 transitions, 1730 flow [2022-12-13 10:23:25,372 INFO L130 PetriNetUnfolder]: 87/262 cut-off events. [2022-12-13 10:23:25,372 INFO L131 PetriNetUnfolder]: For 6523/6552 co-relation queries the response was YES. [2022-12-13 10:23:25,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 262 events. 87/262 cut-off events. For 6523/6552 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1474 event pairs, 3 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 2114. Up to 112 conditions per place. [2022-12-13 10:23:25,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 107 transitions, 1730 flow [2022-12-13 10:23:25,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-13 10:23:25,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [911] $Ultimate##0-->L44-5: Formula: (and (<= v_~f1_2~0_505 2147483647) (<= 0 (+ v_~f1_2~0_507 v_~f2_3~0_464 2147483648)) (= v_~f1_2~0_507 |v_thread1Thread1of1ForFork0_plus_#in~b#1_298|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_286| (+ v_~f2_7~0_463 v_~f1_6~0_489)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_286| (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| v_~f2_7~0_463)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_402|) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| 2147483647) (<= 0 (+ v_~f1_2~0_505 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_296| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_316| |v_thread2Thread1of1ForFork1_plus_~a#1_314|)) (= v_~f1_2~0_505 |v_thread1Thread1of1ForFork0_plus_#res#1_312|) (= (+ v_~f1_2~0_507 v_~f2_3~0_464) |v_thread1Thread1of1ForFork0_plus_#in~a#1_298|) (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_298| 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_296| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_320| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_320|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_320|)) 1 0)) (= v_~f1_2~0_505 |v_thread1Thread1of1ForFork0_minus_#in~a#1_294|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_294| |v_thread1Thread1of1ForFork0_minus_~a#1_328|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_296| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_312| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_316| |v_thread1Thread1of1ForFork0_plus_~b#1_316|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_328| |v_thread1Thread1of1ForFork0_minus_#res#1_310|) |v_thread1Thread1of1ForFork0_minus_~a#1_328|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| |v_thread2Thread1of1ForFork1_minus_#in~b#1_298|) (<= v_~f2_7~0_462 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_316| |v_thread1Thread1of1ForFork0_plus_#in~a#1_298|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_298| v_~f1_6~0_488) (= |v_thread1Thread1of1ForFork0_minus_#res#1_310| v_~f2_3~0_462) (<= 0 (+ v_~f2_7~0_463 v_~f1_6~0_489 2147483648)) (= |v_thread1Thread1of1ForFork0_~i~0#1_397| 2) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_298| |v_thread1Thread1of1ForFork0_plus_~b#1_316|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_298| |v_thread1Thread1of1ForFork0_minus_#in~b#1_296|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_310| 2147483647) (= v_~f2_7~0_462 |v_thread2Thread1of1ForFork1_minus_#res#1_304|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_320| |v_thread2Thread1of1ForFork1_minus_#in~a#1_298|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_328|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_328| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_328|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_286| |v_thread2Thread1of1ForFork1_plus_~a#1_314|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_320| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_320| |v_thread2Thread1of1ForFork1_minus_#res#1_304|)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_290| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_296| v_~f1_6~0_488) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_377|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_328| |v_thread1Thread1of1ForFork0_minus_#in~b#1_296|) (not (= (ite (or (<= v_~f2_3~0_464 0) (<= 0 (+ v_~f1_2~0_507 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_316| |v_thread2Thread1of1ForFork1_plus_#in~b#1_290|) (< 1 v_~n_0~0_279) (= |v_thread2Thread1of1ForFork1_minus_~b#1_320| |v_thread2Thread1of1ForFork1_minus_#in~b#1_298|)) InVars {~f1_2~0=v_~f1_2~0_507, ~f2_3~0=v_~f2_3~0_464, ~n_0~0=v_~n_0~0_279, ~f2_7~0=v_~f2_7~0_463, ~f1_6~0=v_~f1_6~0_489} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_239|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_294|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_268|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_314|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_298|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_304|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_377|, ~f1_6~0=v_~f1_6~0_488, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_247|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_320|, ~f1_2~0=v_~f1_2~0_505, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_250|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_298|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_296|, ~n_0~0=v_~n_0~0_279, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_316|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_402|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_298|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_286|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_310|, ~f2_3~0=v_~f2_3~0_462, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_316|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_320|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_316|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_290|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_296|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_328|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_397|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_328|, ~f2_7~0=v_~f2_7~0_462, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_312|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_298|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_247|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:26,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:27,076 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:23:27,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1741 [2022-12-13 10:23:27,077 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 1729 flow [2022-12-13 10:23:27,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:27,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:27,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:27,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 10:23:27,077 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -771238483, now seen corresponding path program 1 times [2022-12-13 10:23:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:27,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707441932] [2022-12-13 10:23:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:27,116 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-13 10:23:27,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:27,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707441932] [2022-12-13 10:23:27,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707441932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:27,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:27,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:23:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567078710] [2022-12-13 10:23:27,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:27,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:23:27,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:23:27,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:23:27,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 48 [2022-12-13 10:23:27,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 1729 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:27,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:27,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 48 [2022-12-13 10:23:27,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:27,329 INFO L130 PetriNetUnfolder]: 333/621 cut-off events. [2022-12-13 10:23:27,330 INFO L131 PetriNetUnfolder]: For 15950/16010 co-relation queries the response was YES. [2022-12-13 10:23:27,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5565 conditions, 621 events. 333/621 cut-off events. For 15950/16010 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3027 event pairs, 103 based on Foata normal form. 8/629 useless extension candidates. Maximal degree in co-relation 5472. Up to 567 conditions per place. [2022-12-13 10:23:27,336 INFO L137 encePairwiseOnDemand]: 40/48 looper letters, 97 selfloop transitions, 13 changer transitions 0/111 dead transitions. [2022-12-13 10:23:27,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 111 transitions, 2022 flow [2022-12-13 10:23:27,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:23:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:23:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 10:23:27,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-13 10:23:27,338 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 1729 flow. Second operand 3 states and 57 transitions. [2022-12-13 10:23:27,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 111 transitions, 2022 flow [2022-12-13 10:23:27,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 111 transitions, 1941 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 10:23:27,366 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 1670 flow [2022-12-13 10:23:27,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1670, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2022-12-13 10:23:27,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 85 predicate places. [2022-12-13 10:23:27,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:27,366 INFO L89 Accepts]: Start accepts. Operand has 105 places, 105 transitions, 1670 flow [2022-12-13 10:23:27,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:27,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:27,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 105 transitions, 1670 flow [2022-12-13 10:23:27,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 105 transitions, 1670 flow [2022-12-13 10:23:27,401 INFO L130 PetriNetUnfolder]: 88/263 cut-off events. [2022-12-13 10:23:27,401 INFO L131 PetriNetUnfolder]: For 6267/6296 co-relation queries the response was YES. [2022-12-13 10:23:27,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 263 events. 88/263 cut-off events. For 6267/6296 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1471 event pairs, 3 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 2039. Up to 113 conditions per place. [2022-12-13 10:23:27,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 105 transitions, 1670 flow [2022-12-13 10:23:27,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-13 10:23:27,405 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:27,405 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 10:23:27,406 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 1670 flow [2022-12-13 10:23:27,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:27,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:27,406 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:27,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 10:23:27,406 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1891272560, now seen corresponding path program 1 times [2022-12-13 10:23:27,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:27,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427789028] [2022-12-13 10:23:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:27,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:27,435 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-13 10:23:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:27,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427789028] [2022-12-13 10:23:27,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427789028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:27,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:27,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:23:27,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875399554] [2022-12-13 10:23:27,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:27,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:23:27,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:27,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:23:27,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:23:27,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:23:27,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 1670 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-13 10:23:27,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:27,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:23:27,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:27,607 INFO L130 PetriNetUnfolder]: 344/639 cut-off events. [2022-12-13 10:23:27,607 INFO L131 PetriNetUnfolder]: For 15546/15546 co-relation queries the response was YES. [2022-12-13 10:23:27,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5655 conditions, 639 events. 344/639 cut-off events. For 15546/15546 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3116 event pairs, 130 based on Foata normal form. 4/643 useless extension candidates. Maximal degree in co-relation 5267. Up to 632 conditions per place. [2022-12-13 10:23:27,613 INFO L137 encePairwiseOnDemand]: 44/47 looper letters, 107 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-12-13 10:23:27,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 109 transitions, 1978 flow [2022-12-13 10:23:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:23:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:23:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 10:23:27,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36879432624113473 [2022-12-13 10:23:27,619 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 1670 flow. Second operand 3 states and 52 transitions. [2022-12-13 10:23:27,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 109 transitions, 1978 flow [2022-12-13 10:23:27,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 109 transitions, 1955 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 10:23:27,657 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 1693 flow [2022-12-13 10:23:27,657 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1693, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2022-12-13 10:23:27,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 87 predicate places. [2022-12-13 10:23:27,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:27,658 INFO L89 Accepts]: Start accepts. Operand has 107 places, 106 transitions, 1693 flow [2022-12-13 10:23:27,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:27,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:27,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 106 transitions, 1693 flow [2022-12-13 10:23:27,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 106 transitions, 1693 flow [2022-12-13 10:23:27,702 INFO L130 PetriNetUnfolder]: 90/259 cut-off events. [2022-12-13 10:23:27,703 INFO L131 PetriNetUnfolder]: For 6968/6997 co-relation queries the response was YES. [2022-12-13 10:23:27,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 259 events. 90/259 cut-off events. For 6968/6997 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1422 event pairs, 3 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 2114. Up to 116 conditions per place. [2022-12-13 10:23:27,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 106 transitions, 1693 flow [2022-12-13 10:23:27,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-13 10:23:27,707 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:27,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 10:23:27,708 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 1693 flow [2022-12-13 10:23:27,708 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-13 10:23:27,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:27,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:27,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 10:23:27,708 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1515428271, now seen corresponding path program 1 times [2022-12-13 10:23:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:27,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567444786] [2022-12-13 10:23:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:27,746 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-13 10:23:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567444786] [2022-12-13 10:23:27,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567444786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:23:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332611974] [2022-12-13 10:23:27,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:27,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:23:27,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:23:27,748 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-13 10:23:27,769 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-13 10:23:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:27,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 10:23:27,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:23:27,920 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-13 10:23:27,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:23:27,934 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-13 10:23:27,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332611974] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:23:27,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:23:27,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 10:23:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904247137] [2022-12-13 10:23:27,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:23:27,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:23:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:23:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:23:27,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 10:23:27,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 1693 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:27,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:27,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 10:23:27,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:28,151 INFO L130 PetriNetUnfolder]: 371/687 cut-off events. [2022-12-13 10:23:28,151 INFO L131 PetriNetUnfolder]: For 19319/19377 co-relation queries the response was YES. [2022-12-13 10:23:28,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6222 conditions, 687 events. 371/687 cut-off events. For 19319/19377 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3419 event pairs, 91 based on Foata normal form. 24/711 useless extension candidates. Maximal degree in co-relation 5997. Up to 561 conditions per place. [2022-12-13 10:23:28,156 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 103 selfloop transitions, 25 changer transitions 0/129 dead transitions. [2022-12-13 10:23:28,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 129 transitions, 2375 flow [2022-12-13 10:23:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:23:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:23:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 10:23:28,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3148936170212766 [2022-12-13 10:23:28,157 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 1693 flow. Second operand 5 states and 74 transitions. [2022-12-13 10:23:28,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 129 transitions, 2375 flow [2022-12-13 10:23:28,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 129 transitions, 2339 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-13 10:23:28,197 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 1942 flow [2022-12-13 10:23:28,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1657, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1942, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2022-12-13 10:23:28,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 92 predicate places. [2022-12-13 10:23:28,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:28,211 INFO L89 Accepts]: Start accepts. Operand has 112 places, 113 transitions, 1942 flow [2022-12-13 10:23:28,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:28,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:28,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 113 transitions, 1942 flow [2022-12-13 10:23:28,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 113 transitions, 1942 flow [2022-12-13 10:23:28,249 INFO L130 PetriNetUnfolder]: 97/284 cut-off events. [2022-12-13 10:23:28,249 INFO L131 PetriNetUnfolder]: For 8193/8222 co-relation queries the response was YES. [2022-12-13 10:23:28,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 284 events. 97/284 cut-off events. For 8193/8222 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1628 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 2407. Up to 123 conditions per place. [2022-12-13 10:23:28,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 113 transitions, 1942 flow [2022-12-13 10:23:28,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-13 10:23:28,252 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:28,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 10:23:28,253 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 1942 flow [2022-12-13 10:23:28,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:28,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:28,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:28,259 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-13 10:23:28,453 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,SelfDestructingSolverStorable59 [2022-12-13 10:23:28,454 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2069891048, now seen corresponding path program 1 times [2022-12-13 10:23:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:28,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666424417] [2022-12-13 10:23:28,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:28,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:23:28,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:28,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666424417] [2022-12-13 10:23:28,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666424417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:23:28,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810676108] [2022-12-13 10:23:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:28,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:23:28,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:23:28,670 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-13 10:23:28,671 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-13 10:23:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:28,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 10:23:28,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:23:28,880 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-13 10:23:28,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:23:28,978 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-13 10:23:28,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810676108] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:23:28,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:23:28,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:23:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401545195] [2022-12-13 10:23:28,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:23:28,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:23:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:28,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:23:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:23:28,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 10:23:28,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 1942 flow. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-13 10:23:28,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:28,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 10:23:28,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:29,328 INFO L130 PetriNetUnfolder]: 413/774 cut-off events. [2022-12-13 10:23:29,328 INFO L131 PetriNetUnfolder]: For 20797/20855 co-relation queries the response was YES. [2022-12-13 10:23:29,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7214 conditions, 774 events. 413/774 cut-off events. For 20797/20855 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3985 event pairs, 28 based on Foata normal form. 3/777 useless extension candidates. Maximal degree in co-relation 6733. Up to 686 conditions per place. [2022-12-13 10:23:29,336 INFO L137 encePairwiseOnDemand]: 23/47 looper letters, 100 selfloop transitions, 32 changer transitions 6/139 dead transitions. [2022-12-13 10:23:29,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 139 transitions, 2526 flow [2022-12-13 10:23:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:23:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:23:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-12-13 10:23:29,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2188449848024316 [2022-12-13 10:23:29,337 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 1942 flow. Second operand 7 states and 72 transitions. [2022-12-13 10:23:29,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 139 transitions, 2526 flow [2022-12-13 10:23:29,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 139 transitions, 2473 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-13 10:23:29,391 INFO L231 Difference]: Finished difference. Result has 119 places, 125 transitions, 2238 flow [2022-12-13 10:23:29,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2238, PETRI_PLACES=119, PETRI_TRANSITIONS=125} [2022-12-13 10:23:29,392 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 99 predicate places. [2022-12-13 10:23:29,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:29,392 INFO L89 Accepts]: Start accepts. Operand has 119 places, 125 transitions, 2238 flow [2022-12-13 10:23:29,393 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:29,393 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:29,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 125 transitions, 2238 flow [2022-12-13 10:23:29,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 125 transitions, 2238 flow [2022-12-13 10:23:29,437 INFO L130 PetriNetUnfolder]: 103/311 cut-off events. [2022-12-13 10:23:29,437 INFO L131 PetriNetUnfolder]: For 9055/9084 co-relation queries the response was YES. [2022-12-13 10:23:29,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 311 events. 103/311 cut-off events. For 9055/9084 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1865 event pairs, 3 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 2739. Up to 130 conditions per place. [2022-12-13 10:23:29,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 125 transitions, 2238 flow [2022-12-13 10:23:29,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 10:23:29,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:29,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:29,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:30,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:30,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [859] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (+ v_~f2_7~0_337 v_~f1_6~0_348))) (and (<= v_~f1_2~0_337 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| 2147483647) (= v_~f2_7~0_335 |v_thread2Thread1of1ForFork1_minus_#res#1_219|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_201| |v_thread2Thread1of1ForFork1_plus_~a#1_229|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_192| |v_thread1Thread1of1ForFork0_plus_~b#1_210|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_211| v_~f1_6~0_346) (<= 0 (+ v_~f1_2~0_336 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| v_~f1_6~0_348) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_235|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_235| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_235|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_210| |v_thread1Thread1of1ForFork0_plus_#in~a#1_192|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_206| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_210| |v_thread1Thread1of1ForFork0_plus_~b#1_210|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_192| |v_thread1Thread1of1ForFork0_minus_#in~b#1_190|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_201| .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_244| 3) (not (= (ite (or (<= 0 (+ v_~f1_2~0_337 2147483648)) (<= v_~f2_3~0_301 0)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_267|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_204| v_~f2_3~0_300) (= |v_thread2Thread1of1ForFork1_plus_#res#1_211| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_231| |v_thread2Thread1of1ForFork1_plus_~a#1_229|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_296|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_235| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_235| |v_thread2Thread1of1ForFork1_minus_#res#1_219|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_235| |v_thread2Thread1of1ForFork1_minus_#in~a#1_213|) (<= .cse0 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_231| |v_thread2Thread1of1ForFork1_plus_#in~b#1_205|) (= v_~f1_2~0_336 |v_thread1Thread1of1ForFork0_plus_#res#1_206|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_211| 2147483648)) (<= v_~f1_2~0_336 2147483647) (<= 0 (+ v_~f2_7~0_337 v_~f1_6~0_348 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_222|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_222| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_222|))) 1 0)) (= (+ v_~f1_2~0_337 |v_thread1Thread1of1ForFork0_plus_#in~b#1_192|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_192|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_222| |v_thread1Thread1of1ForFork0_minus_#res#1_204|) |v_thread1Thread1of1ForFork0_minus_~a#1_222|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_307|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_188| |v_thread1Thread1of1ForFork0_minus_~a#1_222|) (= v_~f1_2~0_336 |v_thread1Thread1of1ForFork0_minus_#in~a#1_188|) (< 2 v_~n_0~0_209) (= |v_thread2Thread1of1ForFork1_minus_~b#1_235| |v_thread2Thread1of1ForFork1_minus_#in~b#1_213|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_205| |v_thread2Thread1of1ForFork1_minus_#in~b#1_213|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_213| v_~f1_6~0_346) (= |v_thread1Thread1of1ForFork0_minus_~b#1_222| |v_thread1Thread1of1ForFork0_minus_#in~b#1_190|) (= (+ (* v_~f1_2~0_337 2) v_~f2_3~0_301) |v_thread1Thread1of1ForFork0_plus_#in~a#1_192|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_211| 2147483647))) InVars {~f1_2~0=v_~f1_2~0_337, ~f2_3~0=v_~f2_3~0_301, ~n_0~0=v_~n_0~0_209, ~f2_7~0=v_~f2_7~0_337, ~f1_6~0=v_~f1_6~0_348} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_159|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_188|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_229|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_168|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_219|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_279|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_192|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_267|, ~f1_6~0=v_~f1_6~0_346, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_167|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_235|, ~f1_2~0=v_~f1_2~0_336, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_213|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_211|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_150|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_231|, ~n_0~0=v_~n_0~0_209, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_296|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_213|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_201|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_204|, ~f2_3~0=v_~f2_3~0_300, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_210|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_235|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_210|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_205|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_307|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_190|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_264|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_222|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_244|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_222|, ~f2_7~0=v_~f2_7~0_335, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_206|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_192|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_167|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [934] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_419|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_323| v_~f1_6~0_538) (= |v_thread1Thread1of1ForFork0_#res#1.base_83| 0) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_343| |v_thread2Thread1of1ForFork1_plus_~a#1_341|) |v_thread2Thread1of1ForFork1_plus_#res#1_323|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_343| |v_thread2Thread1of1ForFork1_plus_#in~b#1_317|) (= v_~l_4~0_126 (ite (< 0 v_~f1_2~0_580) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_347| |v_thread2Thread1of1ForFork1_minus_#in~a#1_325|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_347|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_347| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_347|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_347| |v_thread2Thread1of1ForFork1_minus_#in~b#1_325|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_325| v_~f1_6~0_538) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_460| v_~n_0~0_311)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_323| 2147483647) (<= 0 (+ v_~f2_7~0_507 2147483648)) (< |v_thread2Thread1of1ForFork1_~i~1#1_418| v_~n_0~0_311) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_325| v_~f2_7~0_508) (= |v_thread2Thread1of1ForFork1_minus_~a#1_347| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_347| |v_thread2Thread1of1ForFork1_minus_#res#1_331|)) (<= v_~f2_7~0_507 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_323| 2147483648)) (= v_~f2_7~0_507 |v_thread2Thread1of1ForFork1_minus_#res#1_331|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_313| |v_thread2Thread1of1ForFork1_plus_~a#1_341|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_83| 0) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_313| v_~f1_6~0_539) (= |v_thread2Thread1of1ForFork1_~i~1#1_417| (+ |v_thread2Thread1of1ForFork1_~i~1#1_418| 1)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_317| v_~f2_7~0_508)) InVars {~f1_2~0=v_~f1_2~0_580, ~n_0~0=v_~n_0~0_311, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_460|, ~f2_7~0=v_~f2_7~0_508, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_418|, ~f1_6~0=v_~f1_6~0_539} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_313|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_266|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_83|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_347|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_341|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_331|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_391|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_417|, ~f1_6~0=v_~f1_6~0_538, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_274|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_317|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_347|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_419|, ~f1_2~0=v_~f1_2~0_580, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_325|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_323|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_343|, ~n_0~0=v_~n_0~0_311, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_460|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_325|, ~f2_7~0=v_~f2_7~0_507, ~l_4~0=v_~l_4~0_126, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_274|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_83|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:23:33,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [899] $Ultimate##0-->L44-5: Formula: (and (<= v_~f1_2~0_471 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_295| |v_thread1Thread1of1ForFork0_plus_#in~a#1_277|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_291| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_295| |v_thread1Thread1of1ForFork0_plus_~b#1_295|)) (= |v_thread2Thread1of1ForFork1_~i~1#1_349| 4) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_307| |v_thread1Thread1of1ForFork0_minus_#res#1_289|) |v_thread1Thread1of1ForFork0_minus_~a#1_307|) (= |v_thread1Thread1of1ForFork0_~i~0#1_370| 5) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_342| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_298|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_298| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_298|))) 1 0)) (= v_~f1_2~0_469 |v_thread1Thread1of1ForFork0_minus_#in~a#1_273|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_298| |v_thread2Thread1of1ForFork1_minus_#in~b#1_276|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_294| |v_thread2Thread1of1ForFork1_plus_~a#1_292|) |v_thread2Thread1of1ForFork1_plus_#res#1_274|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_277| |v_thread1Thread1of1ForFork0_plus_~b#1_295|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_264| |v_thread2Thread1of1ForFork1_plus_~a#1_292|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_274| 2147483648)) (= (+ (* v_~f1_2~0_471 2) |v_thread1Thread1of1ForFork0_plus_#in~b#1_277| v_~f2_3~0_431) |v_thread1Thread1of1ForFork0_plus_#in~a#1_277|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_274| 2147483647) (<= v_~f1_2~0_469 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_276| v_~f1_6~0_452) (= |v_thread1Thread1of1ForFork0_minus_~b#1_307| |v_thread1Thread1of1ForFork0_minus_#in~b#1_275|) (<= 0 (+ v_~f1_6~0_453 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_277| |v_thread1Thread1of1ForFork0_minus_#in~b#1_275|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_298| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_298| |v_thread2Thread1of1ForFork1_minus_#res#1_282|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_342| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|) (= v_~f2_7~0_429 |v_thread2Thread1of1ForFork1_minus_#res#1_282|) (= v_~f1_2~0_469 |v_thread1Thread1of1ForFork0_plus_#res#1_291|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_349| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_381|) (= (+ (* v_~f1_2~0_471 5) (* 3 v_~f2_3~0_431)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_277|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_298| |v_thread2Thread1of1ForFork1_minus_#in~a#1_276|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_268| |v_thread2Thread1of1ForFork1_minus_#in~b#1_276|) (<= 0 (+ v_~f1_2~0_469 2147483648)) (not (= (ite (or (<= v_~f2_3~0_431 0) (<= 0 (+ v_~f1_2~0_471 2147483648))) 1 0) 0)) (< 4 v_~n_0~0_263) (= (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_264| v_~f1_6~0_453) (* |v_thread2Thread1of1ForFork1_plus_#in~b#1_268| 2)) (= (+ (* 2 v_~f1_6~0_453) v_~f2_7~0_430) |v_thread2Thread1of1ForFork1_plus_#in~b#1_268|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_274| v_~f1_6~0_452) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_307|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_307| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_307|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_349|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_273| |v_thread1Thread1of1ForFork0_minus_~a#1_307|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_289| v_~f2_3~0_429) (= |v_thread2Thread1of1ForFork1_plus_~b#1_294| |v_thread2Thread1of1ForFork1_plus_#in~b#1_268|) (<= v_~f1_6~0_453 2147483647)) InVars {~f1_2~0=v_~f1_2~0_471, ~f2_3~0=v_~f2_3~0_431, ~n_0~0=v_~n_0~0_263, ~f2_7~0=v_~f2_7~0_430, ~f1_6~0=v_~f1_6~0_453} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_217|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_273|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_247|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_292|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_277|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_282|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_342|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_349|, ~f1_6~0=v_~f1_6~0_452, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_225|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_298|, ~f1_2~0=v_~f1_2~0_469, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_229|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_276|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_274|, ~n_0~0=v_~n_0~0_263, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_294|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_239|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_381|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_276|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_264|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_289|, ~f2_3~0=v_~f2_3~0_429, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_295|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_298|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_295|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_268|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_275|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_349|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_307|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_370|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_307|, ~f2_7~0=v_~f2_7~0_429, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_291|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_277|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_225|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:37,808 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:23:37,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8417 [2022-12-13 10:23:37,809 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 2401 flow [2022-12-13 10:23:37,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 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-13 10:23:37,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:37,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:37,818 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-13 10:23:38,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:23:38,015 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1231088837, now seen corresponding path program 1 times [2022-12-13 10:23:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:38,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666003016] [2022-12-13 10:23:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:38,205 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-13 10:23:38,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:38,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666003016] [2022-12-13 10:23:38,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666003016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:38,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:38,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801010296] [2022-12-13 10:23:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:38,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:38,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:38,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:38,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-13 10:23:38,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 2401 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:38,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:38,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-13 10:23:38,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:38,573 INFO L130 PetriNetUnfolder]: 405/754 cut-off events. [2022-12-13 10:23:38,573 INFO L131 PetriNetUnfolder]: For 22888/22962 co-relation queries the response was YES. [2022-12-13 10:23:38,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7435 conditions, 754 events. 405/754 cut-off events. For 22888/22962 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3837 event pairs, 24 based on Foata normal form. 1/755 useless extension candidates. Maximal degree in co-relation 7336. Up to 716 conditions per place. [2022-12-13 10:23:38,578 INFO L137 encePairwiseOnDemand]: 25/53 looper letters, 109 selfloop transitions, 26 changer transitions 7/143 dead transitions. [2022-12-13 10:23:38,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 143 transitions, 2908 flow [2022-12-13 10:23:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-13 10:23:38,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24213836477987422 [2022-12-13 10:23:38,579 INFO L175 Difference]: Start difference. First operand has 117 places, 124 transitions, 2401 flow. Second operand 6 states and 77 transitions. [2022-12-13 10:23:38,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 143 transitions, 2908 flow [2022-12-13 10:23:38,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 143 transitions, 2621 flow, removed 132 selfloop flow, removed 2 redundant places. [2022-12-13 10:23:38,624 INFO L231 Difference]: Finished difference. Result has 123 places, 126 transitions, 2236 flow [2022-12-13 10:23:38,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2236, PETRI_PLACES=123, PETRI_TRANSITIONS=126} [2022-12-13 10:23:38,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 103 predicate places. [2022-12-13 10:23:38,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:38,624 INFO L89 Accepts]: Start accepts. Operand has 123 places, 126 transitions, 2236 flow [2022-12-13 10:23:38,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:38,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:38,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 126 transitions, 2236 flow [2022-12-13 10:23:38,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 126 transitions, 2236 flow [2022-12-13 10:23:38,662 INFO L130 PetriNetUnfolder]: 106/306 cut-off events. [2022-12-13 10:23:38,663 INFO L131 PetriNetUnfolder]: For 9852/9887 co-relation queries the response was YES. [2022-12-13 10:23:38,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 306 events. 106/306 cut-off events. For 9852/9887 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1765 event pairs, 1 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 2745. Up to 128 conditions per place. [2022-12-13 10:23:38,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 126 transitions, 2236 flow [2022-12-13 10:23:38,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-13 10:23:38,666 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:38,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 10:23:38,667 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 2236 flow [2022-12-13 10:23:38,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:38,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:38,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:38,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 10:23:38,667 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1877943916, now seen corresponding path program 1 times [2022-12-13 10:23:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:38,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408291079] [2022-12-13 10:23:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:38,690 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-13 10:23:38,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:38,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408291079] [2022-12-13 10:23:38,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408291079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:38,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:38,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:23:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345645086] [2022-12-13 10:23:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:23:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:38,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:23:38,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:23:38,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-13 10:23:38,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 2236 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:38,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:38,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-13 10:23:38,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:38,884 INFO L130 PetriNetUnfolder]: 394/734 cut-off events. [2022-12-13 10:23:38,885 INFO L131 PetriNetUnfolder]: For 23305/23375 co-relation queries the response was YES. [2022-12-13 10:23:38,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7056 conditions, 734 events. 394/734 cut-off events. For 23305/23375 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3696 event pairs, 77 based on Foata normal form. 8/742 useless extension candidates. Maximal degree in co-relation 6954. Up to 475 conditions per place. [2022-12-13 10:23:38,890 INFO L137 encePairwiseOnDemand]: 48/52 looper letters, 126 selfloop transitions, 11 changer transitions 2/140 dead transitions. [2022-12-13 10:23:38,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 140 transitions, 2727 flow [2022-12-13 10:23:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:23:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:23:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 10:23:38,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391025641025641 [2022-12-13 10:23:38,892 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 2236 flow. Second operand 3 states and 61 transitions. [2022-12-13 10:23:38,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 140 transitions, 2727 flow [2022-12-13 10:23:38,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 140 transitions, 2612 flow, removed 35 selfloop flow, removed 4 redundant places. [2022-12-13 10:23:38,938 INFO L231 Difference]: Finished difference. Result has 119 places, 122 transitions, 2064 flow [2022-12-13 10:23:38,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2064, PETRI_PLACES=119, PETRI_TRANSITIONS=122} [2022-12-13 10:23:38,938 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 99 predicate places. [2022-12-13 10:23:38,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:38,938 INFO L89 Accepts]: Start accepts. Operand has 119 places, 122 transitions, 2064 flow [2022-12-13 10:23:38,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:38,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:38,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 122 transitions, 2064 flow [2022-12-13 10:23:38,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 122 transitions, 2064 flow [2022-12-13 10:23:38,975 INFO L130 PetriNetUnfolder]: 104/306 cut-off events. [2022-12-13 10:23:38,976 INFO L131 PetriNetUnfolder]: For 9624/9655 co-relation queries the response was YES. [2022-12-13 10:23:38,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 306 events. 104/306 cut-off events. For 9624/9655 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1778 event pairs, 3 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 2569. Up to 126 conditions per place. [2022-12-13 10:23:38,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 122 transitions, 2064 flow [2022-12-13 10:23:38,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-13 10:23:38,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [939] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_323| |v_thread2Thread1of1ForFork1_plus_~a#1_351|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_341| |v_thread1Thread1of1ForFork0_minus_~a#1_375|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_359| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_363| |v_thread1Thread1of1ForFork0_plus_~b#1_363|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_327| |v_thread2Thread1of1ForFork1_minus_#in~b#1_335|) (= v_~f2_7~0_523 |v_thread2Thread1of1ForFork1_minus_#res#1_341|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_333| 2147483647) (<= 0 (+ v_~f1_6~0_556 2147483648)) (= (+ (* 3 v_~f2_3~0_537) (* v_~f1_2~0_591 5)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_345|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_333| v_~f1_6~0_554) (= (+ (* 3 v_~f2_7~0_525) (* 5 v_~f1_6~0_556)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_323|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_375| |v_thread1Thread1of1ForFork0_minus_#res#1_357|) |v_thread1Thread1of1ForFork0_minus_~a#1_375|) (not (= (ite (or (<= v_~f2_3~0_537 0) (<= 0 (+ v_~f1_2~0_591 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_466| 5) (= |v_thread2Thread1of1ForFork1_plus_~b#1_353| |v_thread2Thread1of1ForFork1_plus_#in~b#1_327|) (< 4 v_~n_0~0_317) (<= v_~f1_2~0_590 2147483647) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_353| |v_thread2Thread1of1ForFork1_plus_~a#1_351|) |v_thread2Thread1of1ForFork1_plus_#res#1_333|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_363| |v_thread1Thread1of1ForFork0_plus_#in~a#1_345|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_357| v_~f2_3~0_536) (= v_~f1_2~0_590 |v_thread1Thread1of1ForFork0_plus_#res#1_359|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_375| |v_thread1Thread1of1ForFork0_minus_#in~b#1_343|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_375|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_375| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_375|))) 1 0)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_333| 2147483648)) (<= v_~f1_2~0_591 2147483647) (<= 0 (+ v_~f1_2~0_590 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_345| |v_thread1Thread1of1ForFork0_minus_#in~b#1_343|) (= v_~f1_2~0_590 |v_thread1Thread1of1ForFork0_minus_#in~a#1_341|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_401| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_357| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_357|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_357|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_345| |v_thread1Thread1of1ForFork0_plus_~b#1_363|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_449|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_357| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_357| |v_thread2Thread1of1ForFork1_minus_#res#1_341|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_357| |v_thread2Thread1of1ForFork1_minus_#in~b#1_335|) (<= v_~f1_6~0_556 2147483647) (= (+ (* 2 v_~f1_6~0_556) |v_thread2Thread1of1ForFork1_minus_#in~b#1_335| v_~f2_7~0_525) |v_thread2Thread1of1ForFork1_plus_#in~a#1_323|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_335| v_~f1_6~0_554) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_401| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_429|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_357| |v_thread2Thread1of1ForFork1_minus_#in~a#1_335|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_429|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_345| (* v_~f1_2~0_591 2) v_~f2_3~0_537) |v_thread1Thread1of1ForFork0_plus_#in~a#1_345|)) InVars {~f1_2~0=v_~f1_2~0_591, ~f2_3~0=v_~f2_3~0_537, ~n_0~0=v_~n_0~0_317, ~f2_7~0=v_~f2_7~0_525, ~f1_6~0=v_~f1_6~0_556} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_276|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_341|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_351|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_315|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_341|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_401|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_345|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_429|, ~f1_6~0=v_~f1_6~0_554, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_284|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_357|, ~f1_2~0=v_~f1_2~0_590, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_335|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_333|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_297|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_353|, ~n_0~0=v_~n_0~0_317, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_307|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_449|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_335|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_323|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_357|, ~f2_3~0=v_~f2_3~0_536, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_363|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_357|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_363|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_327|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_429|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_343|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_375|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_466|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_375|, ~f2_7~0=v_~f2_7~0_523, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_359|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_345|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_284|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:43,222 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:23:43,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4285 [2022-12-13 10:23:43,223 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 121 transitions, 2083 flow [2022-12-13 10:23:43,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:23:43,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:43,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:43,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 10:23:43,224 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:43,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:43,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1269996217, now seen corresponding path program 2 times [2022-12-13 10:23:43,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:43,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872535526] [2022-12-13 10:23:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:43,363 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-13 10:23:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:43,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872535526] [2022-12-13 10:23:43,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872535526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:43,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:43,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:43,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462020512] [2022-12-13 10:23:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:43,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:43,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:43,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:43,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-13 10:23:43,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 121 transitions, 2083 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:43,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:43,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-13 10:23:43,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:43,674 INFO L130 PetriNetUnfolder]: 389/716 cut-off events. [2022-12-13 10:23:43,675 INFO L131 PetriNetUnfolder]: For 22316/22382 co-relation queries the response was YES. [2022-12-13 10:23:43,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6848 conditions, 716 events. 389/716 cut-off events. For 22316/22382 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3520 event pairs, 24 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 6473. Up to 693 conditions per place. [2022-12-13 10:23:43,680 INFO L137 encePairwiseOnDemand]: 26/51 looper letters, 102 selfloop transitions, 24 changer transitions 5/132 dead transitions. [2022-12-13 10:23:43,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 2417 flow [2022-12-13 10:23:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 10:23:43,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22875816993464052 [2022-12-13 10:23:43,681 INFO L175 Difference]: Start difference. First operand has 118 places, 121 transitions, 2083 flow. Second operand 6 states and 70 transitions. [2022-12-13 10:23:43,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 2417 flow [2022-12-13 10:23:43,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 132 transitions, 2350 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-13 10:23:43,722 INFO L231 Difference]: Finished difference. Result has 123 places, 122 transitions, 2113 flow [2022-12-13 10:23:43,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2113, PETRI_PLACES=123, PETRI_TRANSITIONS=122} [2022-12-13 10:23:43,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 103 predicate places. [2022-12-13 10:23:43,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:43,723 INFO L89 Accepts]: Start accepts. Operand has 123 places, 122 transitions, 2113 flow [2022-12-13 10:23:43,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:43,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:43,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 122 transitions, 2113 flow [2022-12-13 10:23:43,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 2113 flow [2022-12-13 10:23:43,769 INFO L130 PetriNetUnfolder]: 104/296 cut-off events. [2022-12-13 10:23:43,770 INFO L131 PetriNetUnfolder]: For 9569/9602 co-relation queries the response was YES. [2022-12-13 10:23:43,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 296 events. 104/296 cut-off events. For 9569/9602 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1651 event pairs, 1 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 2646. Up to 126 conditions per place. [2022-12-13 10:23:43,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 2113 flow [2022-12-13 10:23:43,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 10:23:45,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:46,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [939] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_323| |v_thread2Thread1of1ForFork1_plus_~a#1_351|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_341| |v_thread1Thread1of1ForFork0_minus_~a#1_375|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_359| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_363| |v_thread1Thread1of1ForFork0_plus_~b#1_363|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_327| |v_thread2Thread1of1ForFork1_minus_#in~b#1_335|) (= v_~f2_7~0_523 |v_thread2Thread1of1ForFork1_minus_#res#1_341|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_333| 2147483647) (<= 0 (+ v_~f1_6~0_556 2147483648)) (= (+ (* 3 v_~f2_3~0_537) (* v_~f1_2~0_591 5)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_345|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_333| v_~f1_6~0_554) (= (+ (* 3 v_~f2_7~0_525) (* 5 v_~f1_6~0_556)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_323|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_375| |v_thread1Thread1of1ForFork0_minus_#res#1_357|) |v_thread1Thread1of1ForFork0_minus_~a#1_375|) (not (= (ite (or (<= v_~f2_3~0_537 0) (<= 0 (+ v_~f1_2~0_591 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_466| 5) (= |v_thread2Thread1of1ForFork1_plus_~b#1_353| |v_thread2Thread1of1ForFork1_plus_#in~b#1_327|) (< 4 v_~n_0~0_317) (<= v_~f1_2~0_590 2147483647) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_353| |v_thread2Thread1of1ForFork1_plus_~a#1_351|) |v_thread2Thread1of1ForFork1_plus_#res#1_333|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_363| |v_thread1Thread1of1ForFork0_plus_#in~a#1_345|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_357| v_~f2_3~0_536) (= v_~f1_2~0_590 |v_thread1Thread1of1ForFork0_plus_#res#1_359|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_375| |v_thread1Thread1of1ForFork0_minus_#in~b#1_343|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_375|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_375| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_375|))) 1 0)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_333| 2147483648)) (<= v_~f1_2~0_591 2147483647) (<= 0 (+ v_~f1_2~0_590 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_345| |v_thread1Thread1of1ForFork0_minus_#in~b#1_343|) (= v_~f1_2~0_590 |v_thread1Thread1of1ForFork0_minus_#in~a#1_341|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_401| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_357| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_357|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_357|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_345| |v_thread1Thread1of1ForFork0_plus_~b#1_363|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_449|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_357| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_357| |v_thread2Thread1of1ForFork1_minus_#res#1_341|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_357| |v_thread2Thread1of1ForFork1_minus_#in~b#1_335|) (<= v_~f1_6~0_556 2147483647) (= (+ (* 2 v_~f1_6~0_556) |v_thread2Thread1of1ForFork1_minus_#in~b#1_335| v_~f2_7~0_525) |v_thread2Thread1of1ForFork1_plus_#in~a#1_323|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_335| v_~f1_6~0_554) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_401| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_429|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_357| |v_thread2Thread1of1ForFork1_minus_#in~a#1_335|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_429|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_345| (* v_~f1_2~0_591 2) v_~f2_3~0_537) |v_thread1Thread1of1ForFork0_plus_#in~a#1_345|)) InVars {~f1_2~0=v_~f1_2~0_591, ~f2_3~0=v_~f2_3~0_537, ~n_0~0=v_~n_0~0_317, ~f2_7~0=v_~f2_7~0_525, ~f1_6~0=v_~f1_6~0_556} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_276|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_341|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_351|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_315|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_341|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_401|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_345|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_429|, ~f1_6~0=v_~f1_6~0_554, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_284|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_357|, ~f1_2~0=v_~f1_2~0_590, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_335|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_333|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_297|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_353|, ~n_0~0=v_~n_0~0_317, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_307|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_449|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_335|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_323|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_357|, ~f2_3~0=v_~f2_3~0_536, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_363|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_357|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_363|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_327|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_429|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_343|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_417|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_375|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_466|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_375|, ~f2_7~0=v_~f2_7~0_523, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_359|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_345|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_284|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [949] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_347| |v_thread2Thread1of1ForFork1_plus_~a#1_375|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_359| v_~f2_7~0_560) (= |v_thread2Thread1of1ForFork1_plus_~b#1_377| |v_thread2Thread1of1ForFork1_plus_#in~b#1_351|) (<= 0 (+ v_~f2_7~0_559 2147483648)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_357| 2147483648)) (= v_~l_4~0_136 (ite (< 0 v_~f1_2~0_612) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_93| 0) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_347| v_~f1_6~0_591) (= |v_thread2Thread1of1ForFork1_minus_~b#1_381| |v_thread2Thread1of1ForFork1_minus_#in~b#1_359|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_480| v_~n_0~0_329)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_357| 2147483647) (= |v_thread2Thread1of1ForFork1_~i~1#1_457| (+ |v_thread2Thread1of1ForFork1_~i~1#1_458| 1)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_359| v_~f1_6~0_590) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_381| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_381|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_381|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_425|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_351| v_~f2_7~0_560) (< |v_thread2Thread1of1ForFork1_~i~1#1_458| v_~n_0~0_329) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_425| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|) (= v_~f2_7~0_559 |v_thread2Thread1of1ForFork1_minus_#res#1_365|) (= |v_thread1Thread1of1ForFork0_#res#1.base_93| 0) (= |v_thread2Thread1of1ForFork1_plus_#res#1_357| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_377| |v_thread2Thread1of1ForFork1_plus_~a#1_375|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_381| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_381| |v_thread2Thread1of1ForFork1_minus_#res#1_365|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_381| |v_thread2Thread1of1ForFork1_minus_#in~a#1_359|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_357| v_~f1_6~0_590) (<= v_~f2_7~0_559 2147483647)) InVars {~f1_2~0=v_~f1_2~0_612, ~n_0~0=v_~n_0~0_329, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_480|, ~f2_7~0=v_~f2_7~0_560, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_458|, ~f1_6~0=v_~f1_6~0_591} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_347|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_300|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_93|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_381|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_375|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_365|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_425|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_457|, ~f1_6~0=v_~f1_6~0_590, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_308|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_351|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_381|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|, ~f1_2~0=v_~f1_2~0_612, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_359|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_357|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_377|, ~n_0~0=v_~n_0~0_329, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_480|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_359|, ~f2_7~0=v_~f2_7~0_559, ~l_4~0=v_~l_4~0_136, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_308|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_93|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:23:46,259 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:23:46,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2537 [2022-12-13 10:23:46,260 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 120 transitions, 2114 flow [2022-12-13 10:23:46,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:46,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:46,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:46,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 10:23:46,261 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash 433361776, now seen corresponding path program 1 times [2022-12-13 10:23:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848822839] [2022-12-13 10:23:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:46,292 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-13 10:23:46,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848822839] [2022-12-13 10:23:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848822839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:46,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:23:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249036890] [2022-12-13 10:23:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:46,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:23:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:23:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:23:46,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:23:46,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 2114 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-13 10:23:46,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:46,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:23:46,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:46,487 INFO L130 PetriNetUnfolder]: 383/702 cut-off events. [2022-12-13 10:23:46,487 INFO L131 PetriNetUnfolder]: For 22092/22092 co-relation queries the response was YES. [2022-12-13 10:23:46,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6724 conditions, 702 events. 383/702 cut-off events. For 22092/22092 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3418 event pairs, 132 based on Foata normal form. 4/706 useless extension candidates. Maximal degree in co-relation 6626. Up to 694 conditions per place. [2022-12-13 10:23:46,492 INFO L137 encePairwiseOnDemand]: 45/52 looper letters, 114 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2022-12-13 10:23:46,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 2278 flow [2022-12-13 10:23:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:23:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:23:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 10:23:46,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2022-12-13 10:23:46,492 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 2114 flow. Second operand 3 states and 56 transitions. [2022-12-13 10:23:46,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 2278 flow [2022-12-13 10:23:46,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 120 transitions, 2208 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-13 10:23:46,532 INFO L231 Difference]: Finished difference. Result has 115 places, 119 transitions, 1986 flow [2022-12-13 10:23:46,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1986, PETRI_PLACES=115, PETRI_TRANSITIONS=119} [2022-12-13 10:23:46,532 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 95 predicate places. [2022-12-13 10:23:46,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:46,533 INFO L89 Accepts]: Start accepts. Operand has 115 places, 119 transitions, 1986 flow [2022-12-13 10:23:46,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:46,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:46,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 119 transitions, 1986 flow [2022-12-13 10:23:46,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 119 transitions, 1986 flow [2022-12-13 10:23:46,568 INFO L130 PetriNetUnfolder]: 102/288 cut-off events. [2022-12-13 10:23:46,568 INFO L131 PetriNetUnfolder]: For 8398/8431 co-relation queries the response was YES. [2022-12-13 10:23:46,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 288 events. 102/288 cut-off events. For 8398/8431 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1623 event pairs, 1 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 2453. Up to 125 conditions per place. [2022-12-13 10:23:46,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 119 transitions, 1986 flow [2022-12-13 10:23:46,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 10:23:46,572 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:23:46,572 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 10:23:46,572 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 119 transitions, 1986 flow [2022-12-13 10:23:46,572 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-13 10:23:46,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:46,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:46,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 10:23:46,572 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1431422206, now seen corresponding path program 1 times [2022-12-13 10:23:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:46,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661252092] [2022-12-13 10:23:46,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:46,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:46,760 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-13 10:23:46,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:46,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661252092] [2022-12-13 10:23:46,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661252092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:46,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:46,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:46,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137015287] [2022-12-13 10:23:46,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:46,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:46,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:46,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 10:23:46,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 1986 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:46,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:46,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 10:23:46,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:47,153 INFO L130 PetriNetUnfolder]: 391/726 cut-off events. [2022-12-13 10:23:47,153 INFO L131 PetriNetUnfolder]: For 19732/19798 co-relation queries the response was YES. [2022-12-13 10:23:47,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6766 conditions, 726 events. 391/726 cut-off events. For 19732/19798 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3623 event pairs, 24 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 6403. Up to 693 conditions per place. [2022-12-13 10:23:47,158 INFO L137 encePairwiseOnDemand]: 24/50 looper letters, 107 selfloop transitions, 24 changer transitions 6/138 dead transitions. [2022-12-13 10:23:47,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 2475 flow [2022-12-13 10:23:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-13 10:23:47,159 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24666666666666667 [2022-12-13 10:23:47,159 INFO L175 Difference]: Start difference. First operand has 115 places, 119 transitions, 1986 flow. Second operand 6 states and 74 transitions. [2022-12-13 10:23:47,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 2475 flow [2022-12-13 10:23:47,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 138 transitions, 2465 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 10:23:47,193 INFO L231 Difference]: Finished difference. Result has 122 places, 122 transitions, 2116 flow [2022-12-13 10:23:47,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1976, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2116, PETRI_PLACES=122, PETRI_TRANSITIONS=122} [2022-12-13 10:23:47,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 102 predicate places. [2022-12-13 10:23:47,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:47,193 INFO L89 Accepts]: Start accepts. Operand has 122 places, 122 transitions, 2116 flow [2022-12-13 10:23:47,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:47,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:47,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 122 transitions, 2116 flow [2022-12-13 10:23:47,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 2116 flow [2022-12-13 10:23:47,229 INFO L130 PetriNetUnfolder]: 104/299 cut-off events. [2022-12-13 10:23:47,230 INFO L131 PetriNetUnfolder]: For 9191/9224 co-relation queries the response was YES. [2022-12-13 10:23:47,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 299 events. 104/299 cut-off events. For 9191/9224 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1676 event pairs, 1 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 2662. Up to 127 conditions per place. [2022-12-13 10:23:47,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 2116 flow [2022-12-13 10:23:47,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 10:23:47,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] $Ultimate##0-->L54-5: Formula: (and (<= 0 (+ v_~f1_6~0_568 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_379| |v_thread1Thread1of1ForFork0_minus_#in~b#1_347|) (<= 0 (+ v_~f1_2~0_598 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_343| v_~f1_6~0_566) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_335| |v_thread2Thread1of1ForFork1_minus_#in~b#1_343|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_341| v_~f1_6~0_566) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| |v_thread1Thread1of1ForFork0_minus_#in~b#1_347|) (= |v_thread1Thread1of1ForFork0_~i~0#1_470| 6) (<= v_~f1_2~0_598 2147483647) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_379| |v_thread1Thread1of1ForFork0_minus_#res#1_361|) |v_thread1Thread1of1ForFork0_minus_~a#1_379|) (not (= 0 (ite (or (<= 0 (+ v_~f1_2~0_600 2147483648)) (<= v_~f2_3~0_546 0)) 1 0))) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_341| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_365|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_365| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_365|))) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| (+ (* v_~f1_2~0_600 5) (* 3 v_~f2_3~0_546))) (= |v_thread1Thread1of1ForFork0_plus_~a#1_367| |v_thread1Thread1of1ForFork0_plus_#in~a#1_349|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_345| |v_thread1Thread1of1ForFork0_minus_~a#1_379|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_437|) (= v_~f2_7~0_535 |v_thread2Thread1of1ForFork1_minus_#res#1_349|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_361| |v_thread2Thread1of1ForFork1_plus_#in~b#1_335|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_453|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_365| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_365| |v_thread2Thread1of1ForFork1_minus_#res#1_349|)) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_379| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_379|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_379|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_437|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_341| 2147483647) (= (+ v_~f2_3~0_546 (* v_~f1_2~0_600 2) |v_thread1Thread1of1ForFork0_plus_#in~a#1_349|) (* |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| 2)) (= v_~f1_2~0_598 |v_thread1Thread1of1ForFork0_plus_#res#1_363|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_331| |v_thread2Thread1of1ForFork1_plus_~a#1_359|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_331| (+ (* 2 v_~f2_7~0_537) |v_thread2Thread1of1ForFork1_plus_#in~b#1_335| (* 3 v_~f1_6~0_568))) (= |v_thread2Thread1of1ForFork1_minus_~a#1_365| |v_thread2Thread1of1ForFork1_minus_#in~a#1_343|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_361| |v_thread2Thread1of1ForFork1_plus_~a#1_359|) |v_thread2Thread1of1ForFork1_plus_#res#1_341|) (< 5 v_~n_0~0_321) (= |v_thread2Thread1of1ForFork1_minus_~b#1_365| |v_thread2Thread1of1ForFork1_minus_#in~b#1_343|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| |v_thread1Thread1of1ForFork0_plus_~b#1_367|) (= v_~f1_2~0_598 |v_thread1Thread1of1ForFork0_minus_#in~a#1_345|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_361| v_~f2_3~0_544) (= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_367| |v_thread1Thread1of1ForFork0_plus_~b#1_367|) |v_thread1Thread1of1ForFork0_plus_#res#1_363|) (<= v_~f1_2~0_600 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_331| (+ (* 8 v_~f1_6~0_568) (* 5 v_~f2_7~0_537))) (<= v_~f1_6~0_568 2147483647)) InVars {~f1_2~0=v_~f1_2~0_600, ~f2_3~0=v_~f2_3~0_546, ~n_0~0=v_~n_0~0_321, ~f2_7~0=v_~f2_7~0_537, ~f1_6~0=v_~f1_6~0_568} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_284|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_345|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_359|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_319|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_349|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_349|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_437|, ~f1_6~0=v_~f1_6~0_566, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_292|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_365|, ~f1_2~0=v_~f1_2~0_598, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_343|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_341|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_301|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_361|, ~n_0~0=v_~n_0~0_321, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_311|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_453|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_343|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_331|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_361|, ~f2_3~0=v_~f2_3~0_544, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_367|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_365|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_367|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_335|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_437|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_347|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_379|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_470|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_379|, ~f2_7~0=v_~f2_7~0_535, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_363|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_349|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_292|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:50,559 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:23:50,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3367 [2022-12-13 10:23:50,560 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 2129 flow [2022-12-13 10:23:50,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:50,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:50,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:50,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 10:23:50,560 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2093257888, now seen corresponding path program 1 times [2022-12-13 10:23:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:50,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644025728] [2022-12-13 10:23:50,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:50,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:50,761 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-13 10:23:50,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:50,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644025728] [2022-12-13 10:23:50,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644025728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:50,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:50,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875362803] [2022-12-13 10:23:50,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:50,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:50,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:50,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:50,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-13 10:23:50,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 2129 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:50,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:50,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-13 10:23:50,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:51,119 INFO L130 PetriNetUnfolder]: 389/716 cut-off events. [2022-12-13 10:23:51,119 INFO L131 PetriNetUnfolder]: For 21349/21419 co-relation queries the response was YES. [2022-12-13 10:23:51,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6878 conditions, 716 events. 389/716 cut-off events. For 21349/21419 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3531 event pairs, 26 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 6780. Up to 693 conditions per place. [2022-12-13 10:23:51,124 INFO L137 encePairwiseOnDemand]: 25/51 looper letters, 102 selfloop transitions, 25 changer transitions 5/133 dead transitions. [2022-12-13 10:23:51,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 2469 flow [2022-12-13 10:23:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 10:23:51,125 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22875816993464052 [2022-12-13 10:23:51,125 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 2129 flow. Second operand 6 states and 70 transitions. [2022-12-13 10:23:51,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 2469 flow [2022-12-13 10:23:51,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 2366 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-13 10:23:51,165 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 2126 flow [2022-12-13 10:23:51,165 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2126, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2022-12-13 10:23:51,165 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 104 predicate places. [2022-12-13 10:23:51,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:51,166 INFO L89 Accepts]: Start accepts. Operand has 124 places, 123 transitions, 2126 flow [2022-12-13 10:23:51,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:51,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:51,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 123 transitions, 2126 flow [2022-12-13 10:23:51,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 123 transitions, 2126 flow [2022-12-13 10:23:51,211 INFO L130 PetriNetUnfolder]: 104/296 cut-off events. [2022-12-13 10:23:51,211 INFO L131 PetriNetUnfolder]: For 9297/9332 co-relation queries the response was YES. [2022-12-13 10:23:51,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 296 events. 104/296 cut-off events. For 9297/9332 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1664 event pairs, 1 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 2636. Up to 127 conditions per place. [2022-12-13 10:23:51,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 123 transitions, 2126 flow [2022-12-13 10:23:51,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 10:23:51,223 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:53,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [938] $Ultimate##0-->L54-5: Formula: (and (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_425|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_349| |v_thread2Thread1of1ForFork1_plus_~a#1_347|) |v_thread2Thread1of1ForFork1_plus_#res#1_329|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_373| |v_thread1Thread1of1ForFork0_minus_#in~b#1_341|) (<= v_~f1_2~0_587 2147483647) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_373| |v_thread1Thread1of1ForFork0_minus_#res#1_355|) |v_thread1Thread1of1ForFork0_minus_~a#1_373|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_397| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_353| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_353|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_353|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_357| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_361| |v_thread1Thread1of1ForFork0_plus_~b#1_361|)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_329| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_353| |v_thread2Thread1of1ForFork1_minus_#in~a#1_331|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_339| |v_thread1Thread1of1ForFork0_minus_~a#1_373|) (= (+ (* v_~f1_2~0_587 2) v_~f2_3~0_533) |v_thread1Thread1of1ForFork0_plus_#in~a#1_343|) (= |v_thread1Thread1of1ForFork0_~i~0#1_464| 3) (= v_~f1_2~0_586 |v_thread1Thread1of1ForFork0_minus_#in~a#1_339|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_329| v_~f1_6~0_548) (= v_~f1_2~0_586 |v_thread1Thread1of1ForFork0_plus_#res#1_357|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_343| |v_thread1Thread1of1ForFork0_plus_~b#1_361|) (<= v_~f1_6~0_550 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_319| (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_331| v_~f1_6~0_550)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_319| (+ (* 2 v_~f1_6~0_550) v_~f2_7~0_519)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_355| v_~f2_3~0_532) (<= 0 (+ v_~f1_2~0_586 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_353| |v_thread2Thread1of1ForFork1_minus_#in~b#1_331|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_343| |v_thread1Thread1of1ForFork0_minus_#in~b#1_341|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_397| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_425|) (< |v_thread2Thread1of1ForFork1_~i~1#1_425| (+ v_~n_0~0_315 1)) (<= 0 (+ v_~f1_6~0_550 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_349| |v_thread2Thread1of1ForFork1_plus_#in~b#1_323|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_329| 2147483647) (= v_~f2_7~0_517 |v_thread2Thread1of1ForFork1_minus_#res#1_337|) (<= v_~f1_2~0_586 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_353| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_353| |v_thread2Thread1of1ForFork1_minus_#res#1_337|)) (not (= (ite (or (<= 0 (+ v_~f1_2~0_587 2147483648)) (<= v_~f2_3~0_533 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_319| |v_thread2Thread1of1ForFork1_plus_~a#1_347|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_331| v_~f1_6~0_548) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_323| |v_thread2Thread1of1ForFork1_minus_#in~b#1_331|) (= (+ v_~f1_2~0_587 |v_thread1Thread1of1ForFork0_plus_#in~b#1_343|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_343|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_373| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_373|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_373|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_361| |v_thread1Thread1of1ForFork0_plus_#in~a#1_343|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_447|)) InVars {~f1_2~0=v_~f1_2~0_587, ~f2_3~0=v_~f2_3~0_533, ~n_0~0=v_~n_0~0_315, ~f2_7~0=v_~f2_7~0_519, ~f1_6~0=v_~f1_6~0_550} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_272|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_339|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_347|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_313|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_337|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_397|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_343|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_425|, ~f1_6~0=v_~f1_6~0_548, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_280|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_353|, ~f1_2~0=v_~f1_2~0_586, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_331|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_329|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_295|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_349|, ~n_0~0=v_~n_0~0_315, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_305|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_447|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_331|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_319|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_355|, ~f2_3~0=v_~f2_3~0_532, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_361|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_353|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_361|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_323|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_425|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_341|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_373|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_464|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_373|, ~f2_7~0=v_~f2_7~0_517, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_357|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_343|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_280|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [954] L44-5-->L54-5: Formula: (and (not (< |v_thread1Thread1of1ForFork0_~i~0#1_488| v_~n_0~0_335)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_470| 1) |v_thread2Thread1of1ForFork1_~i~1#1_469|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_367| 2147483648)) (< |v_thread2Thread1of1ForFork1_~i~1#1_470| v_~n_0~0_335) (= |v_thread1Thread1of1ForFork0_#res#1.base_97| 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_97| 0) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_367| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_357| |v_thread2Thread1of1ForFork1_plus_~a#1_385|) (<= 0 (+ v_~f2_7~0_575 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_369| v_~f1_6~0_606) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_435| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_357| v_~f1_6~0_607) (= |v_thread2Thread1of1ForFork1_minus_~a#1_391| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_391| |v_thread2Thread1of1ForFork1_minus_#res#1_375|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_435| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_391| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_391|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_391|)) 1 0)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_387| |v_thread2Thread1of1ForFork1_plus_~a#1_385|) |v_thread2Thread1of1ForFork1_plus_#res#1_367|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_391| |v_thread2Thread1of1ForFork1_minus_#in~a#1_369|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_367| v_~f1_6~0_606) (= (ite (< 0 v_~f1_2~0_624) 1 0) v_~l_4~0_140) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_369| v_~f2_7~0_576) (= |v_thread2Thread1of1ForFork1_plus_~b#1_387| |v_thread2Thread1of1ForFork1_plus_#in~b#1_361|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_391| |v_thread2Thread1of1ForFork1_minus_#in~b#1_369|) (= v_~f2_7~0_575 |v_thread2Thread1of1ForFork1_minus_#res#1_375|) (<= v_~f2_7~0_575 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_361| v_~f2_7~0_576)) InVars {~f1_2~0=v_~f1_2~0_624, ~n_0~0=v_~n_0~0_335, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_488|, ~f2_7~0=v_~f2_7~0_576, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_470|, ~f1_6~0=v_~f1_6~0_607} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_357|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_310|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_97|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_391|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_385|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_375|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_435|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_469|, ~f1_6~0=v_~f1_6~0_606, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_318|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_361|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_391|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463|, ~f1_2~0=v_~f1_2~0_624, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_369|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_367|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_387|, ~n_0~0=v_~n_0~0_335, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_488|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_369|, ~f2_7~0=v_~f2_7~0_575, ~l_4~0=v_~l_4~0_140, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_318|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_97|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:23:53,076 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:23:53,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1910 [2022-12-13 10:23:53,076 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 2152 flow [2022-12-13 10:23:53,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:53,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:53,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:53,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 10:23:53,077 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:53,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1348305316, now seen corresponding path program 2 times [2022-12-13 10:23:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:53,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801403101] [2022-12-13 10:23:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:53,233 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-13 10:23:53,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:53,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801403101] [2022-12-13 10:23:53,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801403101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:53,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:53,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:53,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235078173] [2022-12-13 10:23:53,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:53,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:53,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:53,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:53,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-13 10:23:53,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 2152 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:53,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:53,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-13 10:23:53,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:53,526 INFO L130 PetriNetUnfolder]: 381/698 cut-off events. [2022-12-13 10:23:53,527 INFO L131 PetriNetUnfolder]: For 21664/21742 co-relation queries the response was YES. [2022-12-13 10:23:53,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 698 events. 381/698 cut-off events. For 21664/21742 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3408 event pairs, 20 based on Foata normal form. 3/701 useless extension candidates. Maximal degree in co-relation 6588. Up to 675 conditions per place. [2022-12-13 10:23:53,532 INFO L137 encePairwiseOnDemand]: 25/53 looper letters, 100 selfloop transitions, 25 changer transitions 6/132 dead transitions. [2022-12-13 10:23:53,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 132 transitions, 2421 flow [2022-12-13 10:23:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-13 10:23:53,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22641509433962265 [2022-12-13 10:23:53,532 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 2152 flow. Second operand 6 states and 72 transitions. [2022-12-13 10:23:53,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 132 transitions, 2421 flow [2022-12-13 10:23:53,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 132 transitions, 2362 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:23:53,574 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 2099 flow [2022-12-13 10:23:53,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2099, PETRI_PLACES=125, PETRI_TRANSITIONS=121} [2022-12-13 10:23:53,574 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2022-12-13 10:23:53,574 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:53,574 INFO L89 Accepts]: Start accepts. Operand has 125 places, 121 transitions, 2099 flow [2022-12-13 10:23:53,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:53,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:53,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 121 transitions, 2099 flow [2022-12-13 10:23:53,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 2099 flow [2022-12-13 10:23:53,618 INFO L130 PetriNetUnfolder]: 103/292 cut-off events. [2022-12-13 10:23:53,619 INFO L131 PetriNetUnfolder]: For 9481/9514 co-relation queries the response was YES. [2022-12-13 10:23:53,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 292 events. 103/292 cut-off events. For 9481/9514 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1631 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 2613. Up to 126 conditions per place. [2022-12-13 10:23:53,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 121 transitions, 2099 flow [2022-12-13 10:23:53,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 10:23:53,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] and [892] L44-5-->L54-5: Formula: (and (<= v_~f1_2~0_451 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_256| v_~f2_7~0_410) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_262| 2147483647) (= v_~f1_2~0_451 |v_thread1Thread1of1ForFork0_minus_#in~a#1_263|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_264| v_~f1_6~0_432) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_358|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_334| 1) |v_thread2Thread1of1ForFork1_~i~1#1_333|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_265| v_~f2_3~0_412) (= |v_thread1Thread1of1ForFork0_~i~0#1_356| (+ |v_thread1Thread1of1ForFork0_~i~0#1_357| 1)) (<= 0 (+ v_~f2_7~0_409 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_297| |v_thread1Thread1of1ForFork0_minus_#res#1_279|) |v_thread1Thread1of1ForFork0_minus_~a#1_297|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_297| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_297|)) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_297| 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_286| |v_thread2Thread1of1ForFork1_minus_#in~a#1_264|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_262| v_~f1_6~0_432) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_267| |v_thread1Thread1of1ForFork0_plus_~b#1_285|) (= v_~f1_2~0_452 |v_thread1Thread1of1ForFork0_plus_#in~a#1_267|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_262| 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_263| |v_thread1Thread1of1ForFork0_minus_~a#1_297|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_267| v_~f2_3~0_412) (<= v_~f2_7~0_409 2147483647) (= v_~f2_7~0_409 |v_thread2Thread1of1ForFork1_minus_#res#1_270|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_252| |v_thread2Thread1of1ForFork1_plus_~a#1_280|) (= v_~f1_2~0_451 |v_thread1Thread1of1ForFork0_plus_#res#1_281|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_297| |v_thread1Thread1of1ForFork0_minus_#in~b#1_265|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_282| |v_thread2Thread1of1ForFork1_plus_~a#1_280|) |v_thread2Thread1of1ForFork1_plus_#res#1_262|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_279| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_285| |v_thread1Thread1of1ForFork0_plus_#in~a#1_267|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_297|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_297| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_297|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_339|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_281| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_285| |v_thread1Thread1of1ForFork0_plus_~b#1_285|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_339| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_371|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_252| v_~f1_6~0_433) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_286| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_286|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_286|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_286| |v_thread2Thread1of1ForFork1_minus_#in~b#1_264|) (< |v_thread2Thread1of1ForFork1_~i~1#1_334| v_~n_0~0_255) (< |v_thread1Thread1of1ForFork0_~i~0#1_357| v_~n_0~0_255) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_264| v_~f2_7~0_410) (= |v_thread1Thread1of1ForFork0_minus_#res#1_279| v_~f2_3~0_411) (<= 0 (+ v_~f1_2~0_451 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_282| |v_thread2Thread1of1ForFork1_plus_#in~b#1_256|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_286| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_286| |v_thread2Thread1of1ForFork1_minus_#res#1_270|))) InVars {~f1_2~0=v_~f1_2~0_452, ~f2_3~0=v_~f2_3~0_412, ~n_0~0=v_~n_0~0_255, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_357|, ~f2_7~0=v_~f2_7~0_410, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_334|, ~f1_6~0=v_~f1_6~0_433} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_205|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_263|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_280|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_237|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_270|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_267|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_333|, ~f1_6~0=v_~f1_6~0_432, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_213|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_286|, ~f1_2~0=v_~f1_2~0_451, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_264|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_262|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_219|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_282|, ~n_0~0=v_~n_0~0_255, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_229|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_371|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_264|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_252|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_279|, ~f2_3~0=v_~f2_3~0_411, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_285|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_286|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_285|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_256|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_358|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_265|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_339|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_297|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_356|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_297|, ~f2_7~0=v_~f2_7~0_409, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_281|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_267|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_213|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:54,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:23:55,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] $Ultimate##0-->L54-5: Formula: (and (<= 0 (+ v_~f1_6~0_568 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_379| |v_thread1Thread1of1ForFork0_minus_#in~b#1_347|) (<= 0 (+ v_~f1_2~0_598 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_343| v_~f1_6~0_566) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_335| |v_thread2Thread1of1ForFork1_minus_#in~b#1_343|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_341| v_~f1_6~0_566) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| |v_thread1Thread1of1ForFork0_minus_#in~b#1_347|) (= |v_thread1Thread1of1ForFork0_~i~0#1_470| 6) (<= v_~f1_2~0_598 2147483647) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_379| |v_thread1Thread1of1ForFork0_minus_#res#1_361|) |v_thread1Thread1of1ForFork0_minus_~a#1_379|) (not (= 0 (ite (or (<= 0 (+ v_~f1_2~0_600 2147483648)) (<= v_~f2_3~0_546 0)) 1 0))) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_341| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_365|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_365| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_365|))) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| (+ (* v_~f1_2~0_600 5) (* 3 v_~f2_3~0_546))) (= |v_thread1Thread1of1ForFork0_plus_~a#1_367| |v_thread1Thread1of1ForFork0_plus_#in~a#1_349|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_345| |v_thread1Thread1of1ForFork0_minus_~a#1_379|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_437|) (= v_~f2_7~0_535 |v_thread2Thread1of1ForFork1_minus_#res#1_349|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_361| |v_thread2Thread1of1ForFork1_plus_#in~b#1_335|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_453|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_365| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_365| |v_thread2Thread1of1ForFork1_minus_#res#1_349|)) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_379| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_379|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_379|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_437|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_341| 2147483647) (= (+ v_~f2_3~0_546 (* v_~f1_2~0_600 2) |v_thread1Thread1of1ForFork0_plus_#in~a#1_349|) (* |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| 2)) (= v_~f1_2~0_598 |v_thread1Thread1of1ForFork0_plus_#res#1_363|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_331| |v_thread2Thread1of1ForFork1_plus_~a#1_359|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_331| (+ (* 2 v_~f2_7~0_537) |v_thread2Thread1of1ForFork1_plus_#in~b#1_335| (* 3 v_~f1_6~0_568))) (= |v_thread2Thread1of1ForFork1_minus_~a#1_365| |v_thread2Thread1of1ForFork1_minus_#in~a#1_343|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_361| |v_thread2Thread1of1ForFork1_plus_~a#1_359|) |v_thread2Thread1of1ForFork1_plus_#res#1_341|) (< 5 v_~n_0~0_321) (= |v_thread2Thread1of1ForFork1_minus_~b#1_365| |v_thread2Thread1of1ForFork1_minus_#in~b#1_343|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_349| |v_thread1Thread1of1ForFork0_plus_~b#1_367|) (= v_~f1_2~0_598 |v_thread1Thread1of1ForFork0_minus_#in~a#1_345|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_361| v_~f2_3~0_544) (= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_367| |v_thread1Thread1of1ForFork0_plus_~b#1_367|) |v_thread1Thread1of1ForFork0_plus_#res#1_363|) (<= v_~f1_2~0_600 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_331| (+ (* 8 v_~f1_6~0_568) (* 5 v_~f2_7~0_537))) (<= v_~f1_6~0_568 2147483647)) InVars {~f1_2~0=v_~f1_2~0_600, ~f2_3~0=v_~f2_3~0_546, ~n_0~0=v_~n_0~0_321, ~f2_7~0=v_~f2_7~0_537, ~f1_6~0=v_~f1_6~0_568} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_284|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_345|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_359|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_319|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_349|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_349|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_437|, ~f1_6~0=v_~f1_6~0_566, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_292|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_365|, ~f1_2~0=v_~f1_2~0_598, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_343|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_341|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_301|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_361|, ~n_0~0=v_~n_0~0_321, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_311|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_453|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_343|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_331|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_361|, ~f2_3~0=v_~f2_3~0_544, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_367|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_365|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_367|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_335|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_437|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_347|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_421|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_379|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_470|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_379|, ~f2_7~0=v_~f2_7~0_535, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_363|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_349|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_292|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [961] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_383| v_~f2_7~0_598) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_375| v_~f2_7~0_598) (= |v_thread2Thread1of1ForFork1_minus_~a#1_405| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_405| |v_thread2Thread1of1ForFork1_minus_#res#1_389|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_405| |v_thread2Thread1of1ForFork1_minus_#in~a#1_383|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_371| v_~f1_6~0_629) (= |v_thread2Thread1of1ForFork1_plus_#res#1_381| v_~f1_6~0_628) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_498| v_~n_0~0_343)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_101| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_477|) (<= v_~f2_7~0_597 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_371| |v_thread2Thread1of1ForFork1_plus_~a#1_399|) (= |v_thread1Thread1of1ForFork0_#res#1.base_101| 0) (<= 0 (+ v_~f2_7~0_597 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_381| 2147483647) (= v_~f2_7~0_597 |v_thread2Thread1of1ForFork1_minus_#res#1_389|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_488| 1) |v_thread2Thread1of1ForFork1_~i~1#1_487|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_401| |v_thread2Thread1of1ForFork1_plus_~a#1_399|) |v_thread2Thread1of1ForFork1_plus_#res#1_381|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_401| |v_thread2Thread1of1ForFork1_plus_#in~b#1_375|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_405|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_405| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_405|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_381| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_405| |v_thread2Thread1of1ForFork1_minus_#in~b#1_383|) (< |v_thread2Thread1of1ForFork1_~i~1#1_488| v_~n_0~0_343) (= v_~l_4~0_144 (ite (< 0 v_~f1_2~0_638) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_383| v_~f1_6~0_628)) InVars {~f1_2~0=v_~f1_2~0_638, ~n_0~0=v_~n_0~0_343, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_498|, ~f2_7~0=v_~f2_7~0_598, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_488|, ~f1_6~0=v_~f1_6~0_629} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_371|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_324|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_101|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_405|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_399|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_389|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_487|, ~f1_6~0=v_~f1_6~0_628, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_332|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_375|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_405|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_477|, ~f1_2~0=v_~f1_2~0_638, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_383|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_381|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_401|, ~n_0~0=v_~n_0~0_343, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_498|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_383|, ~f2_7~0=v_~f2_7~0_597, ~l_4~0=v_~l_4~0_144, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_332|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_101|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:23:57,605 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:23:57,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4031 [2022-12-13 10:23:57,605 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 2121 flow [2022-12-13 10:23:57,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:57,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:23:57,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:23:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 10:23:57,606 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:23:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:23:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1690939191, now seen corresponding path program 1 times [2022-12-13 10:23:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:23:57,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644469700] [2022-12-13 10:23:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:23:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:23:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:23:57,771 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-13 10:23:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:23:57,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644469700] [2022-12-13 10:23:57,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644469700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:23:57,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:23:57,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:23:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280253828] [2022-12-13 10:23:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:23:57,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:23:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:23:57,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:23:57,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:23:57,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-13 10:23:57,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 2121 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:23:57,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:23:57,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-13 10:23:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:23:58,139 INFO L130 PetriNetUnfolder]: 383/708 cut-off events. [2022-12-13 10:23:58,139 INFO L131 PetriNetUnfolder]: For 22664/22738 co-relation queries the response was YES. [2022-12-13 10:23:58,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6893 conditions, 708 events. 383/708 cut-off events. For 22664/22738 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3494 event pairs, 24 based on Foata normal form. 3/711 useless extension candidates. Maximal degree in co-relation 6794. Up to 675 conditions per place. [2022-12-13 10:23:58,146 INFO L137 encePairwiseOnDemand]: 24/52 looper letters, 105 selfloop transitions, 24 changer transitions 7/137 dead transitions. [2022-12-13 10:23:58,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 2561 flow [2022-12-13 10:23:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:23:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:23:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 10:23:58,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24358974358974358 [2022-12-13 10:23:58,147 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 2121 flow. Second operand 6 states and 76 transitions. [2022-12-13 10:23:58,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 2561 flow [2022-12-13 10:23:58,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 2448 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 10:23:58,208 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 2068 flow [2022-12-13 10:23:58,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2068, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2022-12-13 10:23:58,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 102 predicate places. [2022-12-13 10:23:58,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:23:58,208 INFO L89 Accepts]: Start accepts. Operand has 122 places, 120 transitions, 2068 flow [2022-12-13 10:23:58,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:23:58,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:23:58,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 120 transitions, 2068 flow [2022-12-13 10:23:58,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 120 transitions, 2068 flow [2022-12-13 10:23:58,254 INFO L130 PetriNetUnfolder]: 103/291 cut-off events. [2022-12-13 10:23:58,254 INFO L131 PetriNetUnfolder]: For 9581/9612 co-relation queries the response was YES. [2022-12-13 10:23:58,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 291 events. 103/291 cut-off events. For 9581/9612 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1607 event pairs, 1 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 2636. Up to 125 conditions per place. [2022-12-13 10:23:58,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 120 transitions, 2068 flow [2022-12-13 10:23:58,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-13 10:23:58,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [953] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_357| |v_thread2Thread1of1ForFork1_minus_#in~b#1_365|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_353| |v_thread1Thread1of1ForFork0_minus_~a#1_387|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_387| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_387| |v_thread2Thread1of1ForFork1_minus_#res#1_371|)) (< |v_thread2Thread1of1ForFork1_~i~1#1_465| (+ v_~n_0~0_333 1)) (= v_~f1_2~0_618 |v_thread1Thread1of1ForFork0_minus_#in~a#1_353|) (= (+ (* 2 v_~f2_7~0_571) |v_thread2Thread1of1ForFork1_plus_#in~a#1_353| (* 3 v_~f1_6~0_602)) (* |v_thread2Thread1of1ForFork1_plus_#in~b#1_357| 2)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_365| v_~f1_6~0_600) (= |v_thread1Thread1of1ForFork0_plus_#res#1_371| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_375| |v_thread1Thread1of1ForFork0_plus_~b#1_375|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_387| |v_thread1Thread1of1ForFork0_minus_#res#1_369|) |v_thread1Thread1of1ForFork0_minus_~a#1_387|) (<= v_~f1_2~0_620 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_387| |v_thread2Thread1of1ForFork1_minus_#in~b#1_365|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_387| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_387|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_387|)) 1 0)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_363| 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_383| |v_thread2Thread1of1ForFork1_plus_~a#1_381|) |v_thread2Thread1of1ForFork1_plus_#res#1_363|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|) (not (= (ite (or (<= v_~f2_3~0_560 0) (<= 0 (+ v_~f1_2~0_620 2147483648))) 1 0) 0)) (= 7 |v_thread2Thread1of1ForFork1_~i~1#1_465|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_363| v_~f1_6~0_600) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_357| |v_thread1Thread1of1ForFork0_minus_#in~b#1_355|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_383| |v_thread2Thread1of1ForFork1_plus_#in~b#1_357|) (= (+ (* v_~f1_2~0_620 8) (* 5 v_~f2_3~0_560)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_355|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_363| 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_461|) (<= 0 (+ v_~f1_2~0_618 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_375| |v_thread1Thread1of1ForFork0_plus_#in~a#1_357|) (= (+ (* v_~f1_2~0_620 13) (* 8 v_~f2_3~0_560)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_357|) (= v_~f1_2~0_618 |v_thread1Thread1of1ForFork0_plus_#res#1_371|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_387| |v_thread1Thread1of1ForFork0_minus_#in~b#1_355|) (<= v_~f1_6~0_602 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_387| |v_thread2Thread1of1ForFork1_minus_#in~a#1_365|) (<= 0 (+ v_~f1_6~0_602 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_357| |v_thread1Thread1of1ForFork0_plus_~b#1_375|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_369| v_~f2_3~0_558) (= (+ (* 5 v_~f2_7~0_571) (* 8 v_~f1_6~0_602)) |v_thread2Thread1of1ForFork1_plus_#in~b#1_357|) (<= v_~f1_2~0_618 2147483647) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_484|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_353| |v_thread2Thread1of1ForFork1_plus_~a#1_381|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_387| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_387|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_387|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429|) (= v_~f2_7~0_569 |v_thread2Thread1of1ForFork1_minus_#res#1_371|)) InVars {~f1_2~0=v_~f1_2~0_620, ~f2_3~0=v_~f2_3~0_560, ~n_0~0=v_~n_0~0_333, ~f2_7~0=v_~f2_7~0_571, ~f1_6~0=v_~f1_6~0_602} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_306|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_353|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_381|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_327|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_371|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_357|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_465|, ~f1_6~0=v_~f1_6~0_600, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_314|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_387|, ~f1_2~0=v_~f1_2~0_618, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_365|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_363|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_309|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_383|, ~n_0~0=v_~n_0~0_333, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_319|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_461|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_365|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_353|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_369|, ~f2_3~0=v_~f2_3~0_558, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_375|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_387|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_375|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_357|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_355|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_387|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_484|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_387|, ~f2_7~0=v_~f2_7~0_569, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_371|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_357|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_314|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:02,042 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:24:02,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3835 [2022-12-13 10:24:02,043 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 2058 flow [2022-12-13 10:24:02,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:02,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:02,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:02,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 10:24:02,044 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1956319341, now seen corresponding path program 2 times [2022-12-13 10:24:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:02,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241191323] [2022-12-13 10:24:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:02,212 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-13 10:24:02,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241191323] [2022-12-13 10:24:02,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241191323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:02,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:02,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:24:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575993894] [2022-12-13 10:24:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:02,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:24:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:24:02,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:24:02,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 10:24:02,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 2058 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:02,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:02,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 10:24:02,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:02,527 INFO L130 PetriNetUnfolder]: 378/693 cut-off events. [2022-12-13 10:24:02,527 INFO L131 PetriNetUnfolder]: For 22280/22346 co-relation queries the response was YES. [2022-12-13 10:24:02,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6747 conditions, 693 events. 378/693 cut-off events. For 22280/22346 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3370 event pairs, 22 based on Foata normal form. 1/694 useless extension candidates. Maximal degree in co-relation 6652. Up to 670 conditions per place. [2022-12-13 10:24:02,532 INFO L137 encePairwiseOnDemand]: 25/50 looper letters, 100 selfloop transitions, 24 changer transitions 5/130 dead transitions. [2022-12-13 10:24:02,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 130 transitions, 2403 flow [2022-12-13 10:24:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 10:24:02,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23 [2022-12-13 10:24:02,535 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 2058 flow. Second operand 6 states and 69 transitions. [2022-12-13 10:24:02,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 130 transitions, 2403 flow [2022-12-13 10:24:02,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 130 transitions, 2271 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-13 10:24:02,575 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 2038 flow [2022-12-13 10:24:02,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2038, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2022-12-13 10:24:02,575 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 100 predicate places. [2022-12-13 10:24:02,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:02,575 INFO L89 Accepts]: Start accepts. Operand has 120 places, 120 transitions, 2038 flow [2022-12-13 10:24:02,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:02,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:02,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 120 transitions, 2038 flow [2022-12-13 10:24:02,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 2038 flow [2022-12-13 10:24:02,611 INFO L130 PetriNetUnfolder]: 102/287 cut-off events. [2022-12-13 10:24:02,611 INFO L131 PetriNetUnfolder]: For 9039/9072 co-relation queries the response was YES. [2022-12-13 10:24:02,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 287 events. 102/287 cut-off events. For 9039/9072 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1570 event pairs, 1 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 2546. Up to 124 conditions per place. [2022-12-13 10:24:02,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 120 transitions, 2038 flow [2022-12-13 10:24:02,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-13 10:24:05,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [953] $Ultimate##0-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_357| |v_thread2Thread1of1ForFork1_minus_#in~b#1_365|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_353| |v_thread1Thread1of1ForFork0_minus_~a#1_387|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_387| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_387| |v_thread2Thread1of1ForFork1_minus_#res#1_371|)) (< |v_thread2Thread1of1ForFork1_~i~1#1_465| (+ v_~n_0~0_333 1)) (= v_~f1_2~0_618 |v_thread1Thread1of1ForFork0_minus_#in~a#1_353|) (= (+ (* 2 v_~f2_7~0_571) |v_thread2Thread1of1ForFork1_plus_#in~a#1_353| (* 3 v_~f1_6~0_602)) (* |v_thread2Thread1of1ForFork1_plus_#in~b#1_357| 2)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_365| v_~f1_6~0_600) (= |v_thread1Thread1of1ForFork0_plus_#res#1_371| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_375| |v_thread1Thread1of1ForFork0_plus_~b#1_375|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_387| |v_thread1Thread1of1ForFork0_minus_#res#1_369|) |v_thread1Thread1of1ForFork0_minus_~a#1_387|) (<= v_~f1_2~0_620 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_387| |v_thread2Thread1of1ForFork1_minus_#in~b#1_365|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_387| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_387|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_387|)) 1 0)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_363| 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_383| |v_thread2Thread1of1ForFork1_plus_~a#1_381|) |v_thread2Thread1of1ForFork1_plus_#res#1_363|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|) (not (= (ite (or (<= v_~f2_3~0_560 0) (<= 0 (+ v_~f1_2~0_620 2147483648))) 1 0) 0)) (= 7 |v_thread2Thread1of1ForFork1_~i~1#1_465|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_363| v_~f1_6~0_600) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_357| |v_thread1Thread1of1ForFork0_minus_#in~b#1_355|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_383| |v_thread2Thread1of1ForFork1_plus_#in~b#1_357|) (= (+ (* v_~f1_2~0_620 8) (* 5 v_~f2_3~0_560)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_355|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_363| 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_461|) (<= 0 (+ v_~f1_2~0_618 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_375| |v_thread1Thread1of1ForFork0_plus_#in~a#1_357|) (= (+ (* v_~f1_2~0_620 13) (* 8 v_~f2_3~0_560)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_357|) (= v_~f1_2~0_618 |v_thread1Thread1of1ForFork0_plus_#res#1_371|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_387| |v_thread1Thread1of1ForFork0_minus_#in~b#1_355|) (<= v_~f1_6~0_602 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_387| |v_thread2Thread1of1ForFork1_minus_#in~a#1_365|) (<= 0 (+ v_~f1_6~0_602 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_357| |v_thread1Thread1of1ForFork0_plus_~b#1_375|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_369| v_~f2_3~0_558) (= (+ (* 5 v_~f2_7~0_571) (* 8 v_~f1_6~0_602)) |v_thread2Thread1of1ForFork1_plus_#in~b#1_357|) (<= v_~f1_2~0_618 2147483647) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_484|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_353| |v_thread2Thread1of1ForFork1_plus_~a#1_381|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_387| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_387|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_387|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429|) (= v_~f2_7~0_569 |v_thread2Thread1of1ForFork1_minus_#res#1_371|)) InVars {~f1_2~0=v_~f1_2~0_620, ~f2_3~0=v_~f2_3~0_560, ~n_0~0=v_~n_0~0_333, ~f2_7~0=v_~f2_7~0_571, ~f1_6~0=v_~f1_6~0_602} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_306|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_353|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_381|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_327|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_371|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_431|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_357|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_465|, ~f1_6~0=v_~f1_6~0_600, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_314|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_387|, ~f1_2~0=v_~f1_2~0_618, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_365|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_363|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_309|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_383|, ~n_0~0=v_~n_0~0_333, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_319|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_461|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_365|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_353|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_369|, ~f2_3~0=v_~f2_3~0_558, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_375|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_387|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_375|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_357|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_459|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_355|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_429|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_387|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_484|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_387|, ~f2_7~0=v_~f2_7~0_569, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_371|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_357|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_314|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:24:07,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [972] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_393| |v_thread2Thread1of1ForFork1_minus_#in~b#1_401|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_373| |v_thread1Thread1of1ForFork0_minus_~a#1_407|) (<= v_~f1_6~0_657 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_105| 0) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_399| 2147483647) (= v_~f1_2~0_658 |v_thread1Thread1of1ForFork0_minus_#in~a#1_373|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_391| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_395| |v_thread1Thread1of1ForFork0_plus_~b#1_395|)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_510| v_~n_0~0_353)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_105| 0) (< |v_thread2Thread1of1ForFork1_~i~1#1_507| (+ v_~n_0~0_353 1)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_510|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_419| |v_thread2Thread1of1ForFork1_plus_#in~b#1_393|) (= (ite (< 0 v_~f1_2~0_658) 1 0) v_~l_4~0_148) (= 7 |v_thread2Thread1of1ForFork1_~i~1#1_507|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_659 2147483648)) (<= v_~f2_3~0_595 0)) 1 0) 0)) (= (+ (* 8 v_~f1_6~0_657) (* 5 v_~f2_7~0_626)) |v_thread2Thread1of1ForFork1_plus_#in~b#1_393|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_423| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_423|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_423|)) 1 0)) (= (+ (* 3 v_~f1_6~0_657) |v_thread2Thread1of1ForFork1_plus_#in~a#1_389| (* 2 v_~f2_7~0_626)) (* |v_thread2Thread1of1ForFork1_plus_#in~b#1_393| 2)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_389| |v_thread2Thread1of1ForFork1_plus_~a#1_417|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_407|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_407| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_407|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_449|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_407| |v_thread1Thread1of1ForFork0_minus_#in~b#1_375|) (= v_~f2_7~0_625 |v_thread2Thread1of1ForFork1_minus_#res#1_407|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_395| |v_thread1Thread1of1ForFork0_plus_#in~a#1_377|) (= v_~f1_2~0_658 |v_thread1Thread1of1ForFork0_plus_#res#1_391|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_377| |v_thread1Thread1of1ForFork0_minus_#in~b#1_375|) (<= 0 (+ v_~f1_6~0_657 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_399| v_~f1_6~0_656) (= (+ (* 5 v_~f2_3~0_595) (* v_~f1_2~0_659 8)) |v_thread1Thread1of1ForFork0_minus_#in~b#1_375|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_401| v_~f1_6~0_656) (= |v_thread2Thread1of1ForFork1_minus_~b#1_423| |v_thread2Thread1of1ForFork1_minus_#in~b#1_401|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_449| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_481|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_377| |v_thread1Thread1of1ForFork0_plus_~b#1_395|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_389| v_~f2_3~0_594) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_407| |v_thread1Thread1of1ForFork0_minus_#res#1_389|) |v_thread1Thread1of1ForFork0_minus_~a#1_407|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_423| |v_thread2Thread1of1ForFork1_minus_#in~a#1_401|) (<= v_~f1_2~0_658 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_399| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_419| |v_thread2Thread1of1ForFork1_plus_~a#1_417|)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_399| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_495|) (<= 0 (+ v_~f1_2~0_658 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_423| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_423| |v_thread2Thread1of1ForFork1_minus_#res#1_407|)) (<= v_~f1_2~0_659 2147483647) (= (+ (* v_~f1_2~0_659 13) (* 8 v_~f2_3~0_595)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_377|)) InVars {~f1_2~0=v_~f1_2~0_659, ~f2_3~0=v_~f2_3~0_595, ~n_0~0=v_~n_0~0_353, ~f2_7~0=v_~f2_7~0_626, ~f1_6~0=v_~f1_6~0_657} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_342|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_373|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_417|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_347|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_407|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_377|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_507|, ~f1_6~0=v_~f1_6~0_656, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_350|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_423|, ~f1_2~0=v_~f1_2~0_658, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_401|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_399|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_329|, ~n_0~0=v_~n_0~0_353, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_419|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_339|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_481|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_401|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_105|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_389|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_389|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_105|, ~f2_3~0=v_~f2_3~0_594, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_395|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_423|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_395|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_393|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_495|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_375|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_449|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_407|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_510|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_407|, ~f2_7~0=v_~f2_7~0_625, ~l_4~0=v_~l_4~0_148, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_391|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_377|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_350|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:07,937 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:24:07,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5363 [2022-12-13 10:24:07,938 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 2066 flow [2022-12-13 10:24:07,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:07,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:07,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:07,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 10:24:07,938 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -375782183, now seen corresponding path program 1 times [2022-12-13 10:24:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:07,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857367836] [2022-12-13 10:24:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:07,994 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-13 10:24:07,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:07,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857367836] [2022-12-13 10:24:07,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857367836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:07,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:07,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:24:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207902707] [2022-12-13 10:24:07,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:07,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:24:07,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:07,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:24:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:24:07,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:24:07,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 2066 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-13 10:24:07,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:07,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:24:07,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:08,179 INFO L130 PetriNetUnfolder]: 381/694 cut-off events. [2022-12-13 10:24:08,180 INFO L131 PetriNetUnfolder]: For 22547/22547 co-relation queries the response was YES. [2022-12-13 10:24:08,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6647 conditions, 694 events. 381/694 cut-off events. For 22547/22547 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3317 event pairs, 105 based on Foata normal form. 6/700 useless extension candidates. Maximal degree in co-relation 6554. Up to 607 conditions per place. [2022-12-13 10:24:08,184 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 99 selfloop transitions, 24 changer transitions 1/124 dead transitions. [2022-12-13 10:24:08,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 124 transitions, 2368 flow [2022-12-13 10:24:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:24:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:24:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 10:24:08,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 10:24:08,185 INFO L175 Difference]: Start difference. First operand has 117 places, 119 transitions, 2066 flow. Second operand 3 states and 57 transitions. [2022-12-13 10:24:08,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 124 transitions, 2368 flow [2022-12-13 10:24:08,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 2313 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 10:24:08,227 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 2036 flow [2022-12-13 10:24:08,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2036, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2022-12-13 10:24:08,227 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 97 predicate places. [2022-12-13 10:24:08,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:08,227 INFO L89 Accepts]: Start accepts. Operand has 117 places, 118 transitions, 2036 flow [2022-12-13 10:24:08,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:08,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:08,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 118 transitions, 2036 flow [2022-12-13 10:24:08,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 118 transitions, 2036 flow [2022-12-13 10:24:08,264 INFO L130 PetriNetUnfolder]: 102/285 cut-off events. [2022-12-13 10:24:08,264 INFO L131 PetriNetUnfolder]: For 9904/9935 co-relation queries the response was YES. [2022-12-13 10:24:08,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 285 events. 102/285 cut-off events. For 9904/9935 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1555 event pairs, 2 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 2559. Up to 126 conditions per place. [2022-12-13 10:24:08,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 118 transitions, 2036 flow [2022-12-13 10:24:08,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-13 10:24:08,271 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:24:08,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 10:24:08,271 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 117 transitions, 2013 flow [2022-12-13 10:24:08,272 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-13 10:24:08,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:08,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:08,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 10:24:08,272 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1263285864, now seen corresponding path program 1 times [2022-12-13 10:24:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:08,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61651475] [2022-12-13 10:24:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:08,494 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-13 10:24:08,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:08,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61651475] [2022-12-13 10:24:08,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61651475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:08,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:08,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:24:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743732410] [2022-12-13 10:24:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:08,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:24:08,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:24:08,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:24:08,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-13 10:24:08,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 117 transitions, 2013 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:08,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:08,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-13 10:24:08,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:08,908 INFO L130 PetriNetUnfolder]: 386/713 cut-off events. [2022-12-13 10:24:08,909 INFO L131 PetriNetUnfolder]: For 23625/23687 co-relation queries the response was YES. [2022-12-13 10:24:08,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6955 conditions, 713 events. 386/713 cut-off events. For 23625/23687 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3529 event pairs, 26 based on Foata normal form. 1/714 useless extension candidates. Maximal degree in co-relation 6427. Up to 680 conditions per place. [2022-12-13 10:24:08,916 INFO L137 encePairwiseOnDemand]: 24/49 looper letters, 106 selfloop transitions, 23 changer transitions 6/136 dead transitions. [2022-12-13 10:24:08,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 136 transitions, 2514 flow [2022-12-13 10:24:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 10:24:08,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24829931972789115 [2022-12-13 10:24:08,917 INFO L175 Difference]: Start difference. First operand has 115 places, 117 transitions, 2013 flow. Second operand 6 states and 73 transitions. [2022-12-13 10:24:08,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 136 transitions, 2514 flow [2022-12-13 10:24:08,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 136 transitions, 2447 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 10:24:08,975 INFO L231 Difference]: Finished difference. Result has 120 places, 120 transitions, 2100 flow [2022-12-13 10:24:08,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2100, PETRI_PLACES=120, PETRI_TRANSITIONS=120} [2022-12-13 10:24:08,976 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 100 predicate places. [2022-12-13 10:24:08,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:08,976 INFO L89 Accepts]: Start accepts. Operand has 120 places, 120 transitions, 2100 flow [2022-12-13 10:24:08,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:08,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:08,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 120 transitions, 2100 flow [2022-12-13 10:24:08,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 120 transitions, 2100 flow [2022-12-13 10:24:09,028 INFO L130 PetriNetUnfolder]: 103/291 cut-off events. [2022-12-13 10:24:09,028 INFO L131 PetriNetUnfolder]: For 9580/9611 co-relation queries the response was YES. [2022-12-13 10:24:09,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2720 conditions, 291 events. 103/291 cut-off events. For 9580/9611 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1628 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 2638. Up to 127 conditions per place. [2022-12-13 10:24:09,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 120 transitions, 2100 flow [2022-12-13 10:24:09,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 10:24:09,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [968] $Ultimate##0-->L54-5: Formula: (and (<= 0 (+ v_~f1_2~0_648 2147483648)) (= v_~f2_7~0_613 |v_thread2Thread1of1ForFork1_minus_#res#1_399|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_415| |v_thread2Thread1of1ForFork1_minus_#in~a#1_393|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_391| 2147483648)) (<= v_~f1_6~0_646 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_487|) (= (+ (* 13 v_~f2_3~0_586) (* v_~f1_2~0_650 21)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_371|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_401|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_401| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_401|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_443|) (not (= (ite (or (<= v_~f2_3~0_586 0) (<= 0 (+ v_~f1_2~0_650 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_381| (+ (* v_~f2_7~0_615 13) (* 21 v_~f1_6~0_646))) (= |v_thread1Thread1of1ForFork0_plus_#res#1_385| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_389| |v_thread1Thread1of1ForFork0_plus_~b#1_389|)) (= |v_thread1Thread1of1ForFork0_~i~0#1_504| 8) (= |v_thread1Thread1of1ForFork0_minus_~b#1_401| |v_thread1Thread1of1ForFork0_minus_#in~b#1_369|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_401| |v_thread1Thread1of1ForFork0_minus_#res#1_383|) |v_thread1Thread1of1ForFork0_minus_~a#1_401|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_411| |v_thread2Thread1of1ForFork1_plus_#in~b#1_385|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_383| v_~f2_3~0_584) (<= 0 (+ v_~f1_6~0_646 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_371| |v_thread1Thread1of1ForFork0_minus_#in~b#1_369|) (<= v_~f1_2~0_650 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_385| |v_thread2Thread1of1ForFork1_minus_#in~b#1_393|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_415| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_415|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_415|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_393| v_~f1_6~0_644) (= v_~f1_2~0_648 |v_thread1Thread1of1ForFork0_plus_#res#1_385|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_415| |v_thread2Thread1of1ForFork1_minus_#in~b#1_393|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_391| v_~f1_6~0_644) (< 7 v_~n_0~0_349) (= |v_thread2Thread1of1ForFork1_~i~1#1_499| 8) (= (+ (* 5 v_~f2_3~0_586) |v_thread1Thread1of1ForFork0_plus_#in~b#1_371| (* v_~f1_2~0_650 8)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_371|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_391| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_389| |v_thread1Thread1of1ForFork0_plus_#in~a#1_371|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_381| (+ (* 8 v_~f1_6~0_646) |v_thread2Thread1of1ForFork1_plus_#in~b#1_385| (* 5 v_~f2_7~0_615))) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_381| |v_thread2Thread1of1ForFork1_plus_~a#1_409|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_415| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_415| |v_thread2Thread1of1ForFork1_minus_#res#1_399|)) (<= v_~f1_2~0_648 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_443| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_475|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_367| |v_thread1Thread1of1ForFork0_minus_~a#1_401|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_371| |v_thread1Thread1of1ForFork0_plus_~b#1_389|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_411| |v_thread2Thread1of1ForFork1_plus_~a#1_409|) |v_thread2Thread1of1ForFork1_plus_#res#1_391|) (= v_~f1_2~0_648 |v_thread1Thread1of1ForFork0_minus_#in~a#1_367|)) InVars {~f1_2~0=v_~f1_2~0_650, ~f2_3~0=v_~f2_3~0_586, ~n_0~0=v_~n_0~0_349, ~f2_7~0=v_~f2_7~0_615, ~f1_6~0=v_~f1_6~0_646} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_334|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_367|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_409|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_341|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_399|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_371|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_499|, ~f1_6~0=v_~f1_6~0_644, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_342|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_415|, ~f1_2~0=v_~f1_2~0_648, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_393|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_391|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_323|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_411|, ~n_0~0=v_~n_0~0_349, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_333|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_475|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_393|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_381|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_383|, ~f2_3~0=v_~f2_3~0_584, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_389|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_415|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_389|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_385|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_487|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_369|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_443|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_401|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_504|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_401|, ~f2_7~0=v_~f2_7~0_613, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_385|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_371|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_342|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:13,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:24:13,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4337 [2022-12-13 10:24:13,313 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 2112 flow [2022-12-13 10:24:13,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:13,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:13,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:13,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 10:24:13,313 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1528666014, now seen corresponding path program 2 times [2022-12-13 10:24:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:13,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614848996] [2022-12-13 10:24:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:13,574 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-13 10:24:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:13,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614848996] [2022-12-13 10:24:13,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614848996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:13,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:13,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:24:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119365186] [2022-12-13 10:24:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:13,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:24:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:13,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:24:13,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:24:13,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-13 10:24:13,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 2112 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:13,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:13,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-13 10:24:13,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:13,957 INFO L130 PetriNetUnfolder]: 384/703 cut-off events. [2022-12-13 10:24:13,957 INFO L131 PetriNetUnfolder]: For 20948/21014 co-relation queries the response was YES. [2022-12-13 10:24:13,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 703 events. 384/703 cut-off events. For 20948/21014 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3416 event pairs, 24 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 6714. Up to 680 conditions per place. [2022-12-13 10:24:13,964 INFO L137 encePairwiseOnDemand]: 25/50 looper letters, 101 selfloop transitions, 24 changer transitions 5/131 dead transitions. [2022-12-13 10:24:13,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 131 transitions, 2455 flow [2022-12-13 10:24:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 10:24:13,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23 [2022-12-13 10:24:13,966 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 2112 flow. Second operand 6 states and 69 transitions. [2022-12-13 10:24:13,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 131 transitions, 2455 flow [2022-12-13 10:24:14,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 131 transitions, 2343 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-13 10:24:14,011 INFO L231 Difference]: Finished difference. Result has 122 places, 121 transitions, 2108 flow [2022-12-13 10:24:14,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2013, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2108, PETRI_PLACES=122, PETRI_TRANSITIONS=121} [2022-12-13 10:24:14,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 102 predicate places. [2022-12-13 10:24:14,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:14,011 INFO L89 Accepts]: Start accepts. Operand has 122 places, 121 transitions, 2108 flow [2022-12-13 10:24:14,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:14,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:14,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 121 transitions, 2108 flow [2022-12-13 10:24:14,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 121 transitions, 2108 flow [2022-12-13 10:24:14,048 INFO L130 PetriNetUnfolder]: 103/290 cut-off events. [2022-12-13 10:24:14,048 INFO L131 PetriNetUnfolder]: For 9028/9061 co-relation queries the response was YES. [2022-12-13 10:24:14,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 290 events. 103/290 cut-off events. For 9028/9061 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1586 event pairs, 2 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 2615. Up to 127 conditions per place. [2022-12-13 10:24:14,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 121 transitions, 2108 flow [2022-12-13 10:24:14,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-13 10:24:17,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [968] $Ultimate##0-->L54-5: Formula: (and (<= 0 (+ v_~f1_2~0_648 2147483648)) (= v_~f2_7~0_613 |v_thread2Thread1of1ForFork1_minus_#res#1_399|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_415| |v_thread2Thread1of1ForFork1_minus_#in~a#1_393|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_391| 2147483648)) (<= v_~f1_6~0_646 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_487|) (= (+ (* 13 v_~f2_3~0_586) (* v_~f1_2~0_650 21)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_371|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_401|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_401| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_401|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_443|) (not (= (ite (or (<= v_~f2_3~0_586 0) (<= 0 (+ v_~f1_2~0_650 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_381| (+ (* v_~f2_7~0_615 13) (* 21 v_~f1_6~0_646))) (= |v_thread1Thread1of1ForFork0_plus_#res#1_385| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_389| |v_thread1Thread1of1ForFork0_plus_~b#1_389|)) (= |v_thread1Thread1of1ForFork0_~i~0#1_504| 8) (= |v_thread1Thread1of1ForFork0_minus_~b#1_401| |v_thread1Thread1of1ForFork0_minus_#in~b#1_369|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_401| |v_thread1Thread1of1ForFork0_minus_#res#1_383|) |v_thread1Thread1of1ForFork0_minus_~a#1_401|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_411| |v_thread2Thread1of1ForFork1_plus_#in~b#1_385|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_383| v_~f2_3~0_584) (<= 0 (+ v_~f1_6~0_646 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_371| |v_thread1Thread1of1ForFork0_minus_#in~b#1_369|) (<= v_~f1_2~0_650 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_385| |v_thread2Thread1of1ForFork1_minus_#in~b#1_393|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_415| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_415|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_415|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_393| v_~f1_6~0_644) (= v_~f1_2~0_648 |v_thread1Thread1of1ForFork0_plus_#res#1_385|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_415| |v_thread2Thread1of1ForFork1_minus_#in~b#1_393|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_391| v_~f1_6~0_644) (< 7 v_~n_0~0_349) (= |v_thread2Thread1of1ForFork1_~i~1#1_499| 8) (= (+ (* 5 v_~f2_3~0_586) |v_thread1Thread1of1ForFork0_plus_#in~b#1_371| (* v_~f1_2~0_650 8)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_371|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_391| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_389| |v_thread1Thread1of1ForFork0_plus_#in~a#1_371|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_381| (+ (* 8 v_~f1_6~0_646) |v_thread2Thread1of1ForFork1_plus_#in~b#1_385| (* 5 v_~f2_7~0_615))) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_381| |v_thread2Thread1of1ForFork1_plus_~a#1_409|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_415| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_415| |v_thread2Thread1of1ForFork1_minus_#res#1_399|)) (<= v_~f1_2~0_648 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_443| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_475|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_367| |v_thread1Thread1of1ForFork0_minus_~a#1_401|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_371| |v_thread1Thread1of1ForFork0_plus_~b#1_389|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_411| |v_thread2Thread1of1ForFork1_plus_~a#1_409|) |v_thread2Thread1of1ForFork1_plus_#res#1_391|) (= v_~f1_2~0_648 |v_thread1Thread1of1ForFork0_minus_#in~a#1_367|)) InVars {~f1_2~0=v_~f1_2~0_650, ~f2_3~0=v_~f2_3~0_586, ~n_0~0=v_~n_0~0_349, ~f2_7~0=v_~f2_7~0_615, ~f1_6~0=v_~f1_6~0_646} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_334|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_367|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_409|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_341|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_399|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_371|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_499|, ~f1_6~0=v_~f1_6~0_644, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_342|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_415|, ~f1_2~0=v_~f1_2~0_648, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_393|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_391|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_323|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_411|, ~n_0~0=v_~n_0~0_349, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_333|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_475|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_393|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_381|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_383|, ~f2_3~0=v_~f2_3~0_584, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_389|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_415|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_389|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_385|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_487|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_369|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_443|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_401|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_504|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_401|, ~f2_7~0=v_~f2_7~0_613, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_385|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_371|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_342|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:24:20,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [980] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_403| (+ (* 21 v_~f1_6~0_679) (* v_~f2_7~0_648 13))) (= v_~f1_2~0_676 |v_thread1Thread1of1ForFork0_minus_#in~a#1_383|) (= |v_thread1Thread1of1ForFork0_#res#1.base_109| 0) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_383| |v_thread1Thread1of1ForFork0_minus_~a#1_417|) (= |v_thread1Thread1of1ForFork0_~i~0#1_520| 8) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491|) (= v_~f2_7~0_647 |v_thread2Thread1of1ForFork1_minus_#res#1_421|) (<= 0 (+ v_~f1_2~0_676 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_415| v_~f1_6~0_678) (<= 0 (+ v_~f1_6~0_679 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_437| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_437| |v_thread2Thread1of1ForFork1_minus_#res#1_421|)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_417| |v_thread1Thread1of1ForFork0_minus_#in~b#1_385|) (<= v_~f1_2~0_677 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_413| 2147483648)) (= v_~l_4~0_152 (ite (< 0 v_~f1_2~0_676) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_387| (* v_~f1_2~0_677 8) (* 5 v_~f2_3~0_613)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_387|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_403| |v_thread2Thread1of1ForFork1_plus_~a#1_431|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_509|) (= v_~f1_2~0_676 |v_thread1Thread1of1ForFork0_plus_#res#1_401|) (< 7 v_~n_0~0_361) (= (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_407| (* 8 v_~f1_6~0_679) (* 5 v_~f2_7~0_648)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_403|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_417|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_417| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_417|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_407| |v_thread2Thread1of1ForFork1_minus_#in~b#1_415|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_387| |v_thread1Thread1of1ForFork0_minus_#in~b#1_385|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_437| |v_thread2Thread1of1ForFork1_minus_#in~a#1_415|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_433| |v_thread2Thread1of1ForFork1_plus_#in~b#1_407|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_109| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_437| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_437|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_437|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_405| |v_thread1Thread1of1ForFork0_plus_#in~a#1_387|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_387| |v_thread1Thread1of1ForFork0_plus_~b#1_405|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_413| v_~f1_6~0_678) (= |v_thread2Thread1of1ForFork1_~i~1#1_521| 8) (not (= (ite (or (<= 0 (+ v_~f1_2~0_677 2147483648)) (<= v_~f2_3~0_613 0)) 1 0) 0)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_433| |v_thread2Thread1of1ForFork1_plus_~a#1_431|) |v_thread2Thread1of1ForFork1_plus_#res#1_413|) (<= v_~f1_6~0_679 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#res#1_399| v_~f2_3~0_612) (= |v_thread1Thread1of1ForFork0_plus_#res#1_401| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_405| |v_thread1Thread1of1ForFork0_plus_~b#1_405|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_417| |v_thread1Thread1of1ForFork0_minus_#res#1_399|) |v_thread1Thread1of1ForFork0_minus_~a#1_417|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_520| v_~n_0~0_361)) (<= v_~f1_2~0_676 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_437| |v_thread2Thread1of1ForFork1_minus_#in~b#1_415|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_413| 2147483647) (= (+ (* v_~f1_2~0_677 21) (* 13 v_~f2_3~0_613)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_387|)) InVars {~f1_2~0=v_~f1_2~0_677, ~f2_3~0=v_~f2_3~0_613, ~n_0~0=v_~n_0~0_361, ~f2_7~0=v_~f2_7~0_648, ~f1_6~0=v_~f1_6~0_679} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_356|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_383|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_431|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_357|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_421|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_387|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_521|, ~f1_6~0=v_~f1_6~0_678, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_364|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_437|, ~f1_2~0=v_~f1_2~0_676, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_415|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_413|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_339|, ~n_0~0=v_~n_0~0_361, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_433|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_349|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_491|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_415|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_109|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_403|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_399|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_109|, ~f2_3~0=v_~f2_3~0_612, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_405|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_437|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_405|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_407|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_509|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_385|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_459|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_417|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_520|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_417|, ~f2_7~0=v_~f2_7~0_647, ~l_4~0=v_~l_4~0_152, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_401|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_387|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_364|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:20,265 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:24:20,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6255 [2022-12-13 10:24:20,266 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 2136 flow [2022-12-13 10:24:20,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:20,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:20,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:20,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 10:24:20,266 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1865687327, now seen corresponding path program 1 times [2022-12-13 10:24:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:20,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213688561] [2022-12-13 10:24:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:20,414 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-13 10:24:20,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:20,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213688561] [2022-12-13 10:24:20,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213688561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:20,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:20,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:24:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901524006] [2022-12-13 10:24:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:20,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:24:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:24:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:24:20,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-13 10:24:20,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 2136 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:20,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:20,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-13 10:24:20,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:20,754 INFO L130 PetriNetUnfolder]: 389/718 cut-off events. [2022-12-13 10:24:20,754 INFO L131 PetriNetUnfolder]: For 22776/22850 co-relation queries the response was YES. [2022-12-13 10:24:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 718 events. 389/718 cut-off events. For 22776/22850 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3584 event pairs, 22 based on Foata normal form. 3/721 useless extension candidates. Maximal degree in co-relation 6854. Up to 685 conditions per place. [2022-12-13 10:24:20,760 INFO L137 encePairwiseOnDemand]: 24/52 looper letters, 106 selfloop transitions, 24 changer transitions 7/138 dead transitions. [2022-12-13 10:24:20,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 138 transitions, 2577 flow [2022-12-13 10:24:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 10:24:20,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24358974358974358 [2022-12-13 10:24:20,761 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 2136 flow. Second operand 6 states and 76 transitions. [2022-12-13 10:24:20,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 138 transitions, 2577 flow [2022-12-13 10:24:20,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 2520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:24:20,799 INFO L231 Difference]: Finished difference. Result has 124 places, 121 transitions, 2138 flow [2022-12-13 10:24:20,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2138, PETRI_PLACES=124, PETRI_TRANSITIONS=121} [2022-12-13 10:24:20,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 104 predicate places. [2022-12-13 10:24:20,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:20,799 INFO L89 Accepts]: Start accepts. Operand has 124 places, 121 transitions, 2138 flow [2022-12-13 10:24:20,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:20,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:20,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 121 transitions, 2138 flow [2022-12-13 10:24:20,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 2138 flow [2022-12-13 10:24:20,843 INFO L130 PetriNetUnfolder]: 105/297 cut-off events. [2022-12-13 10:24:20,843 INFO L131 PetriNetUnfolder]: For 10223/10256 co-relation queries the response was YES. [2022-12-13 10:24:20,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2806 conditions, 297 events. 105/297 cut-off events. For 10223/10256 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1682 event pairs, 2 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 2722. Up to 128 conditions per place. [2022-12-13 10:24:20,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 121 transitions, 2138 flow [2022-12-13 10:24:20,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-13 10:24:20,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [977] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_411| |v_thread1Thread1of1ForFork0_minus_#in~b#1_379|) (<= 0 (+ v_~f1_6~0_668 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_399| |v_thread1Thread1of1ForFork0_plus_#in~a#1_381|) (= v_~f1_2~0_666 |v_thread1Thread1of1ForFork0_plus_#res#1_395|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_411| |v_thread1Thread1of1ForFork0_minus_#res#1_393|) |v_thread1Thread1of1ForFork0_minus_~a#1_411|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_405| v_~f1_6~0_666) (<= v_~f1_2~0_666 2147483647) (<= v_~f1_6~0_668 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_405| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_501|) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_513|) (= v_~f1_2~0_666 |v_thread1Thread1of1ForFork0_minus_#in~a#1_377|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_399| |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|) (<= 0 (+ v_~f1_2~0_666 2147483648)) (= v_~f2_7~0_635 |v_thread2Thread1of1ForFork1_minus_#res#1_413|) (= (+ (* 21 v_~f1_6~0_668) (* v_~f2_7~0_637 13)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_407| v_~f1_6~0_666) (<= v_~f1_2~0_668 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_513| (+ v_~n_0~0_357 1)) (= (+ (* v_~f1_2~0_668 34) (* 21 v_~f2_3~0_604)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_381|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_381| |v_thread1Thread1of1ForFork0_minus_#in~b#1_379|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_405| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_395| (+ (* 13 v_~f1_6~0_668) (* v_~f2_7~0_637 8) |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_377| |v_thread1Thread1of1ForFork0_minus_~a#1_411|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_429| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_429| |v_thread2Thread1of1ForFork1_minus_#res#1_413|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_453| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_395| |v_thread2Thread1of1ForFork1_plus_~a#1_423|) (= |v_thread1Thread1of1ForFork0_~i~0#1_514| 9) (= |v_thread1Thread1of1ForFork0_plus_#res#1_395| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_399| |v_thread1Thread1of1ForFork0_plus_~b#1_399|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_429| |v_thread2Thread1of1ForFork1_minus_#in~a#1_407|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_668 2147483648)) (<= v_~f2_3~0_604 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_429| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_429|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_429|)) 1 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_411| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_411|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_411|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_453|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_425| |v_thread2Thread1of1ForFork1_plus_#in~b#1_399|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_381| |v_thread1Thread1of1ForFork0_plus_~b#1_399|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_393| v_~f2_3~0_602) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_425| |v_thread2Thread1of1ForFork1_plus_~a#1_423|) |v_thread2Thread1of1ForFork1_plus_#res#1_405|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_381| (* 8 v_~f2_3~0_604) (* v_~f1_2~0_668 13)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_381|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_429| |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|)) InVars {~f1_2~0=v_~f1_2~0_668, ~f2_3~0=v_~f2_3~0_604, ~n_0~0=v_~n_0~0_357, ~f2_7~0=v_~f2_7~0_637, ~f1_6~0=v_~f1_6~0_668} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_348|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_377|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_423|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_351|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_413|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_381|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_513|, ~f1_6~0=v_~f1_6~0_666, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_356|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_429|, ~f1_2~0=v_~f1_2~0_666, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_407|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_405|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_333|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_425|, ~n_0~0=v_~n_0~0_357, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_343|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_407|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_395|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_393|, ~f2_3~0=v_~f2_3~0_602, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_399|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_429|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_399|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_399|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_501|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_379|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_453|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_411|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_514|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_411|, ~f2_7~0=v_~f2_7~0_635, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_395|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_381|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_356|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:25,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:24:25,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4751 [2022-12-13 10:24:25,550 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 121 transitions, 2150 flow [2022-12-13 10:24:25,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:25,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:25,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:25,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 10:24:25,551 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash -90679965, now seen corresponding path program 1 times [2022-12-13 10:24:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:25,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341213153] [2022-12-13 10:24:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:25,574 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-13 10:24:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:25,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341213153] [2022-12-13 10:24:25,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341213153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:25,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:25,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:24:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148017211] [2022-12-13 10:24:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:25,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:24:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:25,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:24:25,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:24:25,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:24:25,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 2150 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-13 10:24:25,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:25,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:24:25,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:25,770 INFO L130 PetriNetUnfolder]: 397/724 cut-off events. [2022-12-13 10:24:25,770 INFO L131 PetriNetUnfolder]: For 24459/24459 co-relation queries the response was YES. [2022-12-13 10:24:25,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7155 conditions, 724 events. 397/724 cut-off events. For 24459/24459 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3526 event pairs, 109 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 7056. Up to 631 conditions per place. [2022-12-13 10:24:25,775 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 102 selfloop transitions, 25 changer transitions 0/127 dead transitions. [2022-12-13 10:24:25,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 127 transitions, 2522 flow [2022-12-13 10:24:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:24:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:24:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 10:24:25,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3660130718954248 [2022-12-13 10:24:25,776 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 2150 flow. Second operand 3 states and 56 transitions. [2022-12-13 10:24:25,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 127 transitions, 2522 flow [2022-12-13 10:24:25,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 127 transitions, 2403 flow, removed 37 selfloop flow, removed 6 redundant places. [2022-12-13 10:24:25,821 INFO L231 Difference]: Finished difference. Result has 118 places, 122 transitions, 2150 flow [2022-12-13 10:24:25,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2150, PETRI_PLACES=118, PETRI_TRANSITIONS=122} [2022-12-13 10:24:25,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 98 predicate places. [2022-12-13 10:24:25,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:25,821 INFO L89 Accepts]: Start accepts. Operand has 118 places, 122 transitions, 2150 flow [2022-12-13 10:24:25,822 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:25,822 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:25,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 122 transitions, 2150 flow [2022-12-13 10:24:25,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 122 transitions, 2150 flow [2022-12-13 10:24:25,858 INFO L130 PetriNetUnfolder]: 107/299 cut-off events. [2022-12-13 10:24:25,858 INFO L131 PetriNetUnfolder]: For 10050/10085 co-relation queries the response was YES. [2022-12-13 10:24:25,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 299 events. 107/299 cut-off events. For 10050/10085 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1662 event pairs, 2 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 2695. Up to 131 conditions per place. [2022-12-13 10:24:25,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 122 transitions, 2150 flow [2022-12-13 10:24:25,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 10:24:25,862 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:24:25,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 10:24:25,862 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 122 transitions, 2150 flow [2022-12-13 10:24:25,863 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-13 10:24:25,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:25,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:25,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 10:24:25,863 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1948804217, now seen corresponding path program 2 times [2022-12-13 10:24:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:25,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259516511] [2022-12-13 10:24:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:26,019 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-13 10:24:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:26,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259516511] [2022-12-13 10:24:26,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259516511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:26,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:26,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:24:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257033592] [2022-12-13 10:24:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:26,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:24:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:24:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:24:26,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-13 10:24:26,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 2150 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:26,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:26,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-13 10:24:26,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:26,394 INFO L130 PetriNetUnfolder]: 392/715 cut-off events. [2022-12-13 10:24:26,394 INFO L131 PetriNetUnfolder]: For 22957/23027 co-relation queries the response was YES. [2022-12-13 10:24:26,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6981 conditions, 715 events. 392/715 cut-off events. For 22957/23027 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3488 event pairs, 24 based on Foata normal form. 1/716 useless extension candidates. Maximal degree in co-relation 6735. Up to 692 conditions per place. [2022-12-13 10:24:26,398 INFO L137 encePairwiseOnDemand]: 25/51 looper letters, 102 selfloop transitions, 25 changer transitions 5/133 dead transitions. [2022-12-13 10:24:26,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 133 transitions, 2486 flow [2022-12-13 10:24:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-13 10:24:26,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22875816993464052 [2022-12-13 10:24:26,399 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 2150 flow. Second operand 6 states and 70 transitions. [2022-12-13 10:24:26,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 133 transitions, 2486 flow [2022-12-13 10:24:26,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 2441 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 10:24:26,433 INFO L231 Difference]: Finished difference. Result has 124 places, 123 transitions, 2204 flow [2022-12-13 10:24:26,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2107, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2204, PETRI_PLACES=124, PETRI_TRANSITIONS=123} [2022-12-13 10:24:26,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 104 predicate places. [2022-12-13 10:24:26,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:26,434 INFO L89 Accepts]: Start accepts. Operand has 124 places, 123 transitions, 2204 flow [2022-12-13 10:24:26,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:26,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:26,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 123 transitions, 2204 flow [2022-12-13 10:24:26,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 123 transitions, 2204 flow [2022-12-13 10:24:26,473 INFO L130 PetriNetUnfolder]: 107/300 cut-off events. [2022-12-13 10:24:26,473 INFO L131 PetriNetUnfolder]: For 9983/10018 co-relation queries the response was YES. [2022-12-13 10:24:26,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 300 events. 107/300 cut-off events. For 9983/10018 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1679 event pairs, 2 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 2735. Up to 131 conditions per place. [2022-12-13 10:24:26,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 123 transitions, 2204 flow [2022-12-13 10:24:26,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-13 10:24:26,482 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:30,607 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [977] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_411| |v_thread1Thread1of1ForFork0_minus_#in~b#1_379|) (<= 0 (+ v_~f1_6~0_668 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_399| |v_thread1Thread1of1ForFork0_plus_#in~a#1_381|) (= v_~f1_2~0_666 |v_thread1Thread1of1ForFork0_plus_#res#1_395|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_411| |v_thread1Thread1of1ForFork0_minus_#res#1_393|) |v_thread1Thread1of1ForFork0_minus_~a#1_411|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_405| v_~f1_6~0_666) (<= v_~f1_2~0_666 2147483647) (<= v_~f1_6~0_668 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_405| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_501|) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_513|) (= v_~f1_2~0_666 |v_thread1Thread1of1ForFork0_minus_#in~a#1_377|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_399| |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|) (<= 0 (+ v_~f1_2~0_666 2147483648)) (= v_~f2_7~0_635 |v_thread2Thread1of1ForFork1_minus_#res#1_413|) (= (+ (* 21 v_~f1_6~0_668) (* v_~f2_7~0_637 13)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_407| v_~f1_6~0_666) (<= v_~f1_2~0_668 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_513| (+ v_~n_0~0_357 1)) (= (+ (* v_~f1_2~0_668 34) (* 21 v_~f2_3~0_604)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_381|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_381| |v_thread1Thread1of1ForFork0_minus_#in~b#1_379|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_405| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_395| (+ (* 13 v_~f1_6~0_668) (* v_~f2_7~0_637 8) |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_377| |v_thread1Thread1of1ForFork0_minus_~a#1_411|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_429| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_429| |v_thread2Thread1of1ForFork1_minus_#res#1_413|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_453| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_395| |v_thread2Thread1of1ForFork1_plus_~a#1_423|) (= |v_thread1Thread1of1ForFork0_~i~0#1_514| 9) (= |v_thread1Thread1of1ForFork0_plus_#res#1_395| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_399| |v_thread1Thread1of1ForFork0_plus_~b#1_399|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_429| |v_thread2Thread1of1ForFork1_minus_#in~a#1_407|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_668 2147483648)) (<= v_~f2_3~0_604 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_429| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_429|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_429|)) 1 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_411| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_411|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_411|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_453|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_425| |v_thread2Thread1of1ForFork1_plus_#in~b#1_399|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_381| |v_thread1Thread1of1ForFork0_plus_~b#1_399|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_393| v_~f2_3~0_602) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_425| |v_thread2Thread1of1ForFork1_plus_~a#1_423|) |v_thread2Thread1of1ForFork1_plus_#res#1_405|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_381| (* 8 v_~f2_3~0_604) (* v_~f1_2~0_668 13)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_381|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_429| |v_thread2Thread1of1ForFork1_minus_#in~b#1_407|)) InVars {~f1_2~0=v_~f1_2~0_668, ~f2_3~0=v_~f2_3~0_604, ~n_0~0=v_~n_0~0_357, ~f2_7~0=v_~f2_7~0_637, ~f1_6~0=v_~f1_6~0_668} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_348|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_377|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_423|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_351|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_413|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_381|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_513|, ~f1_6~0=v_~f1_6~0_666, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_356|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_429|, ~f1_2~0=v_~f1_2~0_666, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_407|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_405|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_333|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_425|, ~n_0~0=v_~n_0~0_357, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_343|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_407|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_395|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_393|, ~f2_3~0=v_~f2_3~0_602, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_399|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_429|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_399|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_399|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_501|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_379|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_453|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_411|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_514|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_411|, ~f2_7~0=v_~f2_7~0_635, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_395|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_381|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_356|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [985] L44-5-->L54-5: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_532| v_~n_0~0_367) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_413| v_~f1_6~0_695) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_528| v_~n_0~0_367)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_413| |v_thread2Thread1of1ForFork1_plus_~a#1_441|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_423| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_425| v_~f2_7~0_664) (= |v_thread2Thread1of1ForFork1_minus_~a#1_447| |v_thread2Thread1of1ForFork1_minus_#in~a#1_425|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_423| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_423| v_~f1_6~0_694) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_532| 1) |v_thread2Thread1of1ForFork1_~i~1#1_531|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_447| |v_thread2Thread1of1ForFork1_minus_#in~b#1_425|) (<= v_~f2_7~0_663 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_425| v_~f1_6~0_694) (= |v_thread1Thread1of1ForFork0_#res#1.base_113| 0) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_447| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_447|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_447|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_491|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_113| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_491| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_519|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_443| |v_thread2Thread1of1ForFork1_plus_#in~b#1_417|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_423| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_443| |v_thread2Thread1of1ForFork1_plus_~a#1_441|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_417| v_~f2_7~0_664) (<= 0 (+ v_~f2_7~0_663 2147483648)) (= v_~f2_7~0_663 |v_thread2Thread1of1ForFork1_minus_#res#1_431|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_447| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_447| |v_thread2Thread1of1ForFork1_minus_#res#1_431|)) (= v_~l_4~0_156 (ite (< 0 v_~f1_2~0_690) 1 0))) InVars {~f1_2~0=v_~f1_2~0_690, ~n_0~0=v_~n_0~0_367, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_528|, ~f2_7~0=v_~f2_7~0_664, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_532|, ~f1_6~0=v_~f1_6~0_695} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_413|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_366|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_113|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_447|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_441|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_431|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_491|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_531|, ~f1_6~0=v_~f1_6~0_694, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_374|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_417|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_447|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_519|, ~f1_2~0=v_~f1_2~0_690, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_425|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_423|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_443|, ~n_0~0=v_~n_0~0_367, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_528|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_425|, ~f2_7~0=v_~f2_7~0_663, ~l_4~0=v_~l_4~0_156, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_374|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_113|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:24:30,632 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:24:30,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4199 [2022-12-13 10:24:30,633 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 2232 flow [2022-12-13 10:24:30,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:30,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:30,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:30,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 10:24:30,633 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 51871144, now seen corresponding path program 1 times [2022-12-13 10:24:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:30,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008948998] [2022-12-13 10:24:30,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:30,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:30,877 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-13 10:24:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:30,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008948998] [2022-12-13 10:24:30,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008948998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:30,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:30,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:24:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821232124] [2022-12-13 10:24:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:30,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:24:30,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:24:30,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:24:30,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-13 10:24:30,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 2232 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:30,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:30,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-13 10:24:30,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:31,335 INFO L130 PetriNetUnfolder]: 397/730 cut-off events. [2022-12-13 10:24:31,335 INFO L131 PetriNetUnfolder]: For 23297/23375 co-relation queries the response was YES. [2022-12-13 10:24:31,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 730 events. 397/730 cut-off events. For 23297/23375 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3646 event pairs, 22 based on Foata normal form. 3/733 useless extension candidates. Maximal degree in co-relation 7072. Up to 697 conditions per place. [2022-12-13 10:24:31,344 INFO L137 encePairwiseOnDemand]: 24/53 looper letters, 107 selfloop transitions, 25 changer transitions 7/140 dead transitions. [2022-12-13 10:24:31,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 140 transitions, 2677 flow [2022-12-13 10:24:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-13 10:24:31,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24213836477987422 [2022-12-13 10:24:31,346 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 2232 flow. Second operand 6 states and 77 transitions. [2022-12-13 10:24:31,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 140 transitions, 2677 flow [2022-12-13 10:24:31,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 140 transitions, 2618 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:24:31,405 INFO L231 Difference]: Finished difference. Result has 126 places, 123 transitions, 2234 flow [2022-12-13 10:24:31,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2234, PETRI_PLACES=126, PETRI_TRANSITIONS=123} [2022-12-13 10:24:31,406 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 106 predicate places. [2022-12-13 10:24:31,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:31,406 INFO L89 Accepts]: Start accepts. Operand has 126 places, 123 transitions, 2234 flow [2022-12-13 10:24:31,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:31,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:31,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 123 transitions, 2234 flow [2022-12-13 10:24:31,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 2234 flow [2022-12-13 10:24:31,462 INFO L130 PetriNetUnfolder]: 108/304 cut-off events. [2022-12-13 10:24:31,462 INFO L131 PetriNetUnfolder]: For 10421/10456 co-relation queries the response was YES. [2022-12-13 10:24:31,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 304 events. 108/304 cut-off events. For 10421/10456 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1720 event pairs, 2 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 2827. Up to 132 conditions per place. [2022-12-13 10:24:31,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 123 transitions, 2234 flow [2022-12-13 10:24:31,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 10:24:31,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [984] $Ultimate##0-->L54-5: Formula: (and (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_421| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_421|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_421|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_443| |v_thread2Thread1of1ForFork1_minus_#in~b#1_421|) (= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_409| |v_thread1Thread1of1ForFork0_plus_~b#1_409|) |v_thread1Thread1of1ForFork0_plus_#res#1_405|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_443| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_443| |v_thread2Thread1of1ForFork1_minus_#res#1_427|)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_403| v_~f2_3~0_620) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_419| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_439| |v_thread2Thread1of1ForFork1_plus_#in~b#1_413|) (= v_~f1_2~0_684 |v_thread1Thread1of1ForFork0_minus_#in~a#1_387|) (<= 0 (+ v_~f1_2~0_684 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_391| |v_thread1Thread1of1ForFork0_plus_~b#1_409|) (= (+ (* v_~f1_2~0_686 55) (* 34 v_~f2_3~0_622)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_391|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_409| (+ (* 21 v_~f1_6~0_690) |v_thread2Thread1of1ForFork1_minus_#in~b#1_421| (* v_~f2_7~0_659 13))) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_391| |v_thread1Thread1of1ForFork0_minus_#in~b#1_389|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_686 2147483648)) (<= v_~f2_3~0_622 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_413| |v_thread2Thread1of1ForFork1_minus_#in~b#1_421|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_487| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|) (<= v_~f1_6~0_690 2147483647) (= (+ (* v_~f1_2~0_686 21) |v_thread1Thread1of1ForFork0_minus_#in~b#1_389| (* 13 v_~f2_3~0_622)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_391|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_409| |v_thread2Thread1of1ForFork1_plus_~a#1_437|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_421| |v_thread1Thread1of1ForFork0_minus_#res#1_403|) |v_thread1Thread1of1ForFork0_minus_~a#1_421|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_495|) (= |v_thread2Thread1of1ForFork1_~i~1#1_527| 10) (= |v_thread2Thread1of1ForFork1_minus_~a#1_443| |v_thread2Thread1of1ForFork1_minus_#in~a#1_421|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_421| v_~f1_6~0_688) (= |v_thread1Thread1of1ForFork0_plus_~a#1_409| |v_thread1Thread1of1ForFork0_plus_#in~a#1_391|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_443|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_443| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_443|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_487|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_419| v_~f1_6~0_688) (<= v_~f1_2~0_686 2147483647) (<= v_~f1_2~0_684 2147483647) (<= 0 (+ v_~f1_6~0_690 2147483648)) (= v_~f2_7~0_657 |v_thread2Thread1of1ForFork1_minus_#res#1_427|) (= v_~f1_2~0_684 |v_thread1Thread1of1ForFork0_plus_#res#1_405|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_439| |v_thread2Thread1of1ForFork1_plus_~a#1_437|) |v_thread2Thread1of1ForFork1_plus_#res#1_419|) (= (* 2 |v_thread2Thread1of1ForFork1_minus_#in~b#1_421|) (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_409| (* v_~f2_7~0_659 8) (* 13 v_~f1_6~0_690))) (= |v_thread1Thread1of1ForFork0_~i~0#1_524| 10) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_387| |v_thread1Thread1of1ForFork0_minus_~a#1_421|) (< |v_thread1Thread1of1ForFork0_~i~0#1_524| (+ v_~n_0~0_365 1)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_419| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_421| |v_thread1Thread1of1ForFork0_minus_#in~b#1_389|)) InVars {~f1_2~0=v_~f1_2~0_686, ~f2_3~0=v_~f2_3~0_622, ~n_0~0=v_~n_0~0_365, ~f2_7~0=v_~f2_7~0_659, ~f1_6~0=v_~f1_6~0_690} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_362|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_387|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_437|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_361|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_427|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_487|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_391|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_527|, ~f1_6~0=v_~f1_6~0_688, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_370|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_443|, ~f1_2~0=v_~f1_2~0_684, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_421|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_419|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_343|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_439|, ~n_0~0=v_~n_0~0_365, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_353|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_495|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_421|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_409|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_403|, ~f2_3~0=v_~f2_3~0_620, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_409|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_443|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_409|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_413|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_389|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_421|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_524|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_421|, ~f2_7~0=v_~f2_7~0_657, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_405|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_391|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_370|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:36,659 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:24:36,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5253 [2022-12-13 10:24:36,659 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 123 transitions, 2246 flow [2022-12-13 10:24:36,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:36,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:36,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:36,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 10:24:36,660 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -213509006, now seen corresponding path program 2 times [2022-12-13 10:24:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:36,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723918433] [2022-12-13 10:24:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:36,848 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-13 10:24:36,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:36,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723918433] [2022-12-13 10:24:36,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723918433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:36,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:36,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:24:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491729401] [2022-12-13 10:24:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:36,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:24:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:24:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:24:36,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-13 10:24:36,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 123 transitions, 2246 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:36,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:36,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-13 10:24:36,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:37,202 INFO L130 PetriNetUnfolder]: 394/717 cut-off events. [2022-12-13 10:24:37,202 INFO L131 PetriNetUnfolder]: For 23972/24046 co-relation queries the response was YES. [2022-12-13 10:24:37,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7183 conditions, 717 events. 394/717 cut-off events. For 23972/24046 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3504 event pairs, 24 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 7086. Up to 694 conditions per place. [2022-12-13 10:24:37,208 INFO L137 encePairwiseOnDemand]: 25/52 looper letters, 102 selfloop transitions, 26 changer transitions 5/134 dead transitions. [2022-12-13 10:24:37,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 134 transitions, 2599 flow [2022-12-13 10:24:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 10:24:37,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22756410256410256 [2022-12-13 10:24:37,209 INFO L175 Difference]: Start difference. First operand has 123 places, 123 transitions, 2246 flow. Second operand 6 states and 71 transitions. [2022-12-13 10:24:37,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 134 transitions, 2599 flow [2022-12-13 10:24:37,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 134 transitions, 2463 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-13 10:24:37,249 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 2226 flow [2022-12-13 10:24:37,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2226, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2022-12-13 10:24:37,249 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 104 predicate places. [2022-12-13 10:24:37,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:37,250 INFO L89 Accepts]: Start accepts. Operand has 124 places, 124 transitions, 2226 flow [2022-12-13 10:24:37,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:37,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:37,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 124 transitions, 2226 flow [2022-12-13 10:24:37,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 124 transitions, 2226 flow [2022-12-13 10:24:37,292 INFO L130 PetriNetUnfolder]: 108/299 cut-off events. [2022-12-13 10:24:37,292 INFO L131 PetriNetUnfolder]: For 9905/9942 co-relation queries the response was YES. [2022-12-13 10:24:37,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 299 events. 108/299 cut-off events. For 9905/9942 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1673 event pairs, 2 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 2749. Up to 132 conditions per place. [2022-12-13 10:24:37,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 124 transitions, 2226 flow [2022-12-13 10:24:37,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 10:24:41,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [984] $Ultimate##0-->L54-5: Formula: (and (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_421| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_421|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_421|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_443| |v_thread2Thread1of1ForFork1_minus_#in~b#1_421|) (= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_409| |v_thread1Thread1of1ForFork0_plus_~b#1_409|) |v_thread1Thread1of1ForFork0_plus_#res#1_405|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_443| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_443| |v_thread2Thread1of1ForFork1_minus_#res#1_427|)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_403| v_~f2_3~0_620) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_419| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_439| |v_thread2Thread1of1ForFork1_plus_#in~b#1_413|) (= v_~f1_2~0_684 |v_thread1Thread1of1ForFork0_minus_#in~a#1_387|) (<= 0 (+ v_~f1_2~0_684 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_391| |v_thread1Thread1of1ForFork0_plus_~b#1_409|) (= (+ (* v_~f1_2~0_686 55) (* 34 v_~f2_3~0_622)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_391|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_409| (+ (* 21 v_~f1_6~0_690) |v_thread2Thread1of1ForFork1_minus_#in~b#1_421| (* v_~f2_7~0_659 13))) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_391| |v_thread1Thread1of1ForFork0_minus_#in~b#1_389|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_686 2147483648)) (<= v_~f2_3~0_622 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_413| |v_thread2Thread1of1ForFork1_minus_#in~b#1_421|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_487| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|) (<= v_~f1_6~0_690 2147483647) (= (+ (* v_~f1_2~0_686 21) |v_thread1Thread1of1ForFork0_minus_#in~b#1_389| (* 13 v_~f2_3~0_622)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_391|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_409| |v_thread2Thread1of1ForFork1_plus_~a#1_437|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_421| |v_thread1Thread1of1ForFork0_minus_#res#1_403|) |v_thread1Thread1of1ForFork0_minus_~a#1_421|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_495|) (= |v_thread2Thread1of1ForFork1_~i~1#1_527| 10) (= |v_thread2Thread1of1ForFork1_minus_~a#1_443| |v_thread2Thread1of1ForFork1_minus_#in~a#1_421|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_421| v_~f1_6~0_688) (= |v_thread1Thread1of1ForFork0_plus_~a#1_409| |v_thread1Thread1of1ForFork0_plus_#in~a#1_391|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_443|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_443| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_443|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_487|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_419| v_~f1_6~0_688) (<= v_~f1_2~0_686 2147483647) (<= v_~f1_2~0_684 2147483647) (<= 0 (+ v_~f1_6~0_690 2147483648)) (= v_~f2_7~0_657 |v_thread2Thread1of1ForFork1_minus_#res#1_427|) (= v_~f1_2~0_684 |v_thread1Thread1of1ForFork0_plus_#res#1_405|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_439| |v_thread2Thread1of1ForFork1_plus_~a#1_437|) |v_thread2Thread1of1ForFork1_plus_#res#1_419|) (= (* 2 |v_thread2Thread1of1ForFork1_minus_#in~b#1_421|) (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_409| (* v_~f2_7~0_659 8) (* 13 v_~f1_6~0_690))) (= |v_thread1Thread1of1ForFork0_~i~0#1_524| 10) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_387| |v_thread1Thread1of1ForFork0_minus_~a#1_421|) (< |v_thread1Thread1of1ForFork0_~i~0#1_524| (+ v_~n_0~0_365 1)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_419| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_421| |v_thread1Thread1of1ForFork0_minus_#in~b#1_389|)) InVars {~f1_2~0=v_~f1_2~0_686, ~f2_3~0=v_~f2_3~0_622, ~n_0~0=v_~n_0~0_365, ~f2_7~0=v_~f2_7~0_659, ~f1_6~0=v_~f1_6~0_690} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_362|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_387|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_437|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_361|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_427|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_487|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_391|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_527|, ~f1_6~0=v_~f1_6~0_688, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_370|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_443|, ~f1_2~0=v_~f1_2~0_684, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_421|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_419|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_343|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_439|, ~n_0~0=v_~n_0~0_365, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_353|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_495|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_421|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_409|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_403|, ~f2_3~0=v_~f2_3~0_620, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_409|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_443|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_409|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_413|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_515|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_389|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_463|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_421|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_524|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_421|, ~f2_7~0=v_~f2_7~0_657, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_405|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_391|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_370|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:24:45,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [994] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_minus_~b#1_465| |v_thread2Thread1of1ForFork1_minus_#in~b#1_443|) (= |v_thread2Thread1of1ForFork1_~i~1#1_551| 10) (not (= (ite (or (<= 0 (+ v_~f1_2~0_711 2147483648)) (<= v_~f2_3~0_645 0)) 1 0) 0)) (< |v_thread1Thread1of1ForFork0_~i~0#1_540| (+ v_~n_0~0_377 1)) (= |v_thread1Thread1of1ForFork0_~i~0#1_540| 10) (= v_~f1_2~0_710 |v_thread1Thread1of1ForFork0_minus_#in~a#1_401|) (<= 0 (+ v_~f1_6~0_723 2147483648)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_117| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_509| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_465| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_465|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_465|)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_509| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_537|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_423| |v_thread1Thread1of1ForFork0_plus_#in~a#1_405|) (= v_~l_4~0_160 (ite (< 0 v_~f1_2~0_710) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_419| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_423| |v_thread1Thread1of1ForFork0_plus_~b#1_423|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_405| |v_thread1Thread1of1ForFork0_minus_#in~b#1_403|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_435| |v_thread1Thread1of1ForFork0_minus_#res#1_417|) |v_thread1Thread1of1ForFork0_minus_~a#1_435|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_431| |v_thread2Thread1of1ForFork1_plus_~a#1_459|) (= (+ (* v_~f1_2~0_711 21) |v_thread1Thread1of1ForFork0_minus_#in~b#1_403| (* 13 v_~f2_3~0_645)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_405|) (<= v_~f1_6~0_723 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_477| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509|) (<= v_~f1_2~0_711 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_441| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_443| v_~f1_6~0_722) (= |v_thread1Thread1of1ForFork0_#res#1.base_117| 0) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_435| |v_thread2Thread1of1ForFork1_minus_#in~b#1_443|) (= v_~f2_7~0_691 |v_thread2Thread1of1ForFork1_minus_#res#1_449|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_461| |v_thread2Thread1of1ForFork1_plus_#in~b#1_435|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_431| (+ (* 21 v_~f1_6~0_723) (* v_~f2_7~0_692 13) |v_thread2Thread1of1ForFork1_minus_#in~b#1_443|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_441| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_435| |v_thread1Thread1of1ForFork0_minus_#in~b#1_403|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_435|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_435| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_435|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_477|) (<= v_~f1_2~0_710 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_405| |v_thread1Thread1of1ForFork0_plus_~b#1_423|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_401| |v_thread1Thread1of1ForFork0_minus_~a#1_435|) (= (+ (* 34 v_~f2_3~0_645) (* v_~f1_2~0_711 55)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_405|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_461| |v_thread2Thread1of1ForFork1_plus_~a#1_459|) |v_thread2Thread1of1ForFork1_plus_#res#1_441|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_540| v_~n_0~0_377)) (= (* 2 |v_thread2Thread1of1ForFork1_minus_#in~b#1_443|) (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_431| (* v_~f2_7~0_692 8) (* 13 v_~f1_6~0_723))) (= |v_thread2Thread1of1ForFork1_plus_#res#1_441| v_~f1_6~0_722) (<= 0 (+ v_~f1_2~0_710 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_417| v_~f2_3~0_644) (= |v_thread2Thread1of1ForFork1_minus_~a#1_465| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_465| |v_thread2Thread1of1ForFork1_minus_#res#1_449|)) (= v_~f1_2~0_710 |v_thread1Thread1of1ForFork0_plus_#res#1_419|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_465| |v_thread2Thread1of1ForFork1_minus_#in~a#1_443|)) InVars {~f1_2~0=v_~f1_2~0_711, ~f2_3~0=v_~f2_3~0_645, ~n_0~0=v_~n_0~0_377, ~f2_7~0=v_~f2_7~0_692, ~f1_6~0=v_~f1_6~0_723} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_384|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_401|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_459|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_375|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_449|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_509|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_405|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_551|, ~f1_6~0=v_~f1_6~0_722, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_392|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_465|, ~f1_2~0=v_~f1_2~0_710, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_443|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_441|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_357|, ~n_0~0=v_~n_0~0_377, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_461|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_367|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_509|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_443|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_117|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_431|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_417|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_117|, ~f2_3~0=v_~f2_3~0_644, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_423|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_465|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_423|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_435|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_537|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_403|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_477|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_435|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_540|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_435|, ~f2_7~0=v_~f2_7~0_691, ~l_4~0=v_~l_4~0_160, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_419|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_405|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_392|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:45,174 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:24:45,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7926 [2022-12-13 10:24:45,175 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 122 transitions, 2226 flow [2022-12-13 10:24:45,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:45,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:45,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 10:24:45,175 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1969429615, now seen corresponding path program 1 times [2022-12-13 10:24:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:45,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257506246] [2022-12-13 10:24:45,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:45,334 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-13 10:24:45,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:45,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257506246] [2022-12-13 10:24:45,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257506246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:45,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:45,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:24:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139129553] [2022-12-13 10:24:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:45,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:24:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:24:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:24:45,336 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-13 10:24:45,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 122 transitions, 2226 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:45,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:45,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-13 10:24:45,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:45,628 INFO L130 PetriNetUnfolder]: 398/729 cut-off events. [2022-12-13 10:24:45,628 INFO L131 PetriNetUnfolder]: For 23830/23908 co-relation queries the response was YES. [2022-12-13 10:24:45,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 729 events. 398/729 cut-off events. For 23830/23908 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3577 event pairs, 24 based on Foata normal form. 3/732 useless extension candidates. Maximal degree in co-relation 7066. Up to 694 conditions per place. [2022-12-13 10:24:45,634 INFO L137 encePairwiseOnDemand]: 26/53 looper letters, 108 selfloop transitions, 24 changer transitions 6/139 dead transitions. [2022-12-13 10:24:45,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 139 transitions, 2667 flow [2022-12-13 10:24:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:24:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:24:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 10:24:45,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2830188679245283 [2022-12-13 10:24:45,635 INFO L175 Difference]: Start difference. First operand has 119 places, 122 transitions, 2226 flow. Second operand 5 states and 75 transitions. [2022-12-13 10:24:45,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 139 transitions, 2667 flow [2022-12-13 10:24:45,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 139 transitions, 2585 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-13 10:24:45,677 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 2218 flow [2022-12-13 10:24:45,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2218, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2022-12-13 10:24:45,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 101 predicate places. [2022-12-13 10:24:45,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:45,677 INFO L89 Accepts]: Start accepts. Operand has 121 places, 123 transitions, 2218 flow [2022-12-13 10:24:45,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:45,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:45,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 123 transitions, 2218 flow [2022-12-13 10:24:45,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 123 transitions, 2218 flow [2022-12-13 10:24:45,719 INFO L130 PetriNetUnfolder]: 109/301 cut-off events. [2022-12-13 10:24:45,719 INFO L131 PetriNetUnfolder]: For 9873/9908 co-relation queries the response was YES. [2022-12-13 10:24:45,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 301 events. 109/301 cut-off events. For 9873/9908 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1648 event pairs, 1 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 2805. Up to 133 conditions per place. [2022-12-13 10:24:45,722 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 123 transitions, 2218 flow [2022-12-13 10:24:45,722 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 10:24:45,726 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:24:45,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 10:24:45,726 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 122 transitions, 2195 flow [2022-12-13 10:24:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:45,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:45,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:45,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 10:24:45,726 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1295482891, now seen corresponding path program 1 times [2022-12-13 10:24:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:45,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907040177] [2022-12-13 10:24:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:45,757 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-13 10:24:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907040177] [2022-12-13 10:24:45,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907040177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:45,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:45,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:24:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510300971] [2022-12-13 10:24:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:45,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:24:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:24:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:24:45,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:24:45,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 122 transitions, 2195 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-13 10:24:45,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:45,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:24:45,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:45,954 INFO L130 PetriNetUnfolder]: 405/736 cut-off events. [2022-12-13 10:24:45,954 INFO L131 PetriNetUnfolder]: For 24133/24133 co-relation queries the response was YES. [2022-12-13 10:24:45,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7264 conditions, 736 events. 405/736 cut-off events. For 24133/24133 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3581 event pairs, 111 based on Foata normal form. 4/740 useless extension candidates. Maximal degree in co-relation 7166. Up to 635 conditions per place. [2022-12-13 10:24:45,959 INFO L137 encePairwiseOnDemand]: 34/51 looper letters, 101 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2022-12-13 10:24:45,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 128 transitions, 2567 flow [2022-12-13 10:24:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:24:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:24:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 10:24:45,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3660130718954248 [2022-12-13 10:24:45,960 INFO L175 Difference]: Start difference. First operand has 120 places, 122 transitions, 2195 flow. Second operand 3 states and 56 transitions. [2022-12-13 10:24:45,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 128 transitions, 2567 flow [2022-12-13 10:24:46,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 128 transitions, 2532 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 10:24:46,004 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 2283 flow [2022-12-13 10:24:46,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2283, PETRI_PLACES=120, PETRI_TRANSITIONS=123} [2022-12-13 10:24:46,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 100 predicate places. [2022-12-13 10:24:46,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:46,005 INFO L89 Accepts]: Start accepts. Operand has 120 places, 123 transitions, 2283 flow [2022-12-13 10:24:46,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:46,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:46,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 123 transitions, 2283 flow [2022-12-13 10:24:46,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 123 transitions, 2283 flow [2022-12-13 10:24:46,043 INFO L130 PetriNetUnfolder]: 109/301 cut-off events. [2022-12-13 10:24:46,043 INFO L131 PetriNetUnfolder]: For 10772/10807 co-relation queries the response was YES. [2022-12-13 10:24:46,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2957 conditions, 301 events. 109/301 cut-off events. For 10772/10807 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1668 event pairs, 2 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 2821. Up to 135 conditions per place. [2022-12-13 10:24:46,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 123 transitions, 2283 flow [2022-12-13 10:24:46,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 10:24:46,048 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:24:46,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 10:24:46,049 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 2283 flow [2022-12-13 10:24:46,049 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-13 10:24:46,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:46,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:46,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 10:24:46,049 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1886312725, now seen corresponding path program 2 times [2022-12-13 10:24:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:46,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862972349] [2022-12-13 10:24:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:46,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:46,239 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-13 10:24:46,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:46,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862972349] [2022-12-13 10:24:46,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862972349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:46,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:46,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:24:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435422182] [2022-12-13 10:24:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:46,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:24:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:46,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:24:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:24:46,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-13 10:24:46,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 123 transitions, 2283 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:46,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:46,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-13 10:24:46,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:46,623 INFO L130 PetriNetUnfolder]: 411/750 cut-off events. [2022-12-13 10:24:46,624 INFO L131 PetriNetUnfolder]: For 24182/24252 co-relation queries the response was YES. [2022-12-13 10:24:46,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7505 conditions, 750 events. 411/750 cut-off events. For 24182/24252 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3703 event pairs, 28 based on Foata normal form. 1/751 useless extension candidates. Maximal degree in co-relation 6996. Up to 727 conditions per place. [2022-12-13 10:24:46,629 INFO L137 encePairwiseOnDemand]: 24/51 looper letters, 105 selfloop transitions, 26 changer transitions 5/137 dead transitions. [2022-12-13 10:24:46,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 2709 flow [2022-12-13 10:24:46,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 10:24:46,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23202614379084968 [2022-12-13 10:24:46,629 INFO L175 Difference]: Start difference. First operand has 120 places, 123 transitions, 2283 flow. Second operand 6 states and 71 transitions. [2022-12-13 10:24:46,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 2709 flow [2022-12-13 10:24:46,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 137 transitions, 2662 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 10:24:46,666 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 2420 flow [2022-12-13 10:24:46,666 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2420, PETRI_PLACES=127, PETRI_TRANSITIONS=127} [2022-12-13 10:24:46,667 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 107 predicate places. [2022-12-13 10:24:46,667 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:46,667 INFO L89 Accepts]: Start accepts. Operand has 127 places, 127 transitions, 2420 flow [2022-12-13 10:24:46,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:46,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:46,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 127 transitions, 2420 flow [2022-12-13 10:24:46,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 127 transitions, 2420 flow [2022-12-13 10:24:46,706 INFO L130 PetriNetUnfolder]: 111/307 cut-off events. [2022-12-13 10:24:46,706 INFO L131 PetriNetUnfolder]: For 10410/10445 co-relation queries the response was YES. [2022-12-13 10:24:46,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 307 events. 111/307 cut-off events. For 10410/10445 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1725 event pairs, 2 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 2930. Up to 137 conditions per place. [2022-12-13 10:24:46,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 127 transitions, 2420 flow [2022-12-13 10:24:46,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-13 10:24:46,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:51,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [991] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_429| |v_thread1Thread1of1ForFork0_minus_#in~b#1_397|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_433| v_~f1_6~0_710) (= (+ (* v_~f1_2~0_702 89) (* 55 v_~f2_3~0_636)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_399|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_457| |v_thread2Thread1of1ForFork1_minus_#in~a#1_435|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_429|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_429| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_429|))) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_411| v_~f2_3~0_634) (= |v_thread2Thread1of1ForFork1_minus_~b#1_457| |v_thread2Thread1of1ForFork1_minus_#in~b#1_435|) (<= 0 (+ v_~f1_2~0_700 2147483648)) (not (= (ite (or (<= 0 (+ v_~f1_2~0_702 2147483648)) (<= v_~f2_3~0_636 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_413| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_417| |v_thread1Thread1of1ForFork0_plus_~b#1_417|)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_435| v_~f1_6~0_710) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_529|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_453| |v_thread2Thread1of1ForFork1_plus_~a#1_451|) |v_thread2Thread1of1ForFork1_plus_#res#1_433|) (< |v_thread2Thread1of1ForFork1_~i~1#1_543| (+ v_~n_0~0_373 1)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_429| |v_thread1Thread1of1ForFork0_minus_#res#1_411|) |v_thread1Thread1of1ForFork0_minus_~a#1_429|) (<= v_~f1_6~0_712 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_427| |v_thread2Thread1of1ForFork1_minus_#in~b#1_435|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_433| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_417| |v_thread1Thread1of1ForFork0_plus_#in~a#1_399|) (<= v_~f1_2~0_702 2147483647) (= v_~f1_2~0_700 |v_thread1Thread1of1ForFork0_plus_#res#1_413|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_433| 2147483648)) (= (+ (* 34 v_~f2_7~0_681) (* 55 v_~f1_6~0_712)) |v_thread2Thread1of1ForFork1_plus_#in~b#1_427|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_453| |v_thread2Thread1of1ForFork1_plus_#in~b#1_427|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_399| (+ (* v_~f1_2~0_702 55) (* 34 v_~f2_3~0_636))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_457|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_457| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_457|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_423| (+ (* v_~f2_7~0_681 55) (* 89 v_~f1_6~0_712))) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_399| |v_thread1Thread1of1ForFork0_plus_~b#1_417|) (= v_~f2_7~0_679 |v_thread2Thread1of1ForFork1_minus_#res#1_441|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_457| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_457| |v_thread2Thread1of1ForFork1_minus_#res#1_441|)) (<= 0 (+ v_~f1_6~0_712 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_395| |v_thread1Thread1of1ForFork0_minus_~a#1_429|) (= v_~f1_2~0_700 |v_thread1Thread1of1ForFork0_minus_#in~a#1_395|) (= |v_thread1Thread1of1ForFork0_~i~0#1_534| 11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_503|) (<= v_~f1_2~0_700 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_399| |v_thread1Thread1of1ForFork0_minus_#in~b#1_397|) (= |v_thread2Thread1of1ForFork1_~i~1#1_543| 11) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_423| |v_thread2Thread1of1ForFork1_plus_~a#1_451|)) InVars {~f1_2~0=v_~f1_2~0_702, ~f2_3~0=v_~f2_3~0_636, ~n_0~0=v_~n_0~0_373, ~f2_7~0=v_~f2_7~0_681, ~f1_6~0=v_~f1_6~0_712} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_376|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_395|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_451|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_369|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_441|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_399|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~f1_6~0=v_~f1_6~0_710, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_384|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_457|, ~f1_2~0=v_~f1_2~0_700, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_435|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_433|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_351|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_453|, ~n_0~0=v_~n_0~0_373, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_361|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_503|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_435|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_423|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_411|, ~f2_3~0=v_~f2_3~0_634, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_417|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_457|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_417|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_427|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_529|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_397|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_429|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_534|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_429|, ~f2_7~0=v_~f2_7~0_679, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_413|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_399|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_384|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:57,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [991] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_429| |v_thread1Thread1of1ForFork0_minus_#in~b#1_397|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_433| v_~f1_6~0_710) (= (+ (* v_~f1_2~0_702 89) (* 55 v_~f2_3~0_636)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_399|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_457| |v_thread2Thread1of1ForFork1_minus_#in~a#1_435|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_429|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_429| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_429|))) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_411| v_~f2_3~0_634) (= |v_thread2Thread1of1ForFork1_minus_~b#1_457| |v_thread2Thread1of1ForFork1_minus_#in~b#1_435|) (<= 0 (+ v_~f1_2~0_700 2147483648)) (not (= (ite (or (<= 0 (+ v_~f1_2~0_702 2147483648)) (<= v_~f2_3~0_636 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_413| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_417| |v_thread1Thread1of1ForFork0_plus_~b#1_417|)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_435| v_~f1_6~0_710) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_529|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_453| |v_thread2Thread1of1ForFork1_plus_~a#1_451|) |v_thread2Thread1of1ForFork1_plus_#res#1_433|) (< |v_thread2Thread1of1ForFork1_~i~1#1_543| (+ v_~n_0~0_373 1)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_429| |v_thread1Thread1of1ForFork0_minus_#res#1_411|) |v_thread1Thread1of1ForFork0_minus_~a#1_429|) (<= v_~f1_6~0_712 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_427| |v_thread2Thread1of1ForFork1_minus_#in~b#1_435|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_433| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_417| |v_thread1Thread1of1ForFork0_plus_#in~a#1_399|) (<= v_~f1_2~0_702 2147483647) (= v_~f1_2~0_700 |v_thread1Thread1of1ForFork0_plus_#res#1_413|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_433| 2147483648)) (= (+ (* 34 v_~f2_7~0_681) (* 55 v_~f1_6~0_712)) |v_thread2Thread1of1ForFork1_plus_#in~b#1_427|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_453| |v_thread2Thread1of1ForFork1_plus_#in~b#1_427|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_399| (+ (* v_~f1_2~0_702 55) (* 34 v_~f2_3~0_636))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_457|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_457| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_457|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_423| (+ (* v_~f2_7~0_681 55) (* 89 v_~f1_6~0_712))) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_399| |v_thread1Thread1of1ForFork0_plus_~b#1_417|) (= v_~f2_7~0_679 |v_thread2Thread1of1ForFork1_minus_#res#1_441|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_457| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_457| |v_thread2Thread1of1ForFork1_minus_#res#1_441|)) (<= 0 (+ v_~f1_6~0_712 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_395| |v_thread1Thread1of1ForFork0_minus_~a#1_429|) (= v_~f1_2~0_700 |v_thread1Thread1of1ForFork0_minus_#in~a#1_395|) (= |v_thread1Thread1of1ForFork0_~i~0#1_534| 11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_503|) (<= v_~f1_2~0_700 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_399| |v_thread1Thread1of1ForFork0_minus_#in~b#1_397|) (= |v_thread2Thread1of1ForFork1_~i~1#1_543| 11) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_423| |v_thread2Thread1of1ForFork1_plus_~a#1_451|)) InVars {~f1_2~0=v_~f1_2~0_702, ~f2_3~0=v_~f2_3~0_636, ~n_0~0=v_~n_0~0_373, ~f2_7~0=v_~f2_7~0_681, ~f1_6~0=v_~f1_6~0_712} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_376|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_395|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_451|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_369|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_441|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_501|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_399|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~f1_6~0=v_~f1_6~0_710, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_384|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_457|, ~f1_2~0=v_~f1_2~0_700, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_435|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_433|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_351|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_453|, ~n_0~0=v_~n_0~0_373, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_361|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_503|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_435|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_423|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_411|, ~f2_3~0=v_~f2_3~0_634, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_417|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_457|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_417|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_427|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_529|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_397|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_429|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_534|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_429|, ~f2_7~0=v_~f2_7~0_679, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_413|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_399|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_384|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [998] L44-5-->L54-5: Formula: (and (<= 0 (+ v_~f2_7~0_701 2147483648)) (= v_~f2_7~0_701 |v_thread2Thread1of1ForFork1_minus_#res#1_455|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_544| v_~n_0~0_381)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_441| v_~f2_7~0_702) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_449| v_~f1_6~0_732) (= |v_thread2Thread1of1ForFork1_minus_~a#1_471| |v_thread2Thread1of1ForFork1_minus_#in~a#1_449|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_437| |v_thread2Thread1of1ForFork1_plus_~a#1_465|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_467| |v_thread2Thread1of1ForFork1_plus_#in~b#1_441|) (< |v_thread2Thread1of1ForFork1_~i~1#1_558| v_~n_0~0_381) (= v_~l_4~0_164 (ite (< 0 v_~f1_2~0_718) 1 0)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_447| 2147483648)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_121| 0) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_471| |v_thread2Thread1of1ForFork1_minus_#res#1_455|) |v_thread2Thread1of1ForFork1_minus_~a#1_471|) (= |v_thread1Thread1of1ForFork0_#res#1.base_121| 0) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_467| |v_thread2Thread1of1ForFork1_plus_~a#1_465|) |v_thread2Thread1of1ForFork1_plus_#res#1_447|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_437| v_~f1_6~0_733) (= |v_thread2Thread1of1ForFork1_minus_~b#1_471| |v_thread2Thread1of1ForFork1_minus_#in~b#1_449|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_471|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_471| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_471|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_447| v_~f1_6~0_732) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_447| 2147483647) (<= v_~f2_7~0_701 2147483647) (= |v_thread2Thread1of1ForFork1_~i~1#1_557| (+ |v_thread2Thread1of1ForFork1_~i~1#1_558| 1)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_449| v_~f2_7~0_702)) InVars {~f1_2~0=v_~f1_2~0_718, ~n_0~0=v_~n_0~0_381, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_544|, ~f2_7~0=v_~f2_7~0_702, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_558|, ~f1_6~0=v_~f1_6~0_733} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_437|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_390|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_121|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_471|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_465|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_455|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_515|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_557|, ~f1_6~0=v_~f1_6~0_732, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_398|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_441|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_471|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_543|, ~f1_2~0=v_~f1_2~0_718, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_449|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_447|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_467|, ~n_0~0=v_~n_0~0_381, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_544|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_449|, ~f2_7~0=v_~f2_7~0_701, ~l_4~0=v_~l_4~0_164, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_398|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_121|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:24:57,642 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:24:57,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10975 [2022-12-13 10:24:57,642 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 126 transitions, 2456 flow [2022-12-13 10:24:57,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:24:57,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:57,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:57,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 10:24:57,643 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -935610885, now seen corresponding path program 1 times [2022-12-13 10:24:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:57,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507022556] [2022-12-13 10:24:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:57,684 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-13 10:24:57,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:57,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507022556] [2022-12-13 10:24:57,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507022556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:57,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:57,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:24:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316570150] [2022-12-13 10:24:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:57,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:24:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:24:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:24:57,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:24:57,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 126 transitions, 2456 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-13 10:24:57,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:57,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:24:57,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:57,909 INFO L130 PetriNetUnfolder]: 406/739 cut-off events. [2022-12-13 10:24:57,909 INFO L131 PetriNetUnfolder]: For 24892/24892 co-relation queries the response was YES. [2022-12-13 10:24:57,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7401 conditions, 739 events. 406/739 cut-off events. For 24892/24892 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3618 event pairs, 124 based on Foata normal form. 4/743 useless extension candidates. Maximal degree in co-relation 7301. Up to 664 conditions per place. [2022-12-13 10:24:57,914 INFO L137 encePairwiseOnDemand]: 36/54 looper letters, 117 selfloop transitions, 22 changer transitions 1/140 dead transitions. [2022-12-13 10:24:57,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 140 transitions, 2797 flow [2022-12-13 10:24:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:24:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:24:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-13 10:24:57,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2022-12-13 10:24:57,915 INFO L175 Difference]: Start difference. First operand has 125 places, 126 transitions, 2456 flow. Second operand 4 states and 69 transitions. [2022-12-13 10:24:57,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 140 transitions, 2797 flow [2022-12-13 10:24:57,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 140 transitions, 2725 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 10:24:57,954 INFO L231 Difference]: Finished difference. Result has 126 places, 125 transitions, 2350 flow [2022-12-13 10:24:57,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2350, PETRI_PLACES=126, PETRI_TRANSITIONS=125} [2022-12-13 10:24:57,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 106 predicate places. [2022-12-13 10:24:57,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:57,954 INFO L89 Accepts]: Start accepts. Operand has 126 places, 125 transitions, 2350 flow [2022-12-13 10:24:57,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:57,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:57,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 125 transitions, 2350 flow [2022-12-13 10:24:57,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 125 transitions, 2350 flow [2022-12-13 10:24:57,993 INFO L130 PetriNetUnfolder]: 110/302 cut-off events. [2022-12-13 10:24:57,993 INFO L131 PetriNetUnfolder]: For 10481/10518 co-relation queries the response was YES. [2022-12-13 10:24:57,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 302 events. 110/302 cut-off events. For 10481/10518 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1671 event pairs, 1 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 2850. Up to 136 conditions per place. [2022-12-13 10:24:57,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 125 transitions, 2350 flow [2022-12-13 10:24:57,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-13 10:24:57,997 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:24:57,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 10:24:57,997 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 125 transitions, 2350 flow [2022-12-13 10:24:57,997 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-13 10:24:57,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:57,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:57,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 10:24:57,998 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1367028152, now seen corresponding path program 1 times [2022-12-13 10:24:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:57,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563816536] [2022-12-13 10:24:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:58,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:24:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:58,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563816536] [2022-12-13 10:24:58,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563816536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:58,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:24:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902264282] [2022-12-13 10:24:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:58,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:24:58,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:58,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:24:58,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:24:58,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:24:58,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 125 transitions, 2350 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-13 10:24:58,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:58,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:24:58,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:58,260 INFO L130 PetriNetUnfolder]: 411/746 cut-off events. [2022-12-13 10:24:58,260 INFO L131 PetriNetUnfolder]: For 24920/24920 co-relation queries the response was YES. [2022-12-13 10:24:58,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7526 conditions, 746 events. 411/746 cut-off events. For 24920/24920 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3643 event pairs, 111 based on Foata normal form. 4/750 useless extension candidates. Maximal degree in co-relation 6968. Up to 637 conditions per place. [2022-12-13 10:24:58,267 INFO L137 encePairwiseOnDemand]: 33/51 looper letters, 102 selfloop transitions, 29 changer transitions 0/131 dead transitions. [2022-12-13 10:24:58,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 2730 flow [2022-12-13 10:24:58,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:24:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:24:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 10:24:58,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3660130718954248 [2022-12-13 10:24:58,268 INFO L175 Difference]: Start difference. First operand has 125 places, 125 transitions, 2350 flow. Second operand 3 states and 56 transitions. [2022-12-13 10:24:58,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 2730 flow [2022-12-13 10:24:58,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 131 transitions, 2666 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 10:24:58,327 INFO L231 Difference]: Finished difference. Result has 124 places, 126 transitions, 2415 flow [2022-12-13 10:24:58,327 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2286, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2415, PETRI_PLACES=124, PETRI_TRANSITIONS=126} [2022-12-13 10:24:58,327 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 104 predicate places. [2022-12-13 10:24:58,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:58,327 INFO L89 Accepts]: Start accepts. Operand has 124 places, 126 transitions, 2415 flow [2022-12-13 10:24:58,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:58,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:58,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 126 transitions, 2415 flow [2022-12-13 10:24:58,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 126 transitions, 2415 flow [2022-12-13 10:24:58,388 INFO L130 PetriNetUnfolder]: 111/305 cut-off events. [2022-12-13 10:24:58,388 INFO L131 PetriNetUnfolder]: For 11152/11189 co-relation queries the response was YES. [2022-12-13 10:24:58,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 305 events. 111/305 cut-off events. For 11152/11189 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1693 event pairs, 2 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 2937. Up to 139 conditions per place. [2022-12-13 10:24:58,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 126 transitions, 2415 flow [2022-12-13 10:24:58,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-13 10:24:58,393 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:24:58,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 10:24:58,394 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 126 transitions, 2415 flow [2022-12-13 10:24:58,394 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-13 10:24:58,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:24:58,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:24:58,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 10:24:58,394 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:24:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:24:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1236048672, now seen corresponding path program 1 times [2022-12-13 10:24:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:24:58,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999190008] [2022-12-13 10:24:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:24:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:24:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:24:58,547 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-13 10:24:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:24:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999190008] [2022-12-13 10:24:58,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999190008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:24:58,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:24:58,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:24:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721304854] [2022-12-13 10:24:58,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:24:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:24:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:24:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:24:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:24:58,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-13 10:24:58,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 126 transitions, 2415 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:24:58,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:24:58,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-13 10:24:58,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:24:58,916 INFO L130 PetriNetUnfolder]: 417/760 cut-off events. [2022-12-13 10:24:58,916 INFO L131 PetriNetUnfolder]: For 25889/25963 co-relation queries the response was YES. [2022-12-13 10:24:58,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 760 events. 417/760 cut-off events. For 25889/25963 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3757 event pairs, 26 based on Foata normal form. 1/761 useless extension candidates. Maximal degree in co-relation 7480. Up to 737 conditions per place. [2022-12-13 10:24:58,921 INFO L137 encePairwiseOnDemand]: 23/51 looper letters, 107 selfloop transitions, 27 changer transitions 5/140 dead transitions. [2022-12-13 10:24:58,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 140 transitions, 2847 flow [2022-12-13 10:24:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:24:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:24:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 10:24:58,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23202614379084968 [2022-12-13 10:24:58,922 INFO L175 Difference]: Start difference. First operand has 124 places, 126 transitions, 2415 flow. Second operand 6 states and 71 transitions. [2022-12-13 10:24:58,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 140 transitions, 2847 flow [2022-12-13 10:24:58,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 140 transitions, 2798 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 10:24:58,966 INFO L231 Difference]: Finished difference. Result has 131 places, 130 transitions, 2552 flow [2022-12-13 10:24:58,966 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=2368, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2552, PETRI_PLACES=131, PETRI_TRANSITIONS=130} [2022-12-13 10:24:58,966 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 111 predicate places. [2022-12-13 10:24:58,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:24:58,966 INFO L89 Accepts]: Start accepts. Operand has 131 places, 130 transitions, 2552 flow [2022-12-13 10:24:58,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:24:58,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:24:58,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 130 transitions, 2552 flow [2022-12-13 10:24:58,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 130 transitions, 2552 flow [2022-12-13 10:24:59,013 INFO L130 PetriNetUnfolder]: 114/312 cut-off events. [2022-12-13 10:24:59,013 INFO L131 PetriNetUnfolder]: For 11369/11406 co-relation queries the response was YES. [2022-12-13 10:24:59,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 312 events. 114/312 cut-off events. For 11369/11406 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1743 event pairs, 1 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 3059. Up to 141 conditions per place. [2022-12-13 10:24:59,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 130 transitions, 2552 flow [2022-12-13 10:24:59,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-13 10:24:59,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:24:59,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1002] $Ultimate##0-->L54-5: Formula: (and (<= v_~f1_2~0_726 2147483647) (= v_~f1_2~0_724 |v_thread1Thread1of1ForFork0_plus_#res#1_425|) (= |v_thread1Thread1of1ForFork0_~i~0#1_548| 12) (= |v_thread1Thread1of1ForFork0_minus_#res#1_423| v_~f2_3~0_656) (= |v_thread1Thread1of1ForFork0_minus_~b#1_441| |v_thread1Thread1of1ForFork0_minus_#in~b#1_409|) (= v_~f2_7~0_711 |v_thread2Thread1of1ForFork1_minus_#res#1_461|) (<= v_~f1_6~0_744 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_453| v_~f1_6~0_742) (<= v_~f1_2~0_724 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#res#1_425| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_429| |v_thread1Thread1of1ForFork0_plus_~b#1_429|)) (= (+ (* 89 v_~f1_6~0_744) (* v_~f2_7~0_713 55)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_455|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_521| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_549|) (= v_~f1_2~0_724 |v_thread1Thread1of1ForFork0_minus_#in~a#1_407|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_515|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_477| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_477| |v_thread2Thread1of1ForFork1_minus_#res#1_461|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_453| 2147483647) (not (= (ite (or (<= 0 (+ v_~f1_2~0_726 2147483648)) (<= v_~f2_3~0_658 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_411| |v_thread1Thread1of1ForFork0_plus_~b#1_429|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_407| |v_thread1Thread1of1ForFork0_minus_~a#1_441|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_455| v_~f1_6~0_742) (= (+ (* 89 v_~f2_3~0_658) (* v_~f1_2~0_726 144)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_411|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_429| |v_thread1Thread1of1ForFork0_plus_#in~a#1_411|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_477| |v_thread2Thread1of1ForFork1_minus_#in~b#1_455|) (< |v_thread1Thread1of1ForFork0_~i~0#1_548| (+ v_~n_0~0_385 1)) (<= 0 (+ v_~f1_2~0_724 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_477| |v_thread2Thread1of1ForFork1_minus_#in~a#1_455|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_441|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_441| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_441|))) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_565| 12) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_453| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_411| |v_thread1Thread1of1ForFork0_minus_#in~b#1_409|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_441| |v_thread1Thread1of1ForFork0_minus_#res#1_423|) |v_thread1Thread1of1ForFork0_minus_~a#1_441|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_473| |v_thread2Thread1of1ForFork1_plus_~a#1_471|) |v_thread2Thread1of1ForFork1_plus_#res#1_453|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_473| |v_thread2Thread1of1ForFork1_plus_#in~b#1_447|) (= (+ (* 34 v_~f2_3~0_658) |v_thread1Thread1of1ForFork0_plus_#in~b#1_411| (* v_~f1_2~0_726 55)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_411|) (<= 0 (+ v_~f1_6~0_744 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_447| |v_thread2Thread1of1ForFork1_minus_#in~b#1_455|) (= (+ (* 89 v_~f2_7~0_713) (* 144 v_~f1_6~0_744)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_443|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_443| |v_thread2Thread1of1ForFork1_plus_~a#1_471|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_521| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_477|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_477| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_477|))) 1 0))) InVars {~f1_2~0=v_~f1_2~0_726, ~f2_3~0=v_~f2_3~0_658, ~n_0~0=v_~n_0~0_385, ~f2_7~0=v_~f2_7~0_713, ~f1_6~0=v_~f1_6~0_744} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_396|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_407|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_471|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_381|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_461|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_521|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_411|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_565|, ~f1_6~0=v_~f1_6~0_742, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_404|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_477|, ~f1_2~0=v_~f1_2~0_724, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_455|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_453|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_363|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_473|, ~n_0~0=v_~n_0~0_385, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_373|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_515|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_455|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_443|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_423|, ~f2_3~0=v_~f2_3~0_656, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_429|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_477|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_429|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_447|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_549|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_409|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_441|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_548|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_441|, ~f2_7~0=v_~f2_7~0_711, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_425|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_411|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_404|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [1005] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#res#1_461| v_~f1_6~0_754) (= |v_thread1Thread1of1ForFork0_#res#1.offset_125| 0) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_481| |v_thread2Thread1of1ForFork1_plus_~a#1_479|) |v_thread2Thread1of1ForFork1_plus_#res#1_461|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_455| v_~f2_7~0_724) (= v_~f2_7~0_723 |v_thread2Thread1of1ForFork1_minus_#res#1_469|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_451| v_~f1_6~0_755) (= |v_thread1Thread1of1ForFork0_#res#1.base_125| 0) (<= 0 (+ v_~f2_7~0_723 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_481| |v_thread2Thread1of1ForFork1_plus_#in~b#1_455|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_463| v_~f2_7~0_724) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_574| 1) |v_thread2Thread1of1ForFork1_~i~1#1_573|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_463| v_~f1_6~0_754) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_554| v_~n_0~0_389)) (<= v_~f2_7~0_723 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_485| |v_thread2Thread1of1ForFork1_minus_#in~a#1_463|) (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_485|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_485| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_485|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_529|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_529| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_557|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_485| |v_thread2Thread1of1ForFork1_minus_#in~b#1_463|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_461| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_451| |v_thread2Thread1of1ForFork1_plus_~a#1_479|) (< |v_thread2Thread1of1ForFork1_~i~1#1_574| v_~n_0~0_389) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_461| 2147483647) (= v_~l_4~0_168 (ite (< 0 v_~f1_2~0_734) 1 0)) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_485| |v_thread2Thread1of1ForFork1_minus_#res#1_469|) |v_thread2Thread1of1ForFork1_minus_~a#1_485|)) InVars {~f1_2~0=v_~f1_2~0_734, ~n_0~0=v_~n_0~0_389, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_554|, ~f2_7~0=v_~f2_7~0_724, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_574|, ~f1_6~0=v_~f1_6~0_755} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_451|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_404|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_125|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_485|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_479|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_469|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_529|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_573|, ~f1_6~0=v_~f1_6~0_754, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_412|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_455|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_485|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_557|, ~f1_2~0=v_~f1_2~0_734, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_463|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_461|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_481|, ~n_0~0=v_~n_0~0_389, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_554|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_463|, ~f2_7~0=v_~f2_7~0_723, ~l_4~0=v_~l_4~0_168, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_412|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:25:04,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1002] $Ultimate##0-->L54-5: Formula: (and (<= v_~f1_2~0_726 2147483647) (= v_~f1_2~0_724 |v_thread1Thread1of1ForFork0_plus_#res#1_425|) (= |v_thread1Thread1of1ForFork0_~i~0#1_548| 12) (= |v_thread1Thread1of1ForFork0_minus_#res#1_423| v_~f2_3~0_656) (= |v_thread1Thread1of1ForFork0_minus_~b#1_441| |v_thread1Thread1of1ForFork0_minus_#in~b#1_409|) (= v_~f2_7~0_711 |v_thread2Thread1of1ForFork1_minus_#res#1_461|) (<= v_~f1_6~0_744 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_453| v_~f1_6~0_742) (<= v_~f1_2~0_724 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#res#1_425| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_429| |v_thread1Thread1of1ForFork0_plus_~b#1_429|)) (= (+ (* 89 v_~f1_6~0_744) (* v_~f2_7~0_713 55)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_455|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_521| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_549|) (= v_~f1_2~0_724 |v_thread1Thread1of1ForFork0_minus_#in~a#1_407|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_515|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_477| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_477| |v_thread2Thread1of1ForFork1_minus_#res#1_461|)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_453| 2147483647) (not (= (ite (or (<= 0 (+ v_~f1_2~0_726 2147483648)) (<= v_~f2_3~0_658 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_411| |v_thread1Thread1of1ForFork0_plus_~b#1_429|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_407| |v_thread1Thread1of1ForFork0_minus_~a#1_441|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_455| v_~f1_6~0_742) (= (+ (* 89 v_~f2_3~0_658) (* v_~f1_2~0_726 144)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_411|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_429| |v_thread1Thread1of1ForFork0_plus_#in~a#1_411|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_477| |v_thread2Thread1of1ForFork1_minus_#in~b#1_455|) (< |v_thread1Thread1of1ForFork0_~i~0#1_548| (+ v_~n_0~0_385 1)) (<= 0 (+ v_~f1_2~0_724 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_477| |v_thread2Thread1of1ForFork1_minus_#in~a#1_455|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_441|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_441| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_441|))) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_565| 12) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_453| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_411| |v_thread1Thread1of1ForFork0_minus_#in~b#1_409|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_441| |v_thread1Thread1of1ForFork0_minus_#res#1_423|) |v_thread1Thread1of1ForFork0_minus_~a#1_441|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_473| |v_thread2Thread1of1ForFork1_plus_~a#1_471|) |v_thread2Thread1of1ForFork1_plus_#res#1_453|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_473| |v_thread2Thread1of1ForFork1_plus_#in~b#1_447|) (= (+ (* 34 v_~f2_3~0_658) |v_thread1Thread1of1ForFork0_plus_#in~b#1_411| (* v_~f1_2~0_726 55)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_411|) (<= 0 (+ v_~f1_6~0_744 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_447| |v_thread2Thread1of1ForFork1_minus_#in~b#1_455|) (= (+ (* 89 v_~f2_7~0_713) (* 144 v_~f1_6~0_744)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_443|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_443| |v_thread2Thread1of1ForFork1_plus_~a#1_471|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_521| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_477|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_477| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_477|))) 1 0))) InVars {~f1_2~0=v_~f1_2~0_726, ~f2_3~0=v_~f2_3~0_658, ~n_0~0=v_~n_0~0_385, ~f2_7~0=v_~f2_7~0_713, ~f1_6~0=v_~f1_6~0_744} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_396|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_407|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_471|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_381|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_461|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_521|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_411|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_565|, ~f1_6~0=v_~f1_6~0_742, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_404|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_477|, ~f1_2~0=v_~f1_2~0_724, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_455|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_453|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_363|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_473|, ~n_0~0=v_~n_0~0_385, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_373|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_515|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_455|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_443|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_423|, ~f2_3~0=v_~f2_3~0_656, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_429|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_477|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_429|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_447|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_549|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_409|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_441|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_548|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_441|, ~f2_7~0=v_~f2_7~0_711, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_425|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_411|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_404|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:25:11,031 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:25:11,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12065 [2022-12-13 10:25:11,031 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 2588 flow [2022-12-13 10:25:11,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:25:11,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:25:11,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:25:11,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 10:25:11,032 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:25:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:25:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash -995382642, now seen corresponding path program 2 times [2022-12-13 10:25:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:25:11,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522202734] [2022-12-13 10:25:11,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:25:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:25:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:25:11,228 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-13 10:25:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:25:11,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522202734] [2022-12-13 10:25:11,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522202734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:25:11,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794464096] [2022-12-13 10:25:11,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:25:11,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:25:11,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:25:11,235 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-13 10:25:11,236 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-13 10:25:11,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:25:11,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:25:11,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 10:25:11,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:25:11,433 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-13 10:25:11,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:25:11,535 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-13 10:25:11,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794464096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:25:11,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:25:11,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 10:25:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941708578] [2022-12-13 10:25:11,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:25:11,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 10:25:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:25:11,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 10:25:11,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:25:11,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 54 [2022-12-13 10:25:11,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 2588 flow. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:25:11,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:25:11,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 54 [2022-12-13 10:25:11,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:25:11,949 INFO L130 PetriNetUnfolder]: 424/777 cut-off events. [2022-12-13 10:25:11,949 INFO L131 PetriNetUnfolder]: For 27970/28056 co-relation queries the response was YES. [2022-12-13 10:25:11,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8000 conditions, 777 events. 424/777 cut-off events. For 27970/28056 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3918 event pairs, 25 based on Foata normal form. 3/780 useless extension candidates. Maximal degree in co-relation 7895. Up to 711 conditions per place. [2022-12-13 10:25:11,955 INFO L137 encePairwiseOnDemand]: 25/54 looper letters, 116 selfloop transitions, 35 changer transitions 6/158 dead transitions. [2022-12-13 10:25:11,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 158 transitions, 3207 flow [2022-12-13 10:25:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:25:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:25:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-13 10:25:11,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2199074074074074 [2022-12-13 10:25:11,956 INFO L175 Difference]: Start difference. First operand has 129 places, 129 transitions, 2588 flow. Second operand 8 states and 95 transitions. [2022-12-13 10:25:11,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 158 transitions, 3207 flow [2022-12-13 10:25:12,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 158 transitions, 3132 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-13 10:25:12,004 INFO L231 Difference]: Finished difference. Result has 136 places, 132 transitions, 2670 flow [2022-12-13 10:25:12,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2445, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2670, PETRI_PLACES=136, PETRI_TRANSITIONS=132} [2022-12-13 10:25:12,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 116 predicate places. [2022-12-13 10:25:12,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:25:12,005 INFO L89 Accepts]: Start accepts. Operand has 136 places, 132 transitions, 2670 flow [2022-12-13 10:25:12,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:25:12,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:25:12,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 132 transitions, 2670 flow [2022-12-13 10:25:12,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 2670 flow [2022-12-13 10:25:12,054 INFO L130 PetriNetUnfolder]: 116/320 cut-off events. [2022-12-13 10:25:12,055 INFO L131 PetriNetUnfolder]: For 12925/12964 co-relation queries the response was YES. [2022-12-13 10:25:12,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 320 events. 116/320 cut-off events. For 12925/12964 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1835 event pairs, 1 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 3248. Up to 144 conditions per place. [2022-12-13 10:25:12,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 132 transitions, 2670 flow [2022-12-13 10:25:12,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-13 10:25:12,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:25:12,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:25:12,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:25:12,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 568 [2022-12-13 10:25:12,573 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 132 transitions, 2731 flow [2022-12-13 10:25:12,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:25:12,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:25:12,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:25:12,582 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-13 10:25:12,774 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,SelfDestructingSolverStorable84 [2022-12-13 10:25:12,774 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:25:12,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:25:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash 764626689, now seen corresponding path program 1 times [2022-12-13 10:25:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:25:12,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521863444] [2022-12-13 10:25:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:25:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:25:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:25:12,792 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-13 10:25:12,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:25:12,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521863444] [2022-12-13 10:25:12,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521863444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:25:12,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:25:12,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:25:12,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032086677] [2022-12-13 10:25:12,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:25:12,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:25:12,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:25:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:25:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:25:12,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:25:12,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 132 transitions, 2731 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-13 10:25:12,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:25:12,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:25:12,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:25:12,988 INFO L130 PetriNetUnfolder]: 432/783 cut-off events. [2022-12-13 10:25:12,988 INFO L131 PetriNetUnfolder]: For 30420/30420 co-relation queries the response was YES. [2022-12-13 10:25:12,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8326 conditions, 783 events. 432/783 cut-off events. For 30420/30420 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3817 event pairs, 114 based on Foata normal form. 4/787 useless extension candidates. Maximal degree in co-relation 8219. Up to 666 conditions per place. [2022-12-13 10:25:12,993 INFO L137 encePairwiseOnDemand]: 35/54 looper letters, 106 selfloop transitions, 31 changer transitions 0/137 dead transitions. [2022-12-13 10:25:12,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 137 transitions, 3064 flow [2022-12-13 10:25:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:25:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:25:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 10:25:12,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35802469135802467 [2022-12-13 10:25:12,994 INFO L175 Difference]: Start difference. First operand has 134 places, 132 transitions, 2731 flow. Second operand 3 states and 58 transitions. [2022-12-13 10:25:12,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 137 transitions, 3064 flow [2022-12-13 10:25:13,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 137 transitions, 2908 flow, removed 49 selfloop flow, removed 6 redundant places. [2022-12-13 10:25:13,052 INFO L231 Difference]: Finished difference. Result has 131 places, 132 transitions, 2647 flow [2022-12-13 10:25:13,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2647, PETRI_PLACES=131, PETRI_TRANSITIONS=132} [2022-12-13 10:25:13,053 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 111 predicate places. [2022-12-13 10:25:13,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:25:13,053 INFO L89 Accepts]: Start accepts. Operand has 131 places, 132 transitions, 2647 flow [2022-12-13 10:25:13,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:25:13,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:25:13,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 132 transitions, 2647 flow [2022-12-13 10:25:13,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 132 transitions, 2647 flow [2022-12-13 10:25:13,120 INFO L130 PetriNetUnfolder]: 118/323 cut-off events. [2022-12-13 10:25:13,120 INFO L131 PetriNetUnfolder]: For 12733/12772 co-relation queries the response was YES. [2022-12-13 10:25:13,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 323 events. 118/323 cut-off events. For 12733/12772 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1776 event pairs, 2 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 3222. Up to 146 conditions per place. [2022-12-13 10:25:13,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 132 transitions, 2647 flow [2022-12-13 10:25:13,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-13 10:25:13,126 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:25:13,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 10:25:13,127 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 132 transitions, 2647 flow [2022-12-13 10:25:13,127 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-13 10:25:13,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:25:13,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:25:13,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 10:25:13,128 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:25:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:25:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1838450135, now seen corresponding path program 1 times [2022-12-13 10:25:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:25:13,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24832130] [2022-12-13 10:25:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:25:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:25:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:25:13,263 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-13 10:25:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:25:13,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24832130] [2022-12-13 10:25:13,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24832130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:25:13,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:25:13,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:25:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107409652] [2022-12-13 10:25:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:25:13,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:25:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:25:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:25:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:25:13,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-13 10:25:13,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 132 transitions, 2647 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:25:13,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:25:13,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-13 10:25:13,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:25:13,599 INFO L130 PetriNetUnfolder]: 438/797 cut-off events. [2022-12-13 10:25:13,599 INFO L131 PetriNetUnfolder]: For 28452/28530 co-relation queries the response was YES. [2022-12-13 10:25:13,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8398 conditions, 797 events. 438/797 cut-off events. For 28452/28530 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3984 event pairs, 30 based on Foata normal form. 1/798 useless extension candidates. Maximal degree in co-relation 8108. Up to 774 conditions per place. [2022-12-13 10:25:13,605 INFO L137 encePairwiseOnDemand]: 24/53 looper letters, 112 selfloop transitions, 28 changer transitions 5/146 dead transitions. [2022-12-13 10:25:13,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 146 transitions, 3094 flow [2022-12-13 10:25:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:25:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:25:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 10:25:13,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22955974842767296 [2022-12-13 10:25:13,605 INFO L175 Difference]: Start difference. First operand has 131 places, 132 transitions, 2647 flow. Second operand 6 states and 73 transitions. [2022-12-13 10:25:13,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 146 transitions, 3094 flow [2022-12-13 10:25:13,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 146 transitions, 3047 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 10:25:13,650 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 2790 flow [2022-12-13 10:25:13,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2600, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2790, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2022-12-13 10:25:13,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 118 predicate places. [2022-12-13 10:25:13,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:25:13,651 INFO L89 Accepts]: Start accepts. Operand has 138 places, 136 transitions, 2790 flow [2022-12-13 10:25:13,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:25:13,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:25:13,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 136 transitions, 2790 flow [2022-12-13 10:25:13,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 136 transitions, 2790 flow [2022-12-13 10:25:13,699 INFO L130 PetriNetUnfolder]: 119/328 cut-off events. [2022-12-13 10:25:13,699 INFO L131 PetriNetUnfolder]: For 13000/13039 co-relation queries the response was YES. [2022-12-13 10:25:13,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 328 events. 119/328 cut-off events. For 13000/13039 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1846 event pairs, 2 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 3355. Up to 148 conditions per place. [2022-12-13 10:25:13,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 136 transitions, 2790 flow [2022-12-13 10:25:13,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-13 10:25:13,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:25:13,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1011] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#res#1_433| v_~f2_3~0_674) (<= v_~f1_2~0_746 2147483647) (<= v_~f1_6~0_772 2147483647) (= v_~f1_2~0_744 |v_thread1Thread1of1ForFork0_minus_#in~a#1_417|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_451| |v_thread1Thread1of1ForFork0_minus_#in~b#1_419|) (= (+ (* v_~f1_2~0_746 89) |v_thread1Thread1of1ForFork0_plus_#in~b#1_421| (* 55 v_~f2_3~0_676)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_421|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_461| |v_thread2Thread1of1ForFork1_plus_~a#1_489|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_471| v_~f1_6~0_770) (<= v_~f1_2~0_744 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_495|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_495| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_495|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_495| |v_thread2Thread1of1ForFork1_minus_#in~b#1_473|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_461| (+ (* 144 v_~f2_7~0_741) (* 233 v_~f1_6~0_772))) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_421| |v_thread1Thread1of1ForFork0_plus_~b#1_439|) (<= 0 (+ v_~f1_6~0_772 2147483648)) (= (+ (* 144 v_~f2_3~0_676) (* v_~f1_2~0_746 233)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_421|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_471| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_495| |v_thread2Thread1of1ForFork1_minus_#in~a#1_473|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_421| |v_thread1Thread1of1ForFork0_minus_#in~b#1_419|) (<= 0 (+ v_~f1_2~0_744 2147483648)) (= v_~f1_2~0_744 |v_thread1Thread1of1ForFork0_plus_#res#1_435|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_746 2147483648)) (<= v_~f2_3~0_676 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_585| 13) (= |v_thread1Thread1of1ForFork0_plus_#res#1_435| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_439| |v_thread1Thread1of1ForFork0_plus_~b#1_439|)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_439| |v_thread1Thread1of1ForFork0_plus_#in~a#1_421|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_471| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_417| |v_thread1Thread1of1ForFork0_minus_~a#1_451|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_491| |v_thread2Thread1of1ForFork1_plus_#in~b#1_465|) (= |v_thread1Thread1of1ForFork0_~i~0#1_560| 13) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_465| |v_thread2Thread1of1ForFork1_minus_#in~b#1_473|) (= v_~f2_7~0_739 |v_thread2Thread1of1ForFork1_minus_#res#1_479|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_451| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_451|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_451|)) 1 0)) (= (+ (* v_~f2_7~0_741 55) (* 89 v_~f1_6~0_772) |v_thread2Thread1of1ForFork1_minus_#in~b#1_473|) |v_thread2Thread1of1ForFork1_plus_#in~a#1_461|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_495| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_495| |v_thread2Thread1of1ForFork1_minus_#res#1_479|)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_491| |v_thread2Thread1of1ForFork1_plus_~a#1_489|) |v_thread2Thread1of1ForFork1_plus_#res#1_471|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_525|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_473| v_~f1_6~0_770) (< 12 v_~n_0~0_395) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_567|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_451| |v_thread1Thread1of1ForFork0_minus_#res#1_433|) |v_thread1Thread1of1ForFork0_minus_~a#1_451|)) InVars {~f1_2~0=v_~f1_2~0_746, ~f2_3~0=v_~f2_3~0_676, ~n_0~0=v_~n_0~0_395, ~f2_7~0=v_~f2_7~0_741, ~f1_6~0=v_~f1_6~0_772} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_414|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_417|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_489|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_391|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_479|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_421|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_585|, ~f1_6~0=v_~f1_6~0_770, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_422|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_495|, ~f1_2~0=v_~f1_2~0_744, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_473|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_471|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_373|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_491|, ~n_0~0=v_~n_0~0_395, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_383|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_525|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_473|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_461|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_433|, ~f2_3~0=v_~f2_3~0_674, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_439|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_495|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_439|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_465|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_567|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_419|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_451|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_560|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_451|, ~f2_7~0=v_~f2_7~0_739, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_435|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_421|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_422|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:25:26,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1011] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#res#1_433| v_~f2_3~0_674) (<= v_~f1_2~0_746 2147483647) (<= v_~f1_6~0_772 2147483647) (= v_~f1_2~0_744 |v_thread1Thread1of1ForFork0_minus_#in~a#1_417|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_451| |v_thread1Thread1of1ForFork0_minus_#in~b#1_419|) (= (+ (* v_~f1_2~0_746 89) |v_thread1Thread1of1ForFork0_plus_#in~b#1_421| (* 55 v_~f2_3~0_676)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_421|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_461| |v_thread2Thread1of1ForFork1_plus_~a#1_489|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_471| v_~f1_6~0_770) (<= v_~f1_2~0_744 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_495|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_495| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_495|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_495| |v_thread2Thread1of1ForFork1_minus_#in~b#1_473|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_461| (+ (* 144 v_~f2_7~0_741) (* 233 v_~f1_6~0_772))) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_421| |v_thread1Thread1of1ForFork0_plus_~b#1_439|) (<= 0 (+ v_~f1_6~0_772 2147483648)) (= (+ (* 144 v_~f2_3~0_676) (* v_~f1_2~0_746 233)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_421|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_471| 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_495| |v_thread2Thread1of1ForFork1_minus_#in~a#1_473|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_421| |v_thread1Thread1of1ForFork0_minus_#in~b#1_419|) (<= 0 (+ v_~f1_2~0_744 2147483648)) (= v_~f1_2~0_744 |v_thread1Thread1of1ForFork0_plus_#res#1_435|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_746 2147483648)) (<= v_~f2_3~0_676 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_585| 13) (= |v_thread1Thread1of1ForFork0_plus_#res#1_435| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_439| |v_thread1Thread1of1ForFork0_plus_~b#1_439|)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_439| |v_thread1Thread1of1ForFork0_plus_#in~a#1_421|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_471| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_417| |v_thread1Thread1of1ForFork0_minus_~a#1_451|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_491| |v_thread2Thread1of1ForFork1_plus_#in~b#1_465|) (= |v_thread1Thread1of1ForFork0_~i~0#1_560| 13) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_465| |v_thread2Thread1of1ForFork1_minus_#in~b#1_473|) (= v_~f2_7~0_739 |v_thread2Thread1of1ForFork1_minus_#res#1_479|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_451| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_451|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_451|)) 1 0)) (= (+ (* v_~f2_7~0_741 55) (* 89 v_~f1_6~0_772) |v_thread2Thread1of1ForFork1_minus_#in~b#1_473|) |v_thread2Thread1of1ForFork1_plus_#in~a#1_461|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_495| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_495| |v_thread2Thread1of1ForFork1_minus_#res#1_479|)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_491| |v_thread2Thread1of1ForFork1_plus_~a#1_489|) |v_thread2Thread1of1ForFork1_plus_#res#1_471|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_525|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_473| v_~f1_6~0_770) (< 12 v_~n_0~0_395) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_567|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_451| |v_thread1Thread1of1ForFork0_minus_#res#1_433|) |v_thread1Thread1of1ForFork0_minus_~a#1_451|)) InVars {~f1_2~0=v_~f1_2~0_746, ~f2_3~0=v_~f2_3~0_676, ~n_0~0=v_~n_0~0_395, ~f2_7~0=v_~f2_7~0_741, ~f1_6~0=v_~f1_6~0_772} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_414|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_417|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_489|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_391|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_479|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_539|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_421|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_585|, ~f1_6~0=v_~f1_6~0_770, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_422|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_495|, ~f1_2~0=v_~f1_2~0_744, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_473|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_471|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_373|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_491|, ~n_0~0=v_~n_0~0_395, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_383|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_525|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_473|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_461|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_433|, ~f2_3~0=v_~f2_3~0_674, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_439|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_495|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_439|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_465|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_567|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_419|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_493|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_451|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_560|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_451|, ~f2_7~0=v_~f2_7~0_739, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_435|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_421|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_422|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [1014] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_472| v_~f2_7~0_749) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_478| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_546| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_574|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_478| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_468| |v_thread2Thread1of1ForFork1_plus_~a#1_496|) (< |v_thread2Thread1of1ForFork1_~i~1#1_597| v_~n_0~0_401) (<= v_~f2_7~0_748 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_502| |v_thread2Thread1of1ForFork1_minus_#in~a#1_480|) (<= 0 (+ v_~f2_7~0_748 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_502| |v_thread2Thread1of1ForFork1_minus_#in~b#1_480|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_478| v_~f1_6~0_784) (= |v_thread1Thread1of1ForFork0_#res#1.offset_131| 0) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_480| v_~f1_6~0_784) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_468| v_~f1_6~0_785) (= |v_thread1Thread1of1ForFork0_#res#1.base_131| 0) (= v_~f2_7~0_748 |v_thread2Thread1of1ForFork1_minus_#res#1_486|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_502| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_502| |v_thread2Thread1of1ForFork1_minus_#res#1_486|)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_480| v_~f2_7~0_749) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_498| |v_thread2Thread1of1ForFork1_plus_~a#1_496|) |v_thread2Thread1of1ForFork1_plus_#res#1_478|) (= v_~l_4~0_173 (ite (< 0 v_~f1_2~0_760) 1 0)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_574| v_~n_0~0_401)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_546| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_502| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_502|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_502|)) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_498| |v_thread2Thread1of1ForFork1_plus_#in~b#1_472|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_597| 1) |v_thread2Thread1of1ForFork1_~i~1#1_596|)) InVars {~f1_2~0=v_~f1_2~0_760, ~n_0~0=v_~n_0~0_401, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_574|, ~f2_7~0=v_~f2_7~0_749, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_597|, ~f1_6~0=v_~f1_6~0_785} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_468|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_421|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_131|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_502|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_496|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_486|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_546|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_596|, ~f1_6~0=v_~f1_6~0_784, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_429|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_472|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_502|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_574|, ~f1_2~0=v_~f1_2~0_760, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_480|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_478|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_498|, ~n_0~0=v_~n_0~0_401, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_574|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_480|, ~f2_7~0=v_~f2_7~0_748, ~l_4~0=v_~l_4~0_173, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_429|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_131|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:25:26,763 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:25:26,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13112 [2022-12-13 10:25:26,764 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 135 transitions, 2826 flow [2022-12-13 10:25:26,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:25:26,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:25:26,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:25:26,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 10:25:26,764 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:25:26,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:25:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash -953404495, now seen corresponding path program 1 times [2022-12-13 10:25:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:25:26,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921622409] [2022-12-13 10:25:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:25:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:25:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:25:27,080 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-13 10:25:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:25:27,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921622409] [2022-12-13 10:25:27,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921622409] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:25:27,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087984121] [2022-12-13 10:25:27,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:25:27,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:25:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:25:27,082 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-13 10:25:27,083 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-13 10:25:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:25:27,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:25:27,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:25:30,931 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-13 10:25:30,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:25:31,752 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-13 10:25:31,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087984121] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:25:31,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:25:31,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 10:25:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225048589] [2022-12-13 10:25:31,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:25:31,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:25:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:25:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:25:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=125, Unknown=1, NotChecked=0, Total=156 [2022-12-13 10:25:31,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 56 [2022-12-13 10:25:31,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 135 transitions, 2826 flow. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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-13 10:25:31,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:25:31,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 56 [2022-12-13 10:25:31,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:25:33,882 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 [0] [2022-12-13 10:25:35,909 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 [0] [2022-12-13 10:25:38,211 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 [0] [2022-12-13 10:25:40,289 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 [0] [2022-12-13 10:25:41,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:25:43,731 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 [0] [2022-12-13 10:25:48,356 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 [0] [2022-12-13 10:25:50,919 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 [0] [2022-12-13 10:25:52,997 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 [0] [2022-12-13 10:25:55,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:25:56,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:25:58,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:26:00,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:26:01,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:26:04,040 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 [0] [2022-12-13 10:26:04,054 INFO L130 PetriNetUnfolder]: 485/893 cut-off events. [2022-12-13 10:26:04,055 INFO L131 PetriNetUnfolder]: For 35942/36032 co-relation queries the response was YES. [2022-12-13 10:26:04,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9715 conditions, 893 events. 485/893 cut-off events. For 35942/36032 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4694 event pairs, 29 based on Foata normal form. 4/897 useless extension candidates. Maximal degree in co-relation 9601. Up to 737 conditions per place. [2022-12-13 10:26:04,062 INFO L137 encePairwiseOnDemand]: 19/56 looper letters, 114 selfloop transitions, 63 changer transitions 11/189 dead transitions. [2022-12-13 10:26:04,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 4103 flow [2022-12-13 10:26:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:26:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:26:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-12-13 10:26:04,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17113095238095238 [2022-12-13 10:26:04,063 INFO L175 Difference]: Start difference. First operand has 136 places, 135 transitions, 2826 flow. Second operand 12 states and 115 transitions. [2022-12-13 10:26:04,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 4103 flow [2022-12-13 10:26:04,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 189 transitions, 4027 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-13 10:26:04,117 INFO L231 Difference]: Finished difference. Result has 149 places, 154 transitions, 3497 flow [2022-12-13 10:26:04,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2679, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3497, PETRI_PLACES=149, PETRI_TRANSITIONS=154} [2022-12-13 10:26:04,117 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 129 predicate places. [2022-12-13 10:26:04,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:26:04,118 INFO L89 Accepts]: Start accepts. Operand has 149 places, 154 transitions, 3497 flow [2022-12-13 10:26:04,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:26:04,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:26:04,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 154 transitions, 3497 flow [2022-12-13 10:26:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 154 transitions, 3497 flow [2022-12-13 10:26:04,191 INFO L130 PetriNetUnfolder]: 134/368 cut-off events. [2022-12-13 10:26:04,191 INFO L131 PetriNetUnfolder]: For 17034/17075 co-relation queries the response was YES. [2022-12-13 10:26:04,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 368 events. 134/368 cut-off events. For 17034/17075 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2210 event pairs, 2 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 4101. Up to 172 conditions per place. [2022-12-13 10:26:04,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 154 transitions, 3497 flow [2022-12-13 10:26:04,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-13 10:26:09,807 WARN L233 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 638 DAG size of output: 636 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:26:12,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [997] $Ultimate##0-->L54-5: Formula: (let ((.cse0 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_80| |v_thread1Thread1of1ForFork0_minus_~b#1_Out_80|)) (.cse1 (= v_~f2_3~0_Out_84 |v_thread1Thread1of1ForFork0_minus_#res#1_Out_84|)) (.cse2 (<= v_~f1_2~0_In_56 2147483647)) (.cse3 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_110| 2147483647)) (.cse4 (= v_~f1_6~0_Out_110 |v_thread2Thread1of1ForFork1_plus_#res#1_Out_110|)) (.cse5 (= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_80| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_80|) |v_thread1Thread1of1ForFork0_plus_#res#1_Out_84|)) (.cse6 (<= 0 (+ v_~f1_6~0_In_61 2147483648))) (.cse7 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_Out_110| 2147483648))) (.cse8 (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_80| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_80|)) (.cse9 (= |v_thread2Thread1of1ForFork1_minus_#res#1_Out_110| v_~f2_7~0_Out_110)) (.cse10 (<= v_~f1_2~0_Out_84 2147483647)) (.cse11 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_110| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_114|)) (.cse12 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_84| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|)) (.cse13 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_110| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_110|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_110| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_Out_110|))) 1 0))) (.cse14 (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_Out_106| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_106|) |v_thread2Thread1of1ForFork1_plus_#res#1_Out_110|)) (.cse15 (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_106| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_110|)) (.cse16 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_106| |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_106|)) (.cse17 (= v_~f1_2~0_Out_84 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_84|)) (.cse18 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_Out_80| |v_thread1Thread1of1ForFork0_minus_#res#1_Out_84|) |v_thread1Thread1of1ForFork0_minus_~a#1_Out_80|)) (.cse19 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_80| |v_thread1Thread1of1ForFork0_minus_~a#1_Out_80|)) (.cse20 (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_80| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_80|)) (.cse21 (not (= (ite (or (<= v_~f2_3~0_In_42 0) (<= 0 (+ v_~f1_2~0_In_56 2147483648))) 1 0) 0))) (.cse22 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_106| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_106|)) (.cse23 (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_Out_80| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_80|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_Out_80|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_84|)) (.cse24 (<= 0 (+ v_~f1_2~0_Out_84 2147483648))) (.cse25 (= v_~f1_2~0_Out_84 |v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_80|)) (.cse26 (<= v_~f1_6~0_In_61 2147483647)) (.cse27 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_106| v_~f1_6~0_Out_110)) (.cse28 (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_80| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_80|)) (.cse29 (= |v_thread2Thread1of1ForFork1_minus_~a#1_Out_110| (+ |v_thread2Thread1of1ForFork1_minus_#res#1_Out_110| |v_thread2Thread1of1ForFork1_minus_~b#1_Out_110|))) (.cse30 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_106| |v_thread2Thread1of1ForFork1_minus_~a#1_Out_110|)) (.cse31 (= |v_thread2Thread1of1ForFork1_plus_~a#1_Out_106| |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_106|))) (or (and .cse0 .cse1 .cse2 (= (+ |v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_80| (* v_~f2_3~0_In_42 13) (* v_~f1_2~0_In_56 21)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_80|) .cse3 .cse4 .cse5 .cse6 (= (+ (* v_~f1_6~0_In_61 89) (* v_~f2_7~0_In_55 55)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_106|) .cse7 .cse8 (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_82| 10) .cse9 (= (+ (* 21 v_~f2_7~0_In_55) (* v_~f1_6~0_In_61 34) |v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_106|) |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_106|) .cse10 .cse11 .cse12 .cse13 .cse14 (= (+ (* v_~f1_2~0_In_56 55) (* v_~f2_3~0_In_42 34)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_80|) .cse15 .cse16 (< 10 v_~n_0~0_In_84) .cse17 .cse18 .cse19 (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_108| 11) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_82| 9) .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_~i~1#1_Out_108| 10) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_106| (* v_~f2_7~0_In_55 13) (* v_~f1_6~0_In_61 21)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_106|) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (= (+ (* v_~f2_7~0_In_55 34) (* v_~f1_6~0_In_61 55)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_106|) (< 9 v_~n_0~0_In_84) .cse29 (= (+ (* v_~f2_3~0_In_42 21) (* v_~f1_2~0_In_56 34)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_80|) (= (+ (* v_~f1_2~0_In_56 13) |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_80| (* v_~f2_3~0_In_42 8)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_80|) .cse30 .cse31))) InVars {~f2_7~0=v_~f2_7~0_In_55, ~f1_2~0=v_~f1_2~0_In_56, ~f2_3~0=v_~f2_3~0_In_42, ~f1_6~0=v_~f1_6~0_In_61, ~n_0~0=v_~n_0~0_In_84} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_106|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_Out_80|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_Out_106|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_Out_80|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_Out_110|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_110|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_80|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_Out_108|, ~f1_6~0=v_~f1_6~0_Out_110, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_Out_106|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_Out_110|, ~f1_2~0=v_~f1_2~0_Out_84, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_Out_106|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_Out_110|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_Out_80|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_Out_106|, ~n_0~0=v_~n_0~0_In_84, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_Out_80|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_Out_106|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_106|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_Out_84|, ~f2_3~0=v_~f2_3~0_Out_84, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_80|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_Out_110|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_80|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_106|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_114|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_Out_80|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_84|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_Out_80|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_82|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_Out_80|, ~f2_7~0=v_~f2_7~0_Out_110, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_84|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_80|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_Out_106|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:26:18,409 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 685 DAG size of output: 670 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:26:26,943 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 679 DAG size of output: 670 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:26:29,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] $Ultimate##0-->L54-5: Formula: (and (= (+ v_~f1_2~0_562 v_~f2_3~0_519) |v_thread1Thread1of1ForFork0_plus_#in~a#1_334|) (< 2 v_~n_0~0_299) (= |v_thread2Thread1of1ForFork1_minus_~b#1_326| |v_thread2Thread1of1ForFork1_minus_#in~b#1_304|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_292| |v_thread2Thread1of1ForFork1_plus_~a#1_320|) (= v_~f1_2~0_562 |v_thread1Thread1of1ForFork0_plus_#in~b#1_334|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_292| (+ (* 2 v_~f1_6~0_506) v_~f2_7~0_476)) (<= 0 (+ v_~f1_2~0_561 2147483648)) (= v_~f2_7~0_474 |v_thread2Thread1of1ForFork1_minus_#res#1_310|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_562 2147483648)) (<= v_~f2_3~0_519 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_326| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_326|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_326|)) 1 0)) (<= v_~f1_6~0_506 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_326| |v_thread2Thread1of1ForFork1_minus_#in~a#1_304|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_326| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_326| |v_thread2Thread1of1ForFork1_minus_#res#1_310|)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_364| |v_thread1Thread1of1ForFork0_minus_#in~b#1_332|) (<= v_~f1_2~0_561 2147483647) (= v_~f1_2~0_561 |v_thread1Thread1of1ForFork0_minus_#in~a#1_330|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_322| |v_thread2Thread1of1ForFork1_plus_~a#1_320|) |v_thread2Thread1of1ForFork1_plus_#res#1_302|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_387|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_364| |v_thread1Thread1of1ForFork0_minus_#res#1_346|) |v_thread1Thread1of1ForFork0_minus_~a#1_364|) (<= 0 (+ v_~f1_2~0_562 v_~f2_3~0_519 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_334| |v_thread1Thread1of1ForFork0_plus_~b#1_352|) (<= 0 (+ v_~f1_6~0_506 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_302| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_296| |v_thread2Thread1of1ForFork1_minus_#in~b#1_304|) (= |v_thread1Thread1of1ForFork0_~i~0#1_445| 2) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_330| |v_thread1Thread1of1ForFork0_minus_~a#1_364|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_302| v_~f1_6~0_504) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_364| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_364|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_364|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_406|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_406| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_438|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_292| (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_304| v_~f1_6~0_506)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_352| |v_thread1Thread1of1ForFork0_plus_#in~a#1_334|) (= v_~f1_2~0_561 |v_thread1Thread1of1ForFork0_plus_#res#1_348|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_322| |v_thread2Thread1of1ForFork1_plus_#in~b#1_296|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_304| v_~f1_6~0_504) (= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_352| |v_thread1Thread1of1ForFork0_plus_~b#1_352|) |v_thread1Thread1of1ForFork0_plus_#res#1_348|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_398|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_302| 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_346| v_~f2_3~0_518) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_334| |v_thread1Thread1of1ForFork0_minus_#in~b#1_332|) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_346| 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_#in~b#1_334| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_562, ~f2_3~0=v_~f2_3~0_519, ~n_0~0=v_~n_0~0_299, ~f2_7~0=v_~f2_7~0_476, ~f1_6~0=v_~f1_6~0_506} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_245|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_330|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_320|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_304|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_310|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_334|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_387|, ~f1_6~0=v_~f1_6~0_504, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_253|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_326|, ~f1_2~0=v_~f1_2~0_561, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_304|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_302|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_286|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_322|, ~n_0~0=v_~n_0~0_299, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_296|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_438|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_304|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_292|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_346|, ~f2_3~0=v_~f2_3~0_518, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_352|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_326|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_352|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_296|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_398|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_332|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_406|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_364|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_445|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_364|, ~f2_7~0=v_~f2_7~0_474, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_348|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_334|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_253|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:26:30,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1021] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_107| 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_614| v_~n_0~0_409)) (let ((.cse0 (<= 0 (+ v_~f1_6~0_809 2147483648))) (.cse1 (<= v_~f1_6~0_809 2147483647)) (.cse2 (= v_~f2_7~0_772 |v_thread2Thread1of1ForFork1_minus_#res#1_502|)) (.cse3 (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_514| |v_thread2Thread1of1ForFork1_plus_~a#1_512|) |v_thread2Thread1of1ForFork1_plus_#res#1_494|)) (.cse4 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_442| |v_thread1Thread1of1ForFork0_minus_#in~b#1_440|)) (.cse5 (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_472| |v_thread1Thread1of1ForFork0_minus_#res#1_454|) |v_thread1Thread1of1ForFork0_minus_~a#1_472|)) (.cse6 (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_438| |v_thread1Thread1of1ForFork0_minus_~a#1_472|)) (.cse7 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_562| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_590|)) (.cse8 (= |v_thread2Thread1of1ForFork1_minus_~a#1_518| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_518| |v_thread2Thread1of1ForFork1_minus_#res#1_502|))) (.cse9 (= |v_thread2Thread1of1ForFork1_plus_#res#1_494| v_~f1_6~0_808)) (.cse10 (<= v_~f1_2~0_781 2147483647)) (.cse11 (= |v_thread1Thread1of1ForFork0_minus_#res#1_454| v_~f2_3~0_706)) (.cse12 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_442| |v_thread1Thread1of1ForFork0_plus_~b#1_460|)) (.cse13 (= |v_thread1Thread1of1ForFork0_plus_#res#1_456| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_460| |v_thread1Thread1of1ForFork0_plus_~b#1_460|))) (.cse14 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_484| |v_thread2Thread1of1ForFork1_plus_~a#1_512|)) (.cse15 (= |v_thread1Thread1of1ForFork0_minus_~b#1_472| |v_thread1Thread1of1ForFork0_minus_#in~b#1_440|)) (.cse16 (not (= (ite (or (<= v_~f2_3~0_707 0) (<= 0 (+ v_~f1_2~0_781 2147483648))) 1 0) 0))) (.cse17 (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_472|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_472| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_472|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_514|)) (.cse18 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_494| 2147483648))) (.cse19 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_488| |v_thread2Thread1of1ForFork1_minus_#in~b#1_496|)) (.cse20 (<= v_~f1_2~0_780 2147483647)) (.cse21 (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_496| v_~f1_6~0_808)) (.cse22 (<= |v_thread2Thread1of1ForFork1_plus_#res#1_494| 2147483647)) (.cse23 (= |v_thread2Thread1of1ForFork1_minus_~b#1_518| |v_thread2Thread1of1ForFork1_minus_#in~b#1_496|)) (.cse24 (= v_~f1_2~0_780 |v_thread1Thread1of1ForFork0_minus_#in~a#1_438|)) (.cse25 (= |v_thread1Thread1of1ForFork0_plus_~a#1_460| |v_thread1Thread1of1ForFork0_plus_#in~a#1_442|)) (.cse26 (<= 0 (+ v_~f1_2~0_780 2147483648))) (.cse27 (= |v_thread2Thread1of1ForFork1_plus_~b#1_514| |v_thread2Thread1of1ForFork1_plus_#in~b#1_488|)) (.cse28 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_562| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_518|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_518| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_518|))) 1 0))) (.cse29 (= v_~f1_2~0_780 |v_thread1Thread1of1ForFork0_plus_#res#1_456|)) (.cse30 (= |v_thread2Thread1of1ForFork1_minus_~a#1_518| |v_thread2Thread1of1ForFork1_minus_#in~a#1_496|)) (.cse31 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_514| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_546|))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_~i~1#1_614| 10) .cse1 .cse2 .cse3 (< 9 v_~n_0~0_409) .cse4 (= (+ (* 21 v_~f1_6~0_809) |v_thread2Thread1of1ForFork1_plus_#in~b#1_488| (* v_~f2_7~0_773 13)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_484|) .cse5 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_484| (+ (* 34 v_~f2_7~0_773) (* 55 v_~f1_6~0_809))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |v_thread1Thread1of1ForFork0_~i~0#1_587| 9) .cse14 (= (+ (* 8 v_~f2_3~0_707) |v_thread1Thread1of1ForFork0_plus_#in~b#1_442| (* v_~f1_2~0_781 13)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_442|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_442| (+ (* v_~f1_2~0_781 34) (* 21 v_~f2_3~0_707))) .cse28 .cse29 .cse30 .cse31) (and .cse0 (< 10 v_~n_0~0_409) (= (+ (* 13 v_~f2_3~0_707) |v_thread1Thread1of1ForFork0_minus_#in~b#1_440| (* v_~f1_2~0_781 21)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_442|) .cse1 .cse2 .cse3 .cse4 (= |v_thread1Thread1of1ForFork0_~i~0#1_587| 10) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_484| (+ (* 34 v_~f1_6~0_809) |v_thread2Thread1of1ForFork1_minus_#in~b#1_496| (* 21 v_~f2_7~0_773))) .cse11 .cse12 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_484| (+ (* v_~f2_7~0_773 55) (* 89 v_~f1_6~0_809))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |v_thread2Thread1of1ForFork1_~i~1#1_614| 11) (= (+ (* v_~f1_2~0_781 55) (* 34 v_~f2_3~0_707)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_442|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31))) (= v_~l_8~0_144 (ite (< 0 v_~f1_6~0_808) 1 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_107| 0)) InVars {~f1_2~0=v_~f1_2~0_781, ~f2_3~0=v_~f2_3~0_707, ~n_0~0=v_~n_0~0_409, ~f2_7~0=v_~f2_7~0_773, ~f1_6~0=v_~f1_6~0_809} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_437|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_438|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_107|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_512|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_412|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_502|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_562|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_442|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_614|, ~f1_6~0=v_~f1_6~0_808, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_445|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_518|, ~f1_2~0=v_~f1_2~0_780, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_496|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_494|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_394|, ~n_0~0=v_~n_0~0_409, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_514|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_404|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_546|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_496|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_484|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_454|, ~f2_3~0=v_~f2_3~0_706, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_460|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_518|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_460|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_488|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_590|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_440|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_514|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_107|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_472|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_587|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_472|, ~l_8~0=v_~l_8~0_144, ~f2_7~0=v_~f2_7~0_772, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_456|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_442|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_445|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:26:37,084 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 698 DAG size of output: 683 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:26:43,323 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 10:26:43,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39206 [2022-12-13 10:26:43,324 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 151 transitions, 3591 flow [2022-12-13 10:26:43,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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-13 10:26:43,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:26:43,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:26:43,330 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-13 10:26:43,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-12-13 10:26:43,530 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:26:43,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:26:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash -399849858, now seen corresponding path program 1 times [2022-12-13 10:26:43,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:26:43,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769373300] [2022-12-13 10:26:43,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:26:43,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:26:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:26:43,716 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-13 10:26:43,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:26:43,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769373300] [2022-12-13 10:26:43,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769373300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:26:43,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:26:43,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:26:43,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384566952] [2022-12-13 10:26:43,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:26:43,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:26:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:26:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:26:43,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:26:43,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 64 [2022-12-13 10:26:43,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 151 transitions, 3591 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:26:43,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:26:43,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 64 [2022-12-13 10:26:43,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:26:44,354 INFO L130 PetriNetUnfolder]: 488/889 cut-off events. [2022-12-13 10:26:44,354 INFO L131 PetriNetUnfolder]: For 40737/40831 co-relation queries the response was YES. [2022-12-13 10:26:44,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10316 conditions, 889 events. 488/889 cut-off events. For 40737/40831 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4633 event pairs, 26 based on Foata normal form. 3/890 useless extension candidates. Maximal degree in co-relation 10181. Up to 866 conditions per place. [2022-12-13 10:26:44,361 INFO L137 encePairwiseOnDemand]: 30/64 looper letters, 126 selfloop transitions, 31 changer transitions 6/164 dead transitions. [2022-12-13 10:26:44,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 164 transitions, 4009 flow [2022-12-13 10:26:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:26:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:26:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-13 10:26:44,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21875 [2022-12-13 10:26:44,362 INFO L175 Difference]: Start difference. First operand has 143 places, 151 transitions, 3591 flow. Second operand 6 states and 84 transitions. [2022-12-13 10:26:44,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 164 transitions, 4009 flow [2022-12-13 10:26:44,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 164 transitions, 3653 flow, removed 148 selfloop flow, removed 7 redundant places. [2022-12-13 10:26:44,435 INFO L231 Difference]: Finished difference. Result has 144 places, 153 transitions, 3335 flow [2022-12-13 10:26:44,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3165, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3335, PETRI_PLACES=144, PETRI_TRANSITIONS=153} [2022-12-13 10:26:44,436 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 124 predicate places. [2022-12-13 10:26:44,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:26:44,436 INFO L89 Accepts]: Start accepts. Operand has 144 places, 153 transitions, 3335 flow [2022-12-13 10:26:44,437 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:26:44,437 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:26:44,437 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 153 transitions, 3335 flow [2022-12-13 10:26:44,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 153 transitions, 3335 flow [2022-12-13 10:26:44,488 INFO L130 PetriNetUnfolder]: 135/371 cut-off events. [2022-12-13 10:26:44,489 INFO L131 PetriNetUnfolder]: For 15239/15283 co-relation queries the response was YES. [2022-12-13 10:26:44,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 371 events. 135/371 cut-off events. For 15239/15283 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2219 event pairs, 2 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 3888. Up to 170 conditions per place. [2022-12-13 10:26:44,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 153 transitions, 3335 flow [2022-12-13 10:26:44,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 10:26:44,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1016] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_461| |v_thread1Thread1of1ForFork0_minus_#in~b#1_429|) (= |v_thread1Thread1of1ForFork0_~i~0#1_576| 14) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_576|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_470| (+ (* 233 v_~f2_7~0_754) (* 377 v_~f1_6~0_790))) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_474| |v_thread2Thread1of1ForFork1_minus_#in~b#1_482|) (= (* 2 |v_thread1Thread1of1ForFork0_minus_#in~b#1_429|) (+ (* 55 v_~f2_3~0_691) (* v_~f1_2~0_764 89) |v_thread1Thread1of1ForFork0_plus_#in~a#1_431|)) (= (+ (* 89 v_~f2_3~0_691) |v_thread1Thread1of1ForFork0_minus_#in~b#1_429| (* v_~f1_2~0_764 144)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_431|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_480| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_431| |v_thread1Thread1of1ForFork0_minus_#in~b#1_429|) (<= v_~f1_2~0_762 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_500| |v_thread2Thread1of1ForFork1_plus_#in~b#1_474|) (<= 0 (+ v_~f1_6~0_790 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_461| |v_thread1Thread1of1ForFork0_minus_#res#1_443|) |v_thread1Thread1of1ForFork0_minus_~a#1_461|) (= 14 |v_thread2Thread1of1ForFork1_~i~1#1_600|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_764 2147483648)) (<= v_~f2_3~0_691 0)) 1 0) 0)) (<= v_~f1_2~0_764 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_449| |v_thread1Thread1of1ForFork0_plus_#in~a#1_431|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_504| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_504| |v_thread2Thread1of1ForFork1_minus_#res#1_488|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_504| |v_thread2Thread1of1ForFork1_minus_#in~b#1_482|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_504| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_504|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_504|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_482| v_~f1_6~0_788) (<= 0 (+ v_~f1_2~0_762 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_480| 2147483647) (= v_~f2_7~0_752 |v_thread2Thread1of1ForFork1_minus_#res#1_488|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_470| (+ (* 144 v_~f1_6~0_790) (* 89 v_~f2_7~0_754) |v_thread2Thread1of1ForFork1_minus_#in~b#1_482|)) (<= v_~f1_6~0_790 2147483647) (= v_~f1_2~0_762 |v_thread1Thread1of1ForFork0_minus_#in~a#1_427|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_480| v_~f1_6~0_788) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_470| |v_thread2Thread1of1ForFork1_plus_~a#1_498|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_480| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_500| |v_thread2Thread1of1ForFork1_plus_~a#1_498|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_504| |v_thread2Thread1of1ForFork1_minus_#in~a#1_482|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_461|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_461| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_461|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_431| |v_thread1Thread1of1ForFork0_plus_~b#1_449|) (= v_~f1_2~0_762 |v_thread1Thread1of1ForFork0_plus_#res#1_445|) (< 13 v_~n_0~0_403) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_427| |v_thread1Thread1of1ForFork0_minus_~a#1_461|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_535|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_443| v_~f2_3~0_689) (= |v_thread1Thread1of1ForFork0_plus_#res#1_445| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_449| |v_thread1Thread1of1ForFork0_plus_~b#1_449|))) InVars {~f1_2~0=v_~f1_2~0_764, ~f2_3~0=v_~f2_3~0_691, ~n_0~0=v_~n_0~0_403, ~f2_7~0=v_~f2_7~0_754, ~f1_6~0=v_~f1_6~0_790} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_423|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_427|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_498|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_401|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_488|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_431|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_600|, ~f1_6~0=v_~f1_6~0_788, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_431|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_504|, ~f1_2~0=v_~f1_2~0_762, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_482|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_480|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_383|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_500|, ~n_0~0=v_~n_0~0_403, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_393|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_535|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_482|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_470|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_443|, ~f2_3~0=v_~f2_3~0_689, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_449|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_504|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_449|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_474|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_576|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_429|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_461|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_576|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_461|, ~f2_7~0=v_~f2_7~0_752, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_445|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_431|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_431|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:26:57,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1016] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_461| |v_thread1Thread1of1ForFork0_minus_#in~b#1_429|) (= |v_thread1Thread1of1ForFork0_~i~0#1_576| 14) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_576|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_470| (+ (* 233 v_~f2_7~0_754) (* 377 v_~f1_6~0_790))) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_474| |v_thread2Thread1of1ForFork1_minus_#in~b#1_482|) (= (* 2 |v_thread1Thread1of1ForFork0_minus_#in~b#1_429|) (+ (* 55 v_~f2_3~0_691) (* v_~f1_2~0_764 89) |v_thread1Thread1of1ForFork0_plus_#in~a#1_431|)) (= (+ (* 89 v_~f2_3~0_691) |v_thread1Thread1of1ForFork0_minus_#in~b#1_429| (* v_~f1_2~0_764 144)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_431|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_480| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_431| |v_thread1Thread1of1ForFork0_minus_#in~b#1_429|) (<= v_~f1_2~0_762 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_500| |v_thread2Thread1of1ForFork1_plus_#in~b#1_474|) (<= 0 (+ v_~f1_6~0_790 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_461| |v_thread1Thread1of1ForFork0_minus_#res#1_443|) |v_thread1Thread1of1ForFork0_minus_~a#1_461|) (= 14 |v_thread2Thread1of1ForFork1_~i~1#1_600|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_764 2147483648)) (<= v_~f2_3~0_691 0)) 1 0) 0)) (<= v_~f1_2~0_764 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_449| |v_thread1Thread1of1ForFork0_plus_#in~a#1_431|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_504| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_504| |v_thread2Thread1of1ForFork1_minus_#res#1_488|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_504| |v_thread2Thread1of1ForFork1_minus_#in~b#1_482|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_504| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_504|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_504|)) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_482| v_~f1_6~0_788) (<= 0 (+ v_~f1_2~0_762 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_480| 2147483647) (= v_~f2_7~0_752 |v_thread2Thread1of1ForFork1_minus_#res#1_488|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_470| (+ (* 144 v_~f1_6~0_790) (* 89 v_~f2_7~0_754) |v_thread2Thread1of1ForFork1_minus_#in~b#1_482|)) (<= v_~f1_6~0_790 2147483647) (= v_~f1_2~0_762 |v_thread1Thread1of1ForFork0_minus_#in~a#1_427|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_480| v_~f1_6~0_788) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_470| |v_thread2Thread1of1ForFork1_plus_~a#1_498|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_480| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_500| |v_thread2Thread1of1ForFork1_plus_~a#1_498|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_504| |v_thread2Thread1of1ForFork1_minus_#in~a#1_482|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_461|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_461| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_461|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_431| |v_thread1Thread1of1ForFork0_plus_~b#1_449|) (= v_~f1_2~0_762 |v_thread1Thread1of1ForFork0_plus_#res#1_445|) (< 13 v_~n_0~0_403) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_427| |v_thread1Thread1of1ForFork0_minus_~a#1_461|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_535|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_443| v_~f2_3~0_689) (= |v_thread1Thread1of1ForFork0_plus_#res#1_445| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_449| |v_thread1Thread1of1ForFork0_plus_~b#1_449|))) InVars {~f1_2~0=v_~f1_2~0_764, ~f2_3~0=v_~f2_3~0_691, ~n_0~0=v_~n_0~0_403, ~f2_7~0=v_~f2_7~0_754, ~f1_6~0=v_~f1_6~0_790} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_423|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_427|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_498|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_401|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_488|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_431|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_600|, ~f1_6~0=v_~f1_6~0_788, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_431|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_504|, ~f1_2~0=v_~f1_2~0_762, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_482|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_480|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_383|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_500|, ~n_0~0=v_~n_0~0_403, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_393|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_535|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_482|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_470|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_443|, ~f2_3~0=v_~f2_3~0_689, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_449|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_504|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_449|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_474|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_576|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_429|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_503|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_461|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_576|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_461|, ~f2_7~0=v_~f2_7~0_752, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_445|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_431|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_431|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:03,027 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 581 DAG size of output: 560 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:27:04,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1042] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_137| 0) (= |v_thread1Thread1of1ForFork0_plus_#res#1_503| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_507| |v_thread1Thread1of1ForFork0_plus_~b#1_507|)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_498| (+ (* 233 v_~f2_7~0_799) (* 377 v_~f1_6~0_835))) (= (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_510| (* 89 v_~f2_7~0_799) (* 144 v_~f1_6~0_835)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_498|) (<= v_~f1_6~0_835 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_532| |v_thread2Thread1of1ForFork1_minus_#in~b#1_510|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_508| 2147483647) (= (+ (* 89 v_~f2_3~0_775) (* v_~f1_2~0_849 144) |v_thread1Thread1of1ForFork0_minus_#in~b#1_487|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_489|) (<= 0 (+ v_~f1_2~0_848 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_576| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_532|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_532| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_532|))) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_508| v_~f1_6~0_834) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_510| v_~f1_6~0_834) (= v_~f2_7~0_798 |v_thread2Thread1of1ForFork1_minus_#res#1_516|) (= 14 |v_thread2Thread1of1ForFork1_~i~1#1_628|) (= |v_thread1Thread1of1ForFork0_~i~0#1_643| 14) (= |v_thread2Thread1of1ForFork1_plus_#res#1_508| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_528| |v_thread2Thread1of1ForFork1_plus_~a#1_526|)) (<= v_~f1_2~0_848 2147483647) (= v_~f1_2~0_848 |v_thread1Thread1of1ForFork0_minus_#in~a#1_485|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_576| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_604|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_532| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_532| |v_thread2Thread1of1ForFork1_minus_#res#1_516|)) (< 13 v_~n_0~0_433) (= (+ (* 55 v_~f2_3~0_775) (* v_~f1_2~0_849 89) |v_thread1Thread1of1ForFork0_plus_#in~a#1_489|) (* 2 |v_thread1Thread1of1ForFork0_minus_#in~b#1_487|)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_643| v_~n_0~0_433)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_501| v_~f2_3~0_774) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_485| |v_thread1Thread1of1ForFork0_minus_~a#1_519|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_507| |v_thread1Thread1of1ForFork0_plus_#in~a#1_489|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_519| |v_thread1Thread1of1ForFork0_minus_#in~b#1_487|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_528| |v_thread2Thread1of1ForFork1_plus_#in~b#1_502|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_502| |v_thread2Thread1of1ForFork1_minus_#in~b#1_510|) (= v_~l_4~0_178 (ite (< 0 v_~f1_2~0_848) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_498| |v_thread2Thread1of1ForFork1_plus_~a#1_526|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_508| 2147483648)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_519| |v_thread1Thread1of1ForFork0_minus_#res#1_501|) |v_thread1Thread1of1ForFork0_minus_~a#1_519|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_489| |v_thread1Thread1of1ForFork0_plus_~b#1_507|) (<= 0 (+ v_~f1_6~0_835 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_532| |v_thread2Thread1of1ForFork1_minus_#in~a#1_510|) (= |v_thread1Thread1of1ForFork0_#res#1.base_137| 0) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_489| |v_thread1Thread1of1ForFork0_minus_#in~b#1_487|) (= v_~f1_2~0_848 |v_thread1Thread1of1ForFork0_plus_#res#1_503|) (<= v_~f1_2~0_849 2147483647) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_519| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_519|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_519|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_561|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_561| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_593|) (not (= (ite (or (<= v_~f2_3~0_775 0) (<= 0 (+ v_~f1_2~0_849 2147483648))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_849, ~f2_3~0=v_~f2_3~0_775, ~n_0~0=v_~n_0~0_433, ~f2_7~0=v_~f2_7~0_799, ~f1_6~0=v_~f1_6~0_835} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_451|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_485|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_526|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_456|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_516|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_576|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_489|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_628|, ~f1_6~0=v_~f1_6~0_834, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_459|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_532|, ~f1_2~0=v_~f1_2~0_848, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_510|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_508|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_438|, ~n_0~0=v_~n_0~0_433, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_528|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_448|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_593|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_510|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_137|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_498|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_501|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_137|, ~f2_3~0=v_~f2_3~0_774, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_507|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_532|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_507|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_502|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_604|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_487|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_561|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_519|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_643|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_519|, ~f2_7~0=v_~f2_7~0_798, ~l_4~0=v_~l_4~0_178, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_503|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_489|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_459|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:05,037 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:27:05,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20605 [2022-12-13 10:27:05,041 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 152 transitions, 3371 flow [2022-12-13 10:27:05,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:27:05,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:05,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:05,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 10:27:05,041 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1327679918, now seen corresponding path program 1 times [2022-12-13 10:27:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:05,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57754588] [2022-12-13 10:27:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:05,162 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-13 10:27:05,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:05,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57754588] [2022-12-13 10:27:05,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57754588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:05,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:05,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:27:05,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613092004] [2022-12-13 10:27:05,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:05,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:27:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:27:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:27:05,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-13 10:27:05,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 152 transitions, 3371 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:27:05,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:05,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-13 10:27:05,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:05,579 INFO L130 PetriNetUnfolder]: 494/903 cut-off events. [2022-12-13 10:27:05,579 INFO L131 PetriNetUnfolder]: For 36994/37094 co-relation queries the response was YES. [2022-12-13 10:27:05,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9928 conditions, 903 events. 494/903 cut-off events. For 36994/37094 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4733 event pairs, 26 based on Foata normal form. 3/906 useless extension candidates. Maximal degree in co-relation 9809. Up to 870 conditions per place. [2022-12-13 10:27:05,586 INFO L137 encePairwiseOnDemand]: 30/65 looper letters, 131 selfloop transitions, 33 changer transitions 6/171 dead transitions. [2022-12-13 10:27:05,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 171 transitions, 3938 flow [2022-12-13 10:27:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:27:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:27:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-13 10:27:05,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-13 10:27:05,587 INFO L175 Difference]: Start difference. First operand has 141 places, 152 transitions, 3371 flow. Second operand 6 states and 90 transitions. [2022-12-13 10:27:05,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 171 transitions, 3938 flow [2022-12-13 10:27:05,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 171 transitions, 3861 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 10:27:05,652 INFO L231 Difference]: Finished difference. Result has 146 places, 155 transitions, 3463 flow [2022-12-13 10:27:05,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=3219, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3463, PETRI_PLACES=146, PETRI_TRANSITIONS=155} [2022-12-13 10:27:05,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 126 predicate places. [2022-12-13 10:27:05,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:05,652 INFO L89 Accepts]: Start accepts. Operand has 146 places, 155 transitions, 3463 flow [2022-12-13 10:27:05,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:05,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:05,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 155 transitions, 3463 flow [2022-12-13 10:27:05,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 155 transitions, 3463 flow [2022-12-13 10:27:05,707 INFO L130 PetriNetUnfolder]: 137/377 cut-off events. [2022-12-13 10:27:05,707 INFO L131 PetriNetUnfolder]: For 17157/17201 co-relation queries the response was YES. [2022-12-13 10:27:05,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4191 conditions, 377 events. 137/377 cut-off events. For 17157/17201 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2265 event pairs, 2 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 4089. Up to 173 conditions per place. [2022-12-13 10:27:05,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 155 transitions, 3463 flow [2022-12-13 10:27:05,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 10:27:05,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:27:06,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:27:07,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1026] $Ultimate##0-->L44-5: Formula: (and (<= |v_thread2Thread1of1ForFork1_plus_#res#1_502| 2147483647) (= v_~f1_2~0_794 |v_thread1Thread1of1ForFork0_plus_#res#1_464|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_570| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_598|) (not (= (ite (or (<= v_~f2_3~0_722 0) (<= 0 (+ v_~f1_2~0_796 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_450| |v_thread1Thread1of1ForFork0_minus_#in~b#1_448|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_492| |v_thread2Thread1of1ForFork1_plus_~a#1_520|) (= (+ (* v_~f1_2~0_796 2) v_~f2_3~0_722) |v_thread1Thread1of1ForFork0_plus_#in~a#1_450|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_480| |v_thread1Thread1of1ForFork0_minus_#in~b#1_448|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_522| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_554|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_504| v_~f1_6~0_822) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_496| |v_thread2Thread1of1ForFork1_minus_#in~b#1_504|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_522| |v_thread2Thread1of1ForFork1_plus_~a#1_520|) |v_thread2Thread1of1ForFork1_plus_#res#1_502|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_492| (+ (* 2 v_~f1_6~0_823) v_~f2_7~0_787)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_522| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_480|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_480| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_480|))) 1 0)) (= (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_504| v_~f1_6~0_823) |v_thread2Thread1of1ForFork1_plus_#in~a#1_492|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_570| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_526|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_526| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_526|))) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_446| |v_thread1Thread1of1ForFork0_minus_~a#1_480|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_526| |v_thread2Thread1of1ForFork1_minus_#in~b#1_504|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_502| v_~f1_6~0_822) (= |v_thread2Thread1of1ForFork1_minus_~a#1_526| |v_thread2Thread1of1ForFork1_minus_#in~a#1_504|) (= (+ v_~f1_2~0_796 |v_thread1Thread1of1ForFork0_plus_#in~b#1_450|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_450|) (< |v_thread1Thread1of1ForFork0_~i~0#1_595| (+ v_~n_0~0_415 1)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_450| |v_thread1Thread1of1ForFork0_plus_~b#1_468|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_464| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_468| |v_thread1Thread1of1ForFork0_plus_~b#1_468|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_526| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_526| |v_thread2Thread1of1ForFork1_minus_#res#1_510|)) (= |v_thread1Thread1of1ForFork0_~i~0#1_595| 3) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_622|) (<= v_~f1_2~0_794 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_468| |v_thread1Thread1of1ForFork0_plus_#in~a#1_450|) (<= v_~f1_2~0_796 2147483647) (<= 0 (+ v_~f1_6~0_823 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_522| |v_thread2Thread1of1ForFork1_plus_#in~b#1_496|) (<= v_~f1_6~0_823 2147483647) (= v_~f2_7~0_786 |v_thread2Thread1of1ForFork1_minus_#res#1_510|) (<= 0 (+ v_~f1_2~0_794 2147483648)) (= v_~f1_2~0_794 |v_thread1Thread1of1ForFork0_minus_#in~a#1_446|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_480| |v_thread1Thread1of1ForFork0_minus_#res#1_462|) |v_thread1Thread1of1ForFork0_minus_~a#1_480|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_502| 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_462| v_~f2_3~0_720)) InVars {~f1_2~0=v_~f1_2~0_796, ~f2_3~0=v_~f2_3~0_722, ~n_0~0=v_~n_0~0_415, ~f2_7~0=v_~f2_7~0_787, ~f1_6~0=v_~f1_6~0_823} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_445|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_446|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_420|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_520|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_450|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_510|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_570|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_622|, ~f1_6~0=v_~f1_6~0_822, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_453|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_526|, ~f1_2~0=v_~f1_2~0_794, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_402|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_504|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_502|, ~n_0~0=v_~n_0~0_415, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_522|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_412|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_554|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_504|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_492|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_462|, ~f2_3~0=v_~f2_3~0_720, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_468|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_526|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_468|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_496|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_448|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_598|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_522|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_480|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_595|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_480|, ~f2_7~0=v_~f2_7~0_786, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_464|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_450|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_453|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [1049] L54-5-->L44-5: Formula: (and (<= 0 (+ v_~f1_2~0_866 2147483648)) (= v_~l_8~0_150 (ite (< 0 v_~f1_6~0_856) 1 0)) (= v_~f1_2~0_866 |v_thread1Thread1of1ForFork0_plus_#res#1_513|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_499| v_~f2_3~0_793) (= |v_thread2Thread1of1ForFork1_#res#1.offset_113| 0) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_499| |v_thread1Thread1of1ForFork0_plus_~b#1_517|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_511| v_~f2_3~0_792) (= |v_thread1Thread1of1ForFork0_plus_#res#1_513| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_517| |v_thread1Thread1of1ForFork0_plus_~b#1_517|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_495| |v_thread1Thread1of1ForFork0_minus_~a#1_529|) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_642| v_~n_0~0_441)) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_511| 2147483647) (= |v_thread1Thread1of1ForFork0_minus_~b#1_529| |v_thread1Thread1of1ForFork0_minus_#in~b#1_497|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_529| |v_thread1Thread1of1ForFork0_minus_#res#1_511|) |v_thread1Thread1of1ForFork0_minus_~a#1_529|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_497| v_~f2_3~0_793) (< |v_thread1Thread1of1ForFork0_~i~0#1_654| v_~n_0~0_441) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_571| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_529| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_529|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_529|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_517| |v_thread1Thread1of1ForFork0_plus_#in~a#1_499|) (= |v_thread1Thread1of1ForFork0_~i~0#1_653| (+ |v_thread1Thread1of1ForFork0_~i~0#1_654| 1)) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_529| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_529| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_529|))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_113| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_571| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_603|) (<= v_~f1_2~0_866 2147483647) (= v_~f1_2~0_867 |v_thread1Thread1of1ForFork0_plus_#in~a#1_499|) (= v_~f1_2~0_866 |v_thread1Thread1of1ForFork0_minus_#in~a#1_495|)) InVars {~f1_2~0=v_~f1_2~0_867, ~f2_3~0=v_~f2_3~0_793, ~n_0~0=v_~n_0~0_441, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_654|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_642|, ~f1_6~0=v_~f1_6~0_856} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_511|, ~f2_3~0=v_~f2_3~0_792, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_517|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_495|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_466|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_113|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_517|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_499|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_642|, ~f1_6~0=v_~f1_6~0_856, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_497|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_571|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_113|, ~f1_2~0=v_~f1_2~0_866, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_448|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_529|, ~n_0~0=v_~n_0~0_441, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_653|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_458|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_529|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_603|, ~l_8~0=v_~l_8~0_150, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_513|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_499|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~l_8~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:27:07,923 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:27:07,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2272 [2022-12-13 10:27:07,924 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 154 transitions, 3514 flow [2022-12-13 10:27:07,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:27:07,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:07,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:07,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 10:27:07,924 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash -840592372, now seen corresponding path program 1 times [2022-12-13 10:27:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:07,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479756759] [2022-12-13 10:27:07,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:07,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:08,097 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-13 10:27:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:08,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479756759] [2022-12-13 10:27:08,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479756759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:08,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:08,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:27:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955910304] [2022-12-13 10:27:08,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:08,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:27:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:08,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:27:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:27:08,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 65 [2022-12-13 10:27:08,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 154 transitions, 3514 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:27:08,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:08,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 65 [2022-12-13 10:27:08,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:08,518 INFO L130 PetriNetUnfolder]: 498/909 cut-off events. [2022-12-13 10:27:08,518 INFO L131 PetriNetUnfolder]: For 39543/39635 co-relation queries the response was YES. [2022-12-13 10:27:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 909 events. 498/909 cut-off events. For 39543/39635 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4779 event pairs, 30 based on Foata normal form. 3/912 useless extension candidates. Maximal degree in co-relation 10067. Up to 886 conditions per place. [2022-12-13 10:27:08,525 INFO L137 encePairwiseOnDemand]: 31/65 looper letters, 128 selfloop transitions, 32 changer transitions 5/166 dead transitions. [2022-12-13 10:27:08,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 166 transitions, 3859 flow [2022-12-13 10:27:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:27:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:27:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-13 10:27:08,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2153846153846154 [2022-12-13 10:27:08,526 INFO L175 Difference]: Start difference. First operand has 144 places, 154 transitions, 3514 flow. Second operand 6 states and 84 transitions. [2022-12-13 10:27:08,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 166 transitions, 3859 flow [2022-12-13 10:27:08,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 166 transitions, 3702 flow, removed 50 selfloop flow, removed 5 redundant places. [2022-12-13 10:27:08,601 INFO L231 Difference]: Finished difference. Result has 147 places, 156 transitions, 3412 flow [2022-12-13 10:27:08,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=3210, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3412, PETRI_PLACES=147, PETRI_TRANSITIONS=156} [2022-12-13 10:27:08,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 127 predicate places. [2022-12-13 10:27:08,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:08,602 INFO L89 Accepts]: Start accepts. Operand has 147 places, 156 transitions, 3412 flow [2022-12-13 10:27:08,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:08,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:08,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 156 transitions, 3412 flow [2022-12-13 10:27:08,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 156 transitions, 3412 flow [2022-12-13 10:27:08,659 INFO L130 PetriNetUnfolder]: 137/378 cut-off events. [2022-12-13 10:27:08,660 INFO L131 PetriNetUnfolder]: For 16252/16297 co-relation queries the response was YES. [2022-12-13 10:27:08,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4131 conditions, 378 events. 137/378 cut-off events. For 16252/16297 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2286 event pairs, 2 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 4029. Up to 172 conditions per place. [2022-12-13 10:27:08,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 156 transitions, 3412 flow [2022-12-13 10:27:08,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 10:27:08,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:16,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1046] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#res#1_505| v_~f2_3~0_782) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_534| |v_thread2Thread1of1ForFork1_plus_~a#1_532|) |v_thread2Thread1of1ForFork1_plus_#res#1_514|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_493| |v_thread1Thread1of1ForFork0_plus_~b#1_511|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_508| |v_thread2Thread1of1ForFork1_minus_#in~b#1_516|) (<= v_~f1_6~0_846 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_514| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_582| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_610|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_538| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_538| |v_thread2Thread1of1ForFork1_minus_#res#1_522|)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_516| v_~f1_6~0_844) (= |v_thread2Thread1of1ForFork1_plus_#res#1_514| v_~f1_6~0_844) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_504| |v_thread2Thread1of1ForFork1_plus_~a#1_532|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_504| (+ (* 233 v_~f1_6~0_846) (* 144 v_~f2_7~0_810) |v_thread2Thread1of1ForFork1_plus_#in~b#1_508|)) (<= 0 (+ v_~f1_2~0_856 2147483648)) (<= v_~f1_2~0_858 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#res#1_507| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_511| |v_thread1Thread1of1ForFork0_plus_~b#1_511|)) (= |v_thread1Thread1of1ForFork0_~i~0#1_647| 15) (= |v_thread2Thread1of1ForFork1_plus_~b#1_534| |v_thread2Thread1of1ForFork1_plus_#in~b#1_508|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_858 2147483648)) (<= v_~f2_3~0_784 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_493| |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_489| |v_thread1Thread1of1ForFork0_minus_~a#1_523|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_514| 2147483648)) (= (+ (* v_~f1_2~0_858 233) (* 144 v_~f2_3~0_784) |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_493|) (<= v_~f1_2~0_856 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_538| |v_thread2Thread1of1ForFork1_minus_#in~b#1_516|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_504| (+ (* 610 v_~f1_6~0_846) (* 377 v_~f2_7~0_810))) (= v_~f1_2~0_856 |v_thread1Thread1of1ForFork0_minus_#in~a#1_489|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_523| |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|) (= v_~f1_2~0_856 |v_thread1Thread1of1ForFork0_plus_#res#1_507|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_597|) (= |v_thread2Thread1of1ForFork1_~i~1#1_634| 15) (= |v_thread1Thread1of1ForFork0_plus_~a#1_511| |v_thread1Thread1of1ForFork0_plus_#in~a#1_493|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_582| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_538|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_538| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_538|))) 1 0)) (= v_~f2_7~0_808 |v_thread2Thread1of1ForFork1_minus_#res#1_522|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_523| |v_thread1Thread1of1ForFork0_minus_#res#1_505|) |v_thread1Thread1of1ForFork0_minus_~a#1_523|) (<= 0 (+ v_~f1_6~0_846 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_523|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_523| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_523|))) 1 0)) (= (* 2 |v_thread1Thread1of1ForFork0_plus_#in~a#1_493|) (+ (* v_~f1_2~0_858 89) (* 55 v_~f2_3~0_784) (* 3 |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|))) (= |v_thread2Thread1of1ForFork1_minus_~a#1_538| |v_thread2Thread1of1ForFork1_minus_#in~a#1_516|) (< 14 v_~n_0~0_437)) InVars {~f1_2~0=v_~f1_2~0_858, ~f2_3~0=v_~f2_3~0_784, ~n_0~0=v_~n_0~0_437, ~f2_7~0=v_~f2_7~0_810, ~f1_6~0=v_~f1_6~0_846} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_457|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_489|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_532|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_460|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_522|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_582|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_493|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_634|, ~f1_6~0=v_~f1_6~0_844, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_465|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_538|, ~f1_2~0=v_~f1_2~0_856, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_516|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_514|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_442|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_534|, ~n_0~0=v_~n_0~0_437, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_452|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_597|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_516|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_504|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_505|, ~f2_3~0=v_~f2_3~0_782, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_511|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_538|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_511|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_508|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_610|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_491|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_523|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_647|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_523|, ~f2_7~0=v_~f2_7~0_808, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_507|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_493|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_465|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [1056] L44-5-->L54-5: Formula: (and (= |v_thread2Thread1of1ForFork1_minus_~b#1_550| |v_thread2Thread1of1ForFork1_minus_#in~b#1_528|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_520| v_~f2_7~0_829) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_526| 2147483648)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_594| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_622|) (= v_~l_4~0_182 (ite (< 0 v_~f1_2~0_886) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_594| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_550| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_550|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_550|)) 1 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_141| 0) (<= 0 (+ v_~f2_7~0_828 2147483648)) (< |v_thread2Thread1of1ForFork1_~i~1#1_651| v_~n_0~0_449) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_528| v_~f1_6~0_868) (<= v_~f2_7~0_828 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_550| |v_thread2Thread1of1ForFork1_minus_#in~a#1_528|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_669| v_~n_0~0_449)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_546| |v_thread2Thread1of1ForFork1_plus_~a#1_544|) |v_thread2Thread1of1ForFork1_plus_#res#1_526|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_526| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_526| v_~f1_6~0_868) (= v_~f2_7~0_828 |v_thread2Thread1of1ForFork1_minus_#res#1_534|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_550| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_550| |v_thread2Thread1of1ForFork1_minus_#res#1_534|)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_516| v_~f1_6~0_869) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_516| |v_thread2Thread1of1ForFork1_plus_~a#1_544|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_651| 1) |v_thread2Thread1of1ForFork1_~i~1#1_650|) (= |v_thread1Thread1of1ForFork0_#res#1.base_141| 0) (= |v_thread2Thread1of1ForFork1_plus_~b#1_546| |v_thread2Thread1of1ForFork1_plus_#in~b#1_520|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_528| v_~f2_7~0_829)) InVars {~f1_2~0=v_~f1_2~0_886, ~n_0~0=v_~n_0~0_449, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_669|, ~f2_7~0=v_~f2_7~0_829, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_651|, ~f1_6~0=v_~f1_6~0_869} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_516|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_469|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_141|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_550|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_544|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_534|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_594|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_650|, ~f1_6~0=v_~f1_6~0_868, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_477|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_520|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_550|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_622|, ~f1_2~0=v_~f1_2~0_886, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_528|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_526|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_546|, ~n_0~0=v_~n_0~0_449, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_669|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_528|, ~f2_7~0=v_~f2_7~0_828, ~l_4~0=v_~l_4~0_182, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_477|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_141|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, ~l_4~0, thread2Thread1of1ForFork1_#t~ret6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:27:16,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1046] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#res#1_505| v_~f2_3~0_782) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_534| |v_thread2Thread1of1ForFork1_plus_~a#1_532|) |v_thread2Thread1of1ForFork1_plus_#res#1_514|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_493| |v_thread1Thread1of1ForFork0_plus_~b#1_511|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_508| |v_thread2Thread1of1ForFork1_minus_#in~b#1_516|) (<= v_~f1_6~0_846 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_514| 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_582| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_610|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_538| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_538| |v_thread2Thread1of1ForFork1_minus_#res#1_522|)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_516| v_~f1_6~0_844) (= |v_thread2Thread1of1ForFork1_plus_#res#1_514| v_~f1_6~0_844) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_504| |v_thread2Thread1of1ForFork1_plus_~a#1_532|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_504| (+ (* 233 v_~f1_6~0_846) (* 144 v_~f2_7~0_810) |v_thread2Thread1of1ForFork1_plus_#in~b#1_508|)) (<= 0 (+ v_~f1_2~0_856 2147483648)) (<= v_~f1_2~0_858 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#res#1_507| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_511| |v_thread1Thread1of1ForFork0_plus_~b#1_511|)) (= |v_thread1Thread1of1ForFork0_~i~0#1_647| 15) (= |v_thread2Thread1of1ForFork1_plus_~b#1_534| |v_thread2Thread1of1ForFork1_plus_#in~b#1_508|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_858 2147483648)) (<= v_~f2_3~0_784 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_493| |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_489| |v_thread1Thread1of1ForFork0_minus_~a#1_523|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_514| 2147483648)) (= (+ (* v_~f1_2~0_858 233) (* 144 v_~f2_3~0_784) |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_493|) (<= v_~f1_2~0_856 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~b#1_538| |v_thread2Thread1of1ForFork1_minus_#in~b#1_516|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_504| (+ (* 610 v_~f1_6~0_846) (* 377 v_~f2_7~0_810))) (= v_~f1_2~0_856 |v_thread1Thread1of1ForFork0_minus_#in~a#1_489|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_523| |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|) (= v_~f1_2~0_856 |v_thread1Thread1of1ForFork0_plus_#res#1_507|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_597|) (= |v_thread2Thread1of1ForFork1_~i~1#1_634| 15) (= |v_thread1Thread1of1ForFork0_plus_~a#1_511| |v_thread1Thread1of1ForFork0_plus_#in~a#1_493|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_582| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_538|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_538| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_538|))) 1 0)) (= v_~f2_7~0_808 |v_thread2Thread1of1ForFork1_minus_#res#1_522|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_523| |v_thread1Thread1of1ForFork0_minus_#res#1_505|) |v_thread1Thread1of1ForFork0_minus_~a#1_523|) (<= 0 (+ v_~f1_6~0_846 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_523|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_523| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_523|))) 1 0)) (= (* 2 |v_thread1Thread1of1ForFork0_plus_#in~a#1_493|) (+ (* v_~f1_2~0_858 89) (* 55 v_~f2_3~0_784) (* 3 |v_thread1Thread1of1ForFork0_minus_#in~b#1_491|))) (= |v_thread2Thread1of1ForFork1_minus_~a#1_538| |v_thread2Thread1of1ForFork1_minus_#in~a#1_516|) (< 14 v_~n_0~0_437)) InVars {~f1_2~0=v_~f1_2~0_858, ~f2_3~0=v_~f2_3~0_784, ~n_0~0=v_~n_0~0_437, ~f2_7~0=v_~f2_7~0_810, ~f1_6~0=v_~f1_6~0_846} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_457|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_489|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_532|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_460|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_522|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_582|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_493|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_634|, ~f1_6~0=v_~f1_6~0_844, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_465|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_538|, ~f1_2~0=v_~f1_2~0_856, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_516|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_514|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_442|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_534|, ~n_0~0=v_~n_0~0_437, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_452|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_597|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_516|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_504|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_505|, ~f2_3~0=v_~f2_3~0_782, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_511|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_538|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_511|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_508|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_610|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_491|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_565|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_523|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_647|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_523|, ~f2_7~0=v_~f2_7~0_808, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_507|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_493|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_465|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:22,895 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 605 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:27:25,185 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:27:25,186 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16584 [2022-12-13 10:27:25,186 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 155 transitions, 3451 flow [2022-12-13 10:27:25,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:27:25,186 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:25,186 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:25,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 10:27:25,187 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:25,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1359876945, now seen corresponding path program 1 times [2022-12-13 10:27:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298636625] [2022-12-13 10:27:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:25,230 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-13 10:27:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:25,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298636625] [2022-12-13 10:27:25,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298636625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:25,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:25,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:27:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042462130] [2022-12-13 10:27:25,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:25,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:27:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:27:25,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:27:25,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 10:27:25,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 155 transitions, 3451 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-13 10:27:25,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:25,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 10:27:25,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:25,488 INFO L130 PetriNetUnfolder]: 507/920 cut-off events. [2022-12-13 10:27:25,488 INFO L131 PetriNetUnfolder]: For 41028/41028 co-relation queries the response was YES. [2022-12-13 10:27:25,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10196 conditions, 920 events. 507/920 cut-off events. For 41028/41028 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4747 event pairs, 131 based on Foata normal form. 10/930 useless extension candidates. Maximal degree in co-relation 10075. Up to 757 conditions per place. [2022-12-13 10:27:25,496 INFO L137 encePairwiseOnDemand]: 38/66 looper letters, 118 selfloop transitions, 45 changer transitions 1/164 dead transitions. [2022-12-13 10:27:25,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 164 transitions, 3939 flow [2022-12-13 10:27:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:27:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:27:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 10:27:25,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 10:27:25,497 INFO L175 Difference]: Start difference. First operand has 145 places, 155 transitions, 3451 flow. Second operand 3 states and 72 transitions. [2022-12-13 10:27:25,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 164 transitions, 3939 flow [2022-12-13 10:27:25,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 164 transitions, 3863 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-13 10:27:25,574 INFO L231 Difference]: Finished difference. Result has 145 places, 156 transitions, 3525 flow [2022-12-13 10:27:25,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3525, PETRI_PLACES=145, PETRI_TRANSITIONS=156} [2022-12-13 10:27:25,575 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 125 predicate places. [2022-12-13 10:27:25,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:25,575 INFO L89 Accepts]: Start accepts. Operand has 145 places, 156 transitions, 3525 flow [2022-12-13 10:27:25,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:25,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:25,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 156 transitions, 3525 flow [2022-12-13 10:27:25,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 156 transitions, 3525 flow [2022-12-13 10:27:25,643 INFO L130 PetriNetUnfolder]: 140/377 cut-off events. [2022-12-13 10:27:25,643 INFO L131 PetriNetUnfolder]: For 18192/18237 co-relation queries the response was YES. [2022-12-13 10:27:25,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 377 events. 140/377 cut-off events. For 18192/18237 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2221 event pairs, 2 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 4160. Up to 177 conditions per place. [2022-12-13 10:27:25,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 156 transitions, 3525 flow [2022-12-13 10:27:25,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 10:27:25,654 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:27:25,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 10:27:25,654 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 155 transitions, 3495 flow [2022-12-13 10:27:25,654 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-13 10:27:25,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:25,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:25,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 10:27:25,654 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:25,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1817807088, now seen corresponding path program 1 times [2022-12-13 10:27:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:25,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546844399] [2022-12-13 10:27:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:25,672 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-13 10:27:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:25,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546844399] [2022-12-13 10:27:25,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546844399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:25,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:25,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:27:25,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475423092] [2022-12-13 10:27:25,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:25,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:27:25,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:25,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:27:25,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:27:25,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-13 10:27:25,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 155 transitions, 3495 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:27:25,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:25,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-13 10:27:25,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:25,949 INFO L130 PetriNetUnfolder]: 507/921 cut-off events. [2022-12-13 10:27:25,949 INFO L131 PetriNetUnfolder]: For 43844/43934 co-relation queries the response was YES. [2022-12-13 10:27:25,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10499 conditions, 921 events. 507/921 cut-off events. For 43844/43934 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4782 event pairs, 153 based on Foata normal form. 6/927 useless extension candidates. Maximal degree in co-relation 10026. Up to 839 conditions per place. [2022-12-13 10:27:25,957 INFO L137 encePairwiseOnDemand]: 53/63 looper letters, 140 selfloop transitions, 20 changer transitions 0/161 dead transitions. [2022-12-13 10:27:25,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 161 transitions, 3950 flow [2022-12-13 10:27:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:27:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:27:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 10:27:25,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 10:27:25,957 INFO L175 Difference]: Start difference. First operand has 144 places, 155 transitions, 3495 flow. Second operand 3 states and 72 transitions. [2022-12-13 10:27:25,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 161 transitions, 3950 flow [2022-12-13 10:27:26,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 161 transitions, 3828 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-13 10:27:26,029 INFO L231 Difference]: Finished difference. Result has 144 places, 156 transitions, 3479 flow [2022-12-13 10:27:26,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=3379, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3479, PETRI_PLACES=144, PETRI_TRANSITIONS=156} [2022-12-13 10:27:26,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 124 predicate places. [2022-12-13 10:27:26,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:26,030 INFO L89 Accepts]: Start accepts. Operand has 144 places, 156 transitions, 3479 flow [2022-12-13 10:27:26,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:26,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:26,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 156 transitions, 3479 flow [2022-12-13 10:27:26,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 156 transitions, 3479 flow [2022-12-13 10:27:26,092 INFO L130 PetriNetUnfolder]: 141/386 cut-off events. [2022-12-13 10:27:26,092 INFO L131 PetriNetUnfolder]: For 17626/17671 co-relation queries the response was YES. [2022-12-13 10:27:26,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 386 events. 141/386 cut-off events. For 17626/17671 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2321 event pairs, 3 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 4144. Up to 178 conditions per place. [2022-12-13 10:27:26,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 156 transitions, 3479 flow [2022-12-13 10:27:26,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 10:27:26,097 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:27:26,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 10:27:26,098 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 156 transitions, 3479 flow [2022-12-13 10:27:26,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:27:26,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:26,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:26,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 10:27:26,099 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1652689812, now seen corresponding path program 1 times [2022-12-13 10:27:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:26,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59412481] [2022-12-13 10:27:26,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:26,355 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-13 10:27:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:26,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59412481] [2022-12-13 10:27:26,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59412481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:26,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:26,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:27:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247678250] [2022-12-13 10:27:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:26,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:27:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:26,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:27:26,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:27:26,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 63 [2022-12-13 10:27:26,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 156 transitions, 3479 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:27:26,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:26,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 63 [2022-12-13 10:27:26,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:27,094 INFO L130 PetriNetUnfolder]: 518/943 cut-off events. [2022-12-13 10:27:27,094 INFO L131 PetriNetUnfolder]: For 39825/39915 co-relation queries the response was YES. [2022-12-13 10:27:27,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10620 conditions, 943 events. 518/943 cut-off events. For 39825/39915 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4999 event pairs, 32 based on Foata normal form. 1/944 useless extension candidates. Maximal degree in co-relation 10160. Up to 920 conditions per place. [2022-12-13 10:27:27,101 INFO L137 encePairwiseOnDemand]: 30/63 looper letters, 132 selfloop transitions, 32 changer transitions 5/170 dead transitions. [2022-12-13 10:27:27,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 170 transitions, 3979 flow [2022-12-13 10:27:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:27:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:27:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-13 10:27:27,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21957671957671956 [2022-12-13 10:27:27,102 INFO L175 Difference]: Start difference. First operand has 144 places, 156 transitions, 3479 flow. Second operand 6 states and 83 transitions. [2022-12-13 10:27:27,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 170 transitions, 3979 flow [2022-12-13 10:27:27,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 170 transitions, 3947 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 10:27:27,178 INFO L231 Difference]: Finished difference. Result has 151 places, 160 transitions, 3649 flow [2022-12-13 10:27:27,178 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=3447, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3649, PETRI_PLACES=151, PETRI_TRANSITIONS=160} [2022-12-13 10:27:27,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 131 predicate places. [2022-12-13 10:27:27,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:27,179 INFO L89 Accepts]: Start accepts. Operand has 151 places, 160 transitions, 3649 flow [2022-12-13 10:27:27,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:27,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:27,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 160 transitions, 3649 flow [2022-12-13 10:27:27,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 160 transitions, 3649 flow [2022-12-13 10:27:27,233 INFO L130 PetriNetUnfolder]: 143/390 cut-off events. [2022-12-13 10:27:27,233 INFO L131 PetriNetUnfolder]: For 18296/18341 co-relation queries the response was YES. [2022-12-13 10:27:27,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4433 conditions, 390 events. 143/390 cut-off events. For 18296/18341 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2361 event pairs, 2 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 4329. Up to 180 conditions per place. [2022-12-13 10:27:27,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 160 transitions, 3649 flow [2022-12-13 10:27:27,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 10:27:27,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1062] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#res#1_527| v_~f2_3~0_820) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_536| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_515| |v_thread1Thread1of1ForFork0_minus_#in~b#1_513|) (= (+ (* v_~f1_2~0_898 987) (* 610 v_~f2_3~0_822)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_515|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_556| |v_thread2Thread1of1ForFork1_plus_~a#1_554|) |v_thread2Thread1of1ForFork1_plus_#res#1_536|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_898 2147483648)) (<= v_~f2_3~0_822 0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_545| |v_thread1Thread1of1ForFork0_minus_#res#1_527|) |v_thread1Thread1of1ForFork0_minus_~a#1_545|) (<= 0 (+ v_~f1_2~0_896 2147483648)) (= v_~f1_2~0_896 |v_thread1Thread1of1ForFork0_minus_#in~a#1_511|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_560| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_560| |v_thread2Thread1of1ForFork1_minus_#res#1_544|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_587| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_619|) (< 15 v_~n_0~0_455) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_536| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_526| (+ (* v_~f1_6~0_886 987) (* 610 v_~f2_7~0_846))) (<= v_~f1_2~0_898 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_632|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_511| |v_thread1Thread1of1ForFork0_minus_~a#1_545|) (= (+ (* 610 v_~f1_6~0_886) (* 377 v_~f2_7~0_846)) |v_thread2Thread1of1ForFork1_plus_#in~b#1_530|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_536| v_~f1_6~0_884) (<= 0 (+ v_~f1_6~0_886 2147483648)) (= |v_thread1Thread1of1ForFork0_~i~0#1_675| 16) (= |v_thread2Thread1of1ForFork1_minus_~b#1_560| |v_thread2Thread1of1ForFork1_minus_#in~b#1_538|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_560| |v_thread2Thread1of1ForFork1_minus_#in~a#1_538|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_515| |v_thread1Thread1of1ForFork0_plus_~b#1_533|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_545| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_545|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_545|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_587|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_533| |v_thread1Thread1of1ForFork0_plus_#in~a#1_515|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_526| |v_thread2Thread1of1ForFork1_plus_~a#1_554|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_530| |v_thread2Thread1of1ForFork1_minus_#in~b#1_538|) (= 16 |v_thread2Thread1of1ForFork1_~i~1#1_662|) (= v_~f2_7~0_844 |v_thread2Thread1of1ForFork1_minus_#res#1_544|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_545| |v_thread1Thread1of1ForFork0_minus_#in~b#1_513|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_556| |v_thread2Thread1of1ForFork1_plus_#in~b#1_530|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_529| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_533| |v_thread1Thread1of1ForFork0_plus_~b#1_533|)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_515| (* 233 v_~f2_3~0_822) (* v_~f1_2~0_898 377)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_515|) (<= v_~f1_2~0_896 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_560|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_560| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_560|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_538| v_~f1_6~0_884) (= v_~f1_2~0_896 |v_thread1Thread1of1ForFork0_plus_#res#1_529|) (<= v_~f1_6~0_886 2147483647)) InVars {~f1_2~0=v_~f1_2~0_898, ~f2_3~0=v_~f2_3~0_822, ~n_0~0=v_~n_0~0_455, ~f2_7~0=v_~f2_7~0_846, ~f1_6~0=v_~f1_6~0_886} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_479|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_511|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_554|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_482|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_544|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_515|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_662|, ~f1_6~0=v_~f1_6~0_884, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_487|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_560|, ~f1_2~0=v_~f1_2~0_896, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_538|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_536|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_464|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_556|, ~n_0~0=v_~n_0~0_455, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_474|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_619|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_538|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_526|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_527|, ~f2_3~0=v_~f2_3~0_820, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_533|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_560|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_533|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_530|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_632|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_513|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_587|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_545|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_675|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_545|, ~f2_7~0=v_~f2_7~0_844, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_529|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_515|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_487|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:34,332 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 629 DAG size of output: 608 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:27:36,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1062] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_#res#1_527| v_~f2_3~0_820) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_536| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_515| |v_thread1Thread1of1ForFork0_minus_#in~b#1_513|) (= (+ (* v_~f1_2~0_898 987) (* 610 v_~f2_3~0_822)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_515|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_556| |v_thread2Thread1of1ForFork1_plus_~a#1_554|) |v_thread2Thread1of1ForFork1_plus_#res#1_536|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_898 2147483648)) (<= v_~f2_3~0_822 0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_545| |v_thread1Thread1of1ForFork0_minus_#res#1_527|) |v_thread1Thread1of1ForFork0_minus_~a#1_545|) (<= 0 (+ v_~f1_2~0_896 2147483648)) (= v_~f1_2~0_896 |v_thread1Thread1of1ForFork0_minus_#in~a#1_511|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_560| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_560| |v_thread2Thread1of1ForFork1_minus_#res#1_544|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_587| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_619|) (< 15 v_~n_0~0_455) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_536| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_526| (+ (* v_~f1_6~0_886 987) (* 610 v_~f2_7~0_846))) (<= v_~f1_2~0_898 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_632|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_511| |v_thread1Thread1of1ForFork0_minus_~a#1_545|) (= (+ (* 610 v_~f1_6~0_886) (* 377 v_~f2_7~0_846)) |v_thread2Thread1of1ForFork1_plus_#in~b#1_530|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_536| v_~f1_6~0_884) (<= 0 (+ v_~f1_6~0_886 2147483648)) (= |v_thread1Thread1of1ForFork0_~i~0#1_675| 16) (= |v_thread2Thread1of1ForFork1_minus_~b#1_560| |v_thread2Thread1of1ForFork1_minus_#in~b#1_538|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_560| |v_thread2Thread1of1ForFork1_minus_#in~a#1_538|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_515| |v_thread1Thread1of1ForFork0_plus_~b#1_533|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_545| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_545|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_545|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_587|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_533| |v_thread1Thread1of1ForFork0_plus_#in~a#1_515|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_526| |v_thread2Thread1of1ForFork1_plus_~a#1_554|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_530| |v_thread2Thread1of1ForFork1_minus_#in~b#1_538|) (= 16 |v_thread2Thread1of1ForFork1_~i~1#1_662|) (= v_~f2_7~0_844 |v_thread2Thread1of1ForFork1_minus_#res#1_544|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_545| |v_thread1Thread1of1ForFork0_minus_#in~b#1_513|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_556| |v_thread2Thread1of1ForFork1_plus_#in~b#1_530|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_529| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_533| |v_thread1Thread1of1ForFork0_plus_~b#1_533|)) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_515| (* 233 v_~f2_3~0_822) (* v_~f1_2~0_898 377)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_515|) (<= v_~f1_2~0_896 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_560|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_560| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_560|))) 1 0)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_538| v_~f1_6~0_884) (= v_~f1_2~0_896 |v_thread1Thread1of1ForFork0_plus_#res#1_529|) (<= v_~f1_6~0_886 2147483647)) InVars {~f1_2~0=v_~f1_2~0_898, ~f2_3~0=v_~f2_3~0_822, ~n_0~0=v_~n_0~0_455, ~f2_7~0=v_~f2_7~0_846, ~f1_6~0=v_~f1_6~0_886} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_479|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_511|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_554|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_482|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_544|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_604|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_515|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_662|, ~f1_6~0=v_~f1_6~0_884, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_487|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_560|, ~f1_2~0=v_~f1_2~0_896, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_538|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_536|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_464|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_556|, ~n_0~0=v_~n_0~0_455, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_474|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_619|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_538|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_526|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_527|, ~f2_3~0=v_~f2_3~0_820, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_533|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_560|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_533|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_530|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_632|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_513|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_587|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_545|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_675|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_545|, ~f2_7~0=v_~f2_7~0_844, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_529|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_515|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_487|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:27:49,762 WARN L233 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 566 DAG size of output: 558 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:27:52,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1066] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_534| |v_thread2Thread1of1ForFork1_plus_~a#1_562|) (= v_~f1_2~0_908 |v_thread1Thread1of1ForFork0_minus_#in~a#1_519|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_523| |v_thread1Thread1of1ForFork0_plus_~b#1_541|) (<= v_~f1_2~0_908 2147483647) (<= v_~f1_6~0_897 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_544| v_~f1_6~0_896) (= |v_thread2Thread1of1ForFork1_plus_~b#1_564| |v_thread2Thread1of1ForFork1_plus_#in~b#1_538|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_534| (+ (* v_~f1_6~0_897 987) (* 610 v_~f2_7~0_857))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_595| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_627|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_544| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_523| |v_thread1Thread1of1ForFork0_minus_#in~b#1_521|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_538| |v_thread2Thread1of1ForFork1_minus_#in~b#1_546|) (= 16 |v_thread2Thread1of1ForFork1_~i~1#1_670|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_568| |v_thread2Thread1of1ForFork1_minus_#in~b#1_546|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_538| (+ (* 610 v_~f1_6~0_897) (* 377 v_~f2_7~0_857))) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_683| v_~n_0~0_459)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_595| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_553|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_553| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_553|))) 1 0)) (= v_~l_4~0_186 (ite (< 0 v_~f1_2~0_908) 1 0)) (= (+ (* 233 v_~f2_3~0_833) (* v_~f1_2~0_909 377) |v_thread1Thread1of1ForFork0_plus_#in~b#1_523|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_523|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_568| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_568| |v_thread2Thread1of1ForFork1_minus_#res#1_552|)) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_544| 2147483648)) (= v_~f1_2~0_908 |v_thread1Thread1of1ForFork0_plus_#res#1_537|) (<= v_~f1_2~0_909 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_546| v_~f1_6~0_896) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_564| |v_thread2Thread1of1ForFork1_plus_~a#1_562|) |v_thread2Thread1of1ForFork1_plus_#res#1_544|) (<= 0 (+ v_~f1_2~0_908 2147483648)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_145| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_145| 0) (= |v_thread1Thread1of1ForFork0_plus_#res#1_537| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_541| |v_thread1Thread1of1ForFork0_plus_~b#1_541|)) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_523| (+ (* v_~f1_2~0_909 987) (* 610 v_~f2_3~0_833))) (not (= (ite (or (<= 0 (+ v_~f1_2~0_909 2147483648)) (<= v_~f2_3~0_833 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_553| |v_thread1Thread1of1ForFork0_minus_#in~b#1_521|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_612| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_568|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_568| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_568|))) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_541| |v_thread1Thread1of1ForFork0_plus_#in~a#1_523|) (< 15 v_~n_0~0_459) (= v_~f2_7~0_856 |v_thread2Thread1of1ForFork1_minus_#res#1_552|) (<= 0 (+ v_~f1_6~0_897 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_568| |v_thread2Thread1of1ForFork1_minus_#in~a#1_546|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_535| v_~f2_3~0_832) (= |v_thread1Thread1of1ForFork0_~i~0#1_683| 16) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_612| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_640|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_519| |v_thread1Thread1of1ForFork0_minus_~a#1_553|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_553| |v_thread1Thread1of1ForFork0_minus_#res#1_535|) |v_thread1Thread1of1ForFork0_minus_~a#1_553|)) InVars {~f1_2~0=v_~f1_2~0_909, ~f2_3~0=v_~f2_3~0_833, ~n_0~0=v_~n_0~0_459, ~f2_7~0=v_~f2_7~0_857, ~f1_6~0=v_~f1_6~0_897} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_487|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_519|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_562|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_490|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_552|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_612|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_523|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_670|, ~f1_6~0=v_~f1_6~0_896, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_495|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_568|, ~f1_2~0=v_~f1_2~0_908, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_546|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_544|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_472|, ~n_0~0=v_~n_0~0_459, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_564|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_482|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_627|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_546|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_145|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_534|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_535|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_145|, ~f2_3~0=v_~f2_3~0_832, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_541|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_568|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_541|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_538|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_640|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_521|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_595|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_553|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_683|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_553|, ~f2_7~0=v_~f2_7~0_856, ~l_4~0=v_~l_4~0_186, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_537|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_523|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_495|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:52,164 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:27:52,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24986 [2022-12-13 10:27:52,165 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 159 transitions, 3688 flow [2022-12-13 10:27:52,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:27:52,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:52,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:52,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 10:27:52,166 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash -582727346, now seen corresponding path program 1 times [2022-12-13 10:27:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:52,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057316034] [2022-12-13 10:27:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:52,561 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-13 10:27:52,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:52,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057316034] [2022-12-13 10:27:52,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057316034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:52,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:52,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:27:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681358970] [2022-12-13 10:27:52,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:52,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:27:52,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:27:52,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:27:52,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 66 [2022-12-13 10:27:52,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 159 transitions, 3688 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:27:52,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:52,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 66 [2022-12-13 10:27:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:53,028 INFO L130 PetriNetUnfolder]: 525/960 cut-off events. [2022-12-13 10:27:53,028 INFO L131 PetriNetUnfolder]: For 44631/44733 co-relation queries the response was YES. [2022-12-13 10:27:53,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11015 conditions, 960 events. 525/960 cut-off events. For 44631/44733 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5150 event pairs, 33 based on Foata normal form. 3/963 useless extension candidates. Maximal degree in co-relation 10889. Up to 888 conditions per place. [2022-12-13 10:27:53,036 INFO L137 encePairwiseOnDemand]: 34/66 looper letters, 136 selfloop transitions, 35 changer transitions 6/178 dead transitions. [2022-12-13 10:27:53,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 178 transitions, 4320 flow [2022-12-13 10:27:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:27:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:27:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 10:27:53,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-13 10:27:53,037 INFO L175 Difference]: Start difference. First operand has 149 places, 159 transitions, 3688 flow. Second operand 5 states and 90 transitions. [2022-12-13 10:27:53,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 178 transitions, 4320 flow [2022-12-13 10:27:53,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 178 transitions, 4242 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 10:27:53,119 INFO L231 Difference]: Finished difference. Result has 153 places, 162 transitions, 3828 flow [2022-12-13 10:27:53,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3534, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3828, PETRI_PLACES=153, PETRI_TRANSITIONS=162} [2022-12-13 10:27:53,119 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 133 predicate places. [2022-12-13 10:27:53,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:53,119 INFO L89 Accepts]: Start accepts. Operand has 153 places, 162 transitions, 3828 flow [2022-12-13 10:27:53,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:53,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:53,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 162 transitions, 3828 flow [2022-12-13 10:27:53,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 162 transitions, 3828 flow [2022-12-13 10:27:53,194 INFO L130 PetriNetUnfolder]: 145/400 cut-off events. [2022-12-13 10:27:53,194 INFO L131 PetriNetUnfolder]: For 20659/20706 co-relation queries the response was YES. [2022-12-13 10:27:53,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4693 conditions, 400 events. 145/400 cut-off events. For 20659/20706 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2467 event pairs, 3 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 4585. Up to 183 conditions per place. [2022-12-13 10:27:53,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 162 transitions, 3828 flow [2022-12-13 10:27:53,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 10:27:53,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:27:53,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:27:53,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:27:54,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:27:54,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:27:54,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1198 [2022-12-13 10:27:54,317 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 164 transitions, 4031 flow [2022-12-13 10:27:54,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:27:54,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:54,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:54,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-13 10:27:54,317 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash -151615692, now seen corresponding path program 2 times [2022-12-13 10:27:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:54,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829293708] [2022-12-13 10:27:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:27:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:54,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829293708] [2022-12-13 10:27:54,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829293708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:54,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:54,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:27:54,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510586147] [2022-12-13 10:27:54,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:54,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:27:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:54,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:27:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:27:54,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 68 [2022-12-13 10:27:54,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 164 transitions, 4031 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:27:54,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:54,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 68 [2022-12-13 10:27:54,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:54,860 INFO L130 PetriNetUnfolder]: 522/947 cut-off events. [2022-12-13 10:27:54,860 INFO L131 PetriNetUnfolder]: For 45390/45484 co-relation queries the response was YES. [2022-12-13 10:27:54,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11232 conditions, 947 events. 522/947 cut-off events. For 45390/45484 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4953 event pairs, 28 based on Foata normal form. 1/948 useless extension candidates. Maximal degree in co-relation 11107. Up to 924 conditions per place. [2022-12-13 10:27:54,868 INFO L137 encePairwiseOnDemand]: 35/68 looper letters, 134 selfloop transitions, 32 changer transitions 5/172 dead transitions. [2022-12-13 10:27:54,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 172 transitions, 4241 flow [2022-12-13 10:27:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:27:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:27:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-13 10:27:54,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20588235294117646 [2022-12-13 10:27:54,869 INFO L175 Difference]: Start difference. First operand has 151 places, 164 transitions, 4031 flow. Second operand 6 states and 84 transitions. [2022-12-13 10:27:54,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 172 transitions, 4241 flow [2022-12-13 10:27:54,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 172 transitions, 4141 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-13 10:27:54,962 INFO L231 Difference]: Finished difference. Result has 154 places, 162 transitions, 3837 flow [2022-12-13 10:27:54,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3726, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3837, PETRI_PLACES=154, PETRI_TRANSITIONS=162} [2022-12-13 10:27:54,963 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 134 predicate places. [2022-12-13 10:27:54,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:54,963 INFO L89 Accepts]: Start accepts. Operand has 154 places, 162 transitions, 3837 flow [2022-12-13 10:27:54,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:54,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:54,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 162 transitions, 3837 flow [2022-12-13 10:27:54,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 162 transitions, 3837 flow [2022-12-13 10:27:55,024 INFO L130 PetriNetUnfolder]: 145/396 cut-off events. [2022-12-13 10:27:55,024 INFO L131 PetriNetUnfolder]: For 18626/18673 co-relation queries the response was YES. [2022-12-13 10:27:55,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4562 conditions, 396 events. 145/396 cut-off events. For 18626/18673 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2385 event pairs, 2 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 4457. Up to 182 conditions per place. [2022-12-13 10:27:55,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 162 transitions, 3837 flow [2022-12-13 10:27:55,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 10:27:55,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:55,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1026] $Ultimate##0-->L44-5: Formula: (and (<= |v_thread2Thread1of1ForFork1_plus_#res#1_502| 2147483647) (= v_~f1_2~0_794 |v_thread1Thread1of1ForFork0_plus_#res#1_464|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_570| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_598|) (not (= (ite (or (<= v_~f2_3~0_722 0) (<= 0 (+ v_~f1_2~0_796 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_450| |v_thread1Thread1of1ForFork0_minus_#in~b#1_448|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_492| |v_thread2Thread1of1ForFork1_plus_~a#1_520|) (= (+ (* v_~f1_2~0_796 2) v_~f2_3~0_722) |v_thread1Thread1of1ForFork0_plus_#in~a#1_450|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_480| |v_thread1Thread1of1ForFork0_minus_#in~b#1_448|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_522| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_554|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_504| v_~f1_6~0_822) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_496| |v_thread2Thread1of1ForFork1_minus_#in~b#1_504|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_522| |v_thread2Thread1of1ForFork1_plus_~a#1_520|) |v_thread2Thread1of1ForFork1_plus_#res#1_502|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_492| (+ (* 2 v_~f1_6~0_823) v_~f2_7~0_787)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_522| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_480|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_480| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_480|))) 1 0)) (= (+ |v_thread2Thread1of1ForFork1_minus_#in~b#1_504| v_~f1_6~0_823) |v_thread2Thread1of1ForFork1_plus_#in~a#1_492|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_570| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_526|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_526| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_526|))) 1 0)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_446| |v_thread1Thread1of1ForFork0_minus_~a#1_480|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_526| |v_thread2Thread1of1ForFork1_minus_#in~b#1_504|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_502| v_~f1_6~0_822) (= |v_thread2Thread1of1ForFork1_minus_~a#1_526| |v_thread2Thread1of1ForFork1_minus_#in~a#1_504|) (= (+ v_~f1_2~0_796 |v_thread1Thread1of1ForFork0_plus_#in~b#1_450|) |v_thread1Thread1of1ForFork0_plus_#in~a#1_450|) (< |v_thread1Thread1of1ForFork0_~i~0#1_595| (+ v_~n_0~0_415 1)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_450| |v_thread1Thread1of1ForFork0_plus_~b#1_468|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_464| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_468| |v_thread1Thread1of1ForFork0_plus_~b#1_468|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_526| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_526| |v_thread2Thread1of1ForFork1_minus_#res#1_510|)) (= |v_thread1Thread1of1ForFork0_~i~0#1_595| 3) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_622|) (<= v_~f1_2~0_794 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_468| |v_thread1Thread1of1ForFork0_plus_#in~a#1_450|) (<= v_~f1_2~0_796 2147483647) (<= 0 (+ v_~f1_6~0_823 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_522| |v_thread2Thread1of1ForFork1_plus_#in~b#1_496|) (<= v_~f1_6~0_823 2147483647) (= v_~f2_7~0_786 |v_thread2Thread1of1ForFork1_minus_#res#1_510|) (<= 0 (+ v_~f1_2~0_794 2147483648)) (= v_~f1_2~0_794 |v_thread1Thread1of1ForFork0_minus_#in~a#1_446|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_480| |v_thread1Thread1of1ForFork0_minus_#res#1_462|) |v_thread1Thread1of1ForFork0_minus_~a#1_480|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_502| 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_#res#1_462| v_~f2_3~0_720)) InVars {~f1_2~0=v_~f1_2~0_796, ~f2_3~0=v_~f2_3~0_722, ~n_0~0=v_~n_0~0_415, ~f2_7~0=v_~f2_7~0_787, ~f1_6~0=v_~f1_6~0_823} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_445|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_446|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_420|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_520|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_450|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_510|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_570|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_622|, ~f1_6~0=v_~f1_6~0_822, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_453|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_526|, ~f1_2~0=v_~f1_2~0_794, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_402|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_504|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_502|, ~n_0~0=v_~n_0~0_415, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_522|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_412|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_554|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_504|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_492|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_462|, ~f2_3~0=v_~f2_3~0_720, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_468|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_526|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_468|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_496|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_448|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_598|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_522|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_480|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_595|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_480|, ~f2_7~0=v_~f2_7~0_786, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_464|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_450|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_453|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:27:56,985 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:27:56,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2023 [2022-12-13 10:27:56,986 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 161 transitions, 3867 flow [2022-12-13 10:27:56,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:27:56,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:27:56,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:27:56,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 10:27:56,986 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:27:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:27:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1157891617, now seen corresponding path program 1 times [2022-12-13 10:27:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:27:56,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278202378] [2022-12-13 10:27:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:27:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:27:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:27:57,134 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-13 10:27:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:27:57,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278202378] [2022-12-13 10:27:57,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278202378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:27:57,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:27:57,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:27:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942460952] [2022-12-13 10:27:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:27:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:27:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:27:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:27:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:27:57,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-13 10:27:57,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 161 transitions, 3867 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:27:57,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:27:57,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-13 10:27:57,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:27:57,582 INFO L130 PetriNetUnfolder]: 525/952 cut-off events. [2022-12-13 10:27:57,582 INFO L131 PetriNetUnfolder]: For 42424/42522 co-relation queries the response was YES. [2022-12-13 10:27:57,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11104 conditions, 952 events. 525/952 cut-off events. For 42424/42522 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4974 event pairs, 30 based on Foata normal form. 3/955 useless extension candidates. Maximal degree in co-relation 10980. Up to 929 conditions per place. [2022-12-13 10:27:57,590 INFO L137 encePairwiseOnDemand]: 31/67 looper letters, 134 selfloop transitions, 33 changer transitions 6/174 dead transitions. [2022-12-13 10:27:57,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 174 transitions, 4320 flow [2022-12-13 10:27:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:27:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:27:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-13 10:27:57,591 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21641791044776118 [2022-12-13 10:27:57,591 INFO L175 Difference]: Start difference. First operand has 151 places, 161 transitions, 3867 flow. Second operand 6 states and 87 transitions. [2022-12-13 10:27:57,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 174 transitions, 4320 flow [2022-12-13 10:27:57,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 174 transitions, 4253 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 10:27:57,676 INFO L231 Difference]: Finished difference. Result has 156 places, 163 transitions, 3920 flow [2022-12-13 10:27:57,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=3734, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3920, PETRI_PLACES=156, PETRI_TRANSITIONS=163} [2022-12-13 10:27:57,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 136 predicate places. [2022-12-13 10:27:57,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:27:57,677 INFO L89 Accepts]: Start accepts. Operand has 156 places, 163 transitions, 3920 flow [2022-12-13 10:27:57,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:27:57,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:27:57,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 163 transitions, 3920 flow [2022-12-13 10:27:57,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 163 transitions, 3920 flow [2022-12-13 10:27:57,742 INFO L130 PetriNetUnfolder]: 146/393 cut-off events. [2022-12-13 10:27:57,742 INFO L131 PetriNetUnfolder]: For 19017/19064 co-relation queries the response was YES. [2022-12-13 10:27:57,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 393 events. 146/393 cut-off events. For 19017/19064 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2330 event pairs, 1 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 4523. Up to 183 conditions per place. [2022-12-13 10:27:57,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 163 transitions, 3920 flow [2022-12-13 10:27:57,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-13 10:28:04,009 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 589 DAG size of output: 581 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:28:06,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1065] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_549| |v_thread1Thread1of1ForFork0_minus_#in~b#1_517|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_591| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_549|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_549| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_549|))) 1 0)) (<= v_~f1_6~0_892 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_530| (+ (* 610 v_~f1_6~0_892) |v_thread2Thread1of1ForFork1_plus_#in~b#1_534| (* 377 v_~f2_7~0_852))) (<= v_~f1_2~0_902 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_530| (+ (* v_~f2_7~0_852 987) (* v_~f1_6~0_892 1597))) (= |v_thread1Thread1of1ForFork0_minus_#res#1_531| v_~f2_3~0_826) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_519| (* 377 v_~f2_3~0_828) (* v_~f1_2~0_904 610)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_519|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_542| v_~f1_6~0_890) (= |v_thread2Thread1of1ForFork1_plus_#res#1_540| v_~f1_6~0_890) (= |v_thread2Thread1of1ForFork1_~i~1#1_666| 17) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_540| 2147483647) (= v_~f1_2~0_902 |v_thread1Thread1of1ForFork0_plus_#res#1_533|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_519| |v_thread1Thread1of1ForFork0_plus_~b#1_537|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_560| |v_thread2Thread1of1ForFork1_plus_#in~b#1_534|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_591| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_623|) (<= v_~f1_2~0_904 2147483647) (= (+ (* 610 v_~f2_3~0_828) (* v_~f1_2~0_904 987)) |v_thread1Thread1of1ForFork0_plus_#in~b#1_519|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_608| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_564|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_564| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_564|))) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_533| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_537| |v_thread1Thread1of1ForFork0_plus_~b#1_537|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_564| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_564| |v_thread2Thread1of1ForFork1_minus_#res#1_548|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_564| |v_thread2Thread1of1ForFork1_minus_#in~b#1_542|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_515| |v_thread1Thread1of1ForFork0_minus_~a#1_549|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_904 2147483648)) (<= v_~f2_3~0_828 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_534| |v_thread2Thread1of1ForFork1_minus_#in~b#1_542|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_564| |v_thread2Thread1of1ForFork1_minus_#in~a#1_542|) (<= 0 (+ v_~f1_6~0_892 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_530| |v_thread2Thread1of1ForFork1_plus_~a#1_558|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_537| |v_thread1Thread1of1ForFork0_plus_#in~a#1_519|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_608| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_636|) (< |v_thread1Thread1of1ForFork0_~i~0#1_679| (+ v_~n_0~0_457 1)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_519| |v_thread1Thread1of1ForFork0_minus_#in~b#1_517|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_540| 2147483648)) (= |v_thread1Thread1of1ForFork0_~i~0#1_679| 17) (= v_~f2_7~0_850 |v_thread2Thread1of1ForFork1_minus_#res#1_548|) (= v_~f1_2~0_902 |v_thread1Thread1of1ForFork0_minus_#in~a#1_515|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_549| |v_thread1Thread1of1ForFork0_minus_#res#1_531|) |v_thread1Thread1of1ForFork0_minus_~a#1_549|) (<= 0 (+ v_~f1_2~0_902 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_560| |v_thread2Thread1of1ForFork1_plus_~a#1_558|) |v_thread2Thread1of1ForFork1_plus_#res#1_540|)) InVars {~f1_2~0=v_~f1_2~0_904, ~f2_3~0=v_~f2_3~0_828, ~n_0~0=v_~n_0~0_457, ~f2_7~0=v_~f2_7~0_852, ~f1_6~0=v_~f1_6~0_892} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_483|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_515|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_558|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_486|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_548|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_608|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_519|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_666|, ~f1_6~0=v_~f1_6~0_890, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_491|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_564|, ~f1_2~0=v_~f1_2~0_902, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_542|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_540|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_468|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_560|, ~n_0~0=v_~n_0~0_457, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_478|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_623|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_542|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_530|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_531|, ~f2_3~0=v_~f2_3~0_826, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_537|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_564|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_537|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_534|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_636|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_517|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_591|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_549|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_679|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_549|, ~f2_7~0=v_~f2_7~0_850, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_533|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_519|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_491|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:28:13,985 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 652 DAG size of output: 631 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:28:16,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1065] $Ultimate##0-->L54-5: Formula: (and (= |v_thread1Thread1of1ForFork0_minus_~b#1_549| |v_thread1Thread1of1ForFork0_minus_#in~b#1_517|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_591| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_549|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_549| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_549|))) 1 0)) (<= v_~f1_6~0_892 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_530| (+ (* 610 v_~f1_6~0_892) |v_thread2Thread1of1ForFork1_plus_#in~b#1_534| (* 377 v_~f2_7~0_852))) (<= v_~f1_2~0_902 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_530| (+ (* v_~f2_7~0_852 987) (* v_~f1_6~0_892 1597))) (= |v_thread1Thread1of1ForFork0_minus_#res#1_531| v_~f2_3~0_826) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_519| (* 377 v_~f2_3~0_828) (* v_~f1_2~0_904 610)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_519|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_542| v_~f1_6~0_890) (= |v_thread2Thread1of1ForFork1_plus_#res#1_540| v_~f1_6~0_890) (= |v_thread2Thread1of1ForFork1_~i~1#1_666| 17) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_540| 2147483647) (= v_~f1_2~0_902 |v_thread1Thread1of1ForFork0_plus_#res#1_533|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_519| |v_thread1Thread1of1ForFork0_plus_~b#1_537|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_560| |v_thread2Thread1of1ForFork1_plus_#in~b#1_534|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_591| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_623|) (<= v_~f1_2~0_904 2147483647) (= (+ (* 610 v_~f2_3~0_828) (* v_~f1_2~0_904 987)) |v_thread1Thread1of1ForFork0_plus_#in~b#1_519|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_608| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_564|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_564| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_564|))) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_533| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_537| |v_thread1Thread1of1ForFork0_plus_~b#1_537|)) (= |v_thread2Thread1of1ForFork1_minus_~a#1_564| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_564| |v_thread2Thread1of1ForFork1_minus_#res#1_548|)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_564| |v_thread2Thread1of1ForFork1_minus_#in~b#1_542|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_515| |v_thread1Thread1of1ForFork0_minus_~a#1_549|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_904 2147483648)) (<= v_~f2_3~0_828 0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_534| |v_thread2Thread1of1ForFork1_minus_#in~b#1_542|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_564| |v_thread2Thread1of1ForFork1_minus_#in~a#1_542|) (<= 0 (+ v_~f1_6~0_892 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_530| |v_thread2Thread1of1ForFork1_plus_~a#1_558|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_537| |v_thread1Thread1of1ForFork0_plus_#in~a#1_519|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_608| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_636|) (< |v_thread1Thread1of1ForFork0_~i~0#1_679| (+ v_~n_0~0_457 1)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_519| |v_thread1Thread1of1ForFork0_minus_#in~b#1_517|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_540| 2147483648)) (= |v_thread1Thread1of1ForFork0_~i~0#1_679| 17) (= v_~f2_7~0_850 |v_thread2Thread1of1ForFork1_minus_#res#1_548|) (= v_~f1_2~0_902 |v_thread1Thread1of1ForFork0_minus_#in~a#1_515|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_549| |v_thread1Thread1of1ForFork0_minus_#res#1_531|) |v_thread1Thread1of1ForFork0_minus_~a#1_549|) (<= 0 (+ v_~f1_2~0_902 2147483648)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_560| |v_thread2Thread1of1ForFork1_plus_~a#1_558|) |v_thread2Thread1of1ForFork1_plus_#res#1_540|)) InVars {~f1_2~0=v_~f1_2~0_904, ~f2_3~0=v_~f2_3~0_828, ~n_0~0=v_~n_0~0_457, ~f2_7~0=v_~f2_7~0_852, ~f1_6~0=v_~f1_6~0_892} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_483|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_515|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_558|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_486|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_548|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_608|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_519|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_666|, ~f1_6~0=v_~f1_6~0_890, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_491|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_564|, ~f1_2~0=v_~f1_2~0_902, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_542|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_540|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_468|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_560|, ~n_0~0=v_~n_0~0_457, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_478|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_623|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_542|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_530|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_531|, ~f2_3~0=v_~f2_3~0_826, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_537|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_564|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_537|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_534|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_636|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_517|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_591|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_549|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_679|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_549|, ~f2_7~0=v_~f2_7~0_850, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_533|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_519|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_491|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:28:21,935 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 548 DAG size of output: 546 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:28:24,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1082] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_640| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_668|) (= |v_thread2Thread1of1ForFork1_~i~1#1_708| 17) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_566| |v_thread2Thread1of1ForFork1_minus_#in~b#1_574|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_572| v_~f1_6~0_948) (= v_~f1_2~0_956 |v_thread1Thread1of1ForFork0_minus_#in~a#1_544|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_640| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_596| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_596|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_596|)) 1 0)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_572| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_592| |v_thread2Thread1of1ForFork1_plus_~a#1_590|)) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_717| v_~n_0~0_483)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_548| |v_thread1Thread1of1ForFork0_plus_~b#1_566|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_153| 0) (= |v_thread1Thread1of1ForFork0_minus_#res#1_560| v_~f2_3~0_878) (<= v_~f1_6~0_949 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_562| (+ (* v_~f2_7~0_901 987) (* v_~f1_6~0_949 1597))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_620| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_652|) (not (= (ite (or (<= 0 (+ v_~f1_2~0_957 2147483648)) (<= v_~f2_3~0_879 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_578| |v_thread1Thread1of1ForFork0_minus_#in~b#1_546|) (< |v_thread1Thread1of1ForFork0_~i~0#1_717| (+ v_~n_0~0_483 1)) (= |v_thread2Thread1of1ForFork1_minus_~b#1_596| |v_thread2Thread1of1ForFork1_minus_#in~b#1_574|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_596| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_596| |v_thread2Thread1of1ForFork1_minus_#res#1_580|)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_578| |v_thread1Thread1of1ForFork0_minus_#res#1_560|) |v_thread1Thread1of1ForFork0_minus_~a#1_578|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_572| 2147483647) (= (+ |v_thread2Thread1of1ForFork1_plus_#in~b#1_566| (* 377 v_~f2_7~0_901) (* 610 v_~f1_6~0_949)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_562|) (= (+ (* v_~f1_2~0_957 610) |v_thread1Thread1of1ForFork0_plus_#in~b#1_548| (* 377 v_~f2_3~0_879)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_548|) (= |v_thread1Thread1of1ForFork0_~i~0#1_717| 17) (= |v_thread1Thread1of1ForFork0_plus_#res#1_562| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_566| |v_thread1Thread1of1ForFork0_plus_~b#1_566|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_544| |v_thread1Thread1of1ForFork0_minus_~a#1_578|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_592| |v_thread2Thread1of1ForFork1_plus_#in~b#1_566|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_596| |v_thread2Thread1of1ForFork1_minus_#in~a#1_574|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_562| |v_thread2Thread1of1ForFork1_plus_~a#1_590|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_572| 2147483648)) (= v_~f1_2~0_956 |v_thread1Thread1of1ForFork0_plus_#res#1_562|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_548| (+ (* v_~f1_2~0_957 987) (* 610 v_~f2_3~0_879))) (= v_~f2_7~0_900 |v_thread2Thread1of1ForFork1_minus_#res#1_580|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_566| |v_thread1Thread1of1ForFork0_plus_#in~a#1_548|) (= (ite (< 0 v_~f1_2~0_956) 1 0) v_~l_4~0_194) (<= v_~f1_2~0_956 2147483647) (<= 0 (+ v_~f1_2~0_956 2147483648)) (= |v_thread1Thread1of1ForFork0_#res#1.base_153| 0) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_548| |v_thread1Thread1of1ForFork0_minus_#in~b#1_546|) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_574| v_~f1_6~0_948) (<= 0 (+ v_~f1_6~0_949 2147483648)) (<= v_~f1_2~0_957 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_620| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_578| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_578|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_578|)) 1 0))) InVars {~f1_2~0=v_~f1_2~0_957, ~f2_3~0=v_~f2_3~0_879, ~n_0~0=v_~n_0~0_483, ~f2_7~0=v_~f2_7~0_901, ~f1_6~0=v_~f1_6~0_949} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_515|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_544|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_590|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_514|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_580|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_640|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_548|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_708|, ~f1_6~0=v_~f1_6~0_948, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_523|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_596|, ~f1_2~0=v_~f1_2~0_956, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_574|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_572|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_496|, ~n_0~0=v_~n_0~0_483, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_592|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_506|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_652|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_574|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_153|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_562|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_560|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_153|, ~f2_3~0=v_~f2_3~0_878, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_566|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_596|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_566|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_566|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_668|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_546|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_620|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_578|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_717|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_578|, ~f2_7~0=v_~f2_7~0_900, ~l_4~0=v_~l_4~0_194, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_562|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_548|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_523|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:28:24,535 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:28:24,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26859 [2022-12-13 10:28:24,536 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 162 transitions, 3959 flow [2022-12-13 10:28:24,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:28:24,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:28:24,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:28:24,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 10:28:24,536 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:28:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:28:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1587736316, now seen corresponding path program 1 times [2022-12-13 10:28:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:28:24,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468057985] [2022-12-13 10:28:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:28:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:28:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:28:24,561 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-13 10:28:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:28:24,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468057985] [2022-12-13 10:28:24,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468057985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:28:24,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:28:24,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:28:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400084172] [2022-12-13 10:28:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:28:24,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:28:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:28:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:28:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:28:24,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 10:28:24,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 162 transitions, 3959 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-13 10:28:24,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:28:24,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 10:28:24,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:28:24,852 INFO L130 PetriNetUnfolder]: 533/960 cut-off events. [2022-12-13 10:28:24,852 INFO L131 PetriNetUnfolder]: For 48197/48197 co-relation queries the response was YES. [2022-12-13 10:28:24,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11330 conditions, 960 events. 533/960 cut-off events. For 48197/48197 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4931 event pairs, 177 based on Foata normal form. 10/970 useless extension candidates. Maximal degree in co-relation 11204. Up to 947 conditions per place. [2022-12-13 10:28:24,859 INFO L137 encePairwiseOnDemand]: 63/68 looper letters, 164 selfloop transitions, 4 changer transitions 1/169 dead transitions. [2022-12-13 10:28:24,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 169 transitions, 4431 flow [2022-12-13 10:28:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:28:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:28:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 10:28:24,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2022-12-13 10:28:24,860 INFO L175 Difference]: Start difference. First operand has 152 places, 162 transitions, 3959 flow. Second operand 3 states and 74 transitions. [2022-12-13 10:28:24,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 169 transitions, 4431 flow [2022-12-13 10:28:24,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 169 transitions, 4311 flow, removed 29 selfloop flow, removed 6 redundant places. [2022-12-13 10:28:24,947 INFO L231 Difference]: Finished difference. Result has 149 places, 163 transitions, 3862 flow [2022-12-13 10:28:24,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=3756, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3862, PETRI_PLACES=149, PETRI_TRANSITIONS=163} [2022-12-13 10:28:24,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 129 predicate places. [2022-12-13 10:28:24,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:28:24,947 INFO L89 Accepts]: Start accepts. Operand has 149 places, 163 transitions, 3862 flow [2022-12-13 10:28:24,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:28:24,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:28:24,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 163 transitions, 3862 flow [2022-12-13 10:28:24,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 163 transitions, 3862 flow [2022-12-13 10:28:25,002 INFO L130 PetriNetUnfolder]: 149/396 cut-off events. [2022-12-13 10:28:25,002 INFO L131 PetriNetUnfolder]: For 20121/20170 co-relation queries the response was YES. [2022-12-13 10:28:25,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 396 events. 149/396 cut-off events. For 20121/20170 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2353 event pairs, 1 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 4504. Up to 188 conditions per place. [2022-12-13 10:28:25,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 163 transitions, 3862 flow [2022-12-13 10:28:25,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 10:28:25,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1068] $Ultimate##0-->L54-5: Formula: (and (= v_~f1_2~0_912 |v_thread1Thread1of1ForFork0_minus_#in~a#1_521|) (= (+ (* v_~f1_2~0_913 987) (* 610 v_~f2_3~0_837)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_525|) (<= v_~f1_2~0_913 2147483647) (= |v_thread2Thread1of1ForFork1_minus_~a#1_570| |v_thread2Thread1of1ForFork1_minus_#in~a#1_548|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_614| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_642|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_540| |v_thread2Thread1of1ForFork1_minus_#in~b#1_548|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_546| v_~f1_6~0_900) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_525| |v_thread1Thread1of1ForFork0_minus_#in~b#1_523|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_614| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_570| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_570|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_570|)) 1 0)) (not (= (ite (or (<= 0 (+ v_~f1_2~0_913 2147483648)) (<= v_~f2_3~0_837 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_597| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_555| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_555|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_555|)) 1 0)) (<= 0 (+ v_~f1_6~0_902 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_548| (+ (* 610 v_~f2_7~0_862) (* v_~f1_6~0_902 987))) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_548| v_~f1_6~0_900) (= v_~f2_7~0_860 |v_thread2Thread1of1ForFork1_minus_#res#1_554|) (<= v_~f1_6~0_902 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_536| (+ (* v_~f2_7~0_862 987) (* v_~f1_6~0_902 1597))) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_546| 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_546| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_546| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_566| |v_thread2Thread1of1ForFork1_plus_~a#1_564|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_539| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_543| |v_thread1Thread1of1ForFork0_plus_~b#1_543|)) (= v_~f1_2~0_912 |v_thread1Thread1of1ForFork0_plus_#res#1_539|) (<= 0 (+ v_~f1_2~0_912 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_525| |v_thread1Thread1of1ForFork0_plus_~b#1_543|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_570| |v_thread2Thread1of1ForFork1_minus_#in~b#1_548|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_555| |v_thread1Thread1of1ForFork0_minus_#in~b#1_523|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_536| |v_thread2Thread1of1ForFork1_plus_~a#1_564|) (= |v_thread1Thread1of1ForFork0_~i~0#1_685| 16) (< |v_thread2Thread1of1ForFork1_~i~1#1_672| (+ v_~n_0~0_461 1)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_543| |v_thread1Thread1of1ForFork0_plus_#in~a#1_525|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_555| |v_thread1Thread1of1ForFork0_minus_#res#1_537|) |v_thread1Thread1of1ForFork0_minus_~a#1_555|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_537| v_~f2_3~0_836) (= |v_thread2Thread1of1ForFork1_~i~1#1_672| 17) (<= v_~f1_2~0_912 2147483647) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_597| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_629|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_566| |v_thread2Thread1of1ForFork1_plus_#in~b#1_540|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_570| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_570| |v_thread2Thread1of1ForFork1_minus_#res#1_554|)) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_521| |v_thread1Thread1of1ForFork0_minus_~a#1_555|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_525| (* v_~f1_2~0_913 377) (* 233 v_~f2_3~0_837)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_525|)) InVars {~f1_2~0=v_~f1_2~0_913, ~f2_3~0=v_~f2_3~0_837, ~n_0~0=v_~n_0~0_461, ~f2_7~0=v_~f2_7~0_862, ~f1_6~0=v_~f1_6~0_902} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_489|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_521|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_564|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_492|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_554|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_614|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_525|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_672|, ~f1_6~0=v_~f1_6~0_900, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_497|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_570|, ~f1_2~0=v_~f1_2~0_912, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_548|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_546|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_474|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_566|, ~n_0~0=v_~n_0~0_461, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_484|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_629|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_548|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_536|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_537|, ~f2_3~0=v_~f2_3~0_836, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_543|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_570|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_543|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_540|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_642|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_523|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_597|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_555|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_685|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_555|, ~f2_7~0=v_~f2_7~0_860, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_539|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_525|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_497|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:28:31,031 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 585 DAG size of output: 572 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:28:33,490 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:28:33,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8544 [2022-12-13 10:28:33,491 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 163 transitions, 3884 flow [2022-12-13 10:28:33,491 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-13 10:28:33,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:28:33,491 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:28:33,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 10:28:33,491 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:28:33,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:28:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash 985334853, now seen corresponding path program 1 times [2022-12-13 10:28:33,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:28:33,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155308036] [2022-12-13 10:28:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:28:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:28:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:28:33,522 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-13 10:28:33,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:28:33,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155308036] [2022-12-13 10:28:33,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155308036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:28:33,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:28:33,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:28:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147793932] [2022-12-13 10:28:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:28:33,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:28:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:28:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:28:33,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:28:33,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-13 10:28:33,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 163 transitions, 3884 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:28:33,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:28:33,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-13 10:28:33,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:28:33,849 INFO L130 PetriNetUnfolder]: 550/987 cut-off events. [2022-12-13 10:28:33,849 INFO L131 PetriNetUnfolder]: For 50450/50450 co-relation queries the response was YES. [2022-12-13 10:28:33,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11716 conditions, 987 events. 550/987 cut-off events. For 50450/50450 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5114 event pairs, 130 based on Foata normal form. 12/999 useless extension candidates. Maximal degree in co-relation 11249. Up to 790 conditions per place. [2022-12-13 10:28:33,857 INFO L137 encePairwiseOnDemand]: 37/67 looper letters, 123 selfloop transitions, 55 changer transitions 0/178 dead transitions. [2022-12-13 10:28:33,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 178 transitions, 4626 flow [2022-12-13 10:28:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:28:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:28:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 10:28:33,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.291044776119403 [2022-12-13 10:28:33,858 INFO L175 Difference]: Start difference. First operand has 148 places, 163 transitions, 3884 flow. Second operand 4 states and 78 transitions. [2022-12-13 10:28:33,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 178 transitions, 4626 flow [2022-12-13 10:28:33,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 178 transitions, 4486 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-12-13 10:28:33,944 INFO L231 Difference]: Finished difference. Result has 150 places, 169 transitions, 4139 flow [2022-12-13 10:28:33,944 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=3744, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4139, PETRI_PLACES=150, PETRI_TRANSITIONS=169} [2022-12-13 10:28:33,944 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 130 predicate places. [2022-12-13 10:28:33,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:28:33,945 INFO L89 Accepts]: Start accepts. Operand has 150 places, 169 transitions, 4139 flow [2022-12-13 10:28:33,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:28:33,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:28:33,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 169 transitions, 4139 flow [2022-12-13 10:28:33,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 169 transitions, 4139 flow [2022-12-13 10:28:34,002 INFO L130 PetriNetUnfolder]: 155/412 cut-off events. [2022-12-13 10:28:34,002 INFO L131 PetriNetUnfolder]: For 22640/22691 co-relation queries the response was YES. [2022-12-13 10:28:34,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4998 conditions, 412 events. 155/412 cut-off events. For 22640/22691 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2462 event pairs, 3 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 4823. Up to 197 conditions per place. [2022-12-13 10:28:34,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 169 transitions, 4139 flow [2022-12-13 10:28:34,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 10:28:34,008 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:28:34,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 10:28:34,008 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 169 transitions, 4139 flow [2022-12-13 10:28:34,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:28:34,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:28:34,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:28:34,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 10:28:34,009 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:28:34,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:28:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1395935481, now seen corresponding path program 1 times [2022-12-13 10:28:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:28:34,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439691782] [2022-12-13 10:28:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:28:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:28:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:28:34,190 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-13 10:28:34,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:28:34,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439691782] [2022-12-13 10:28:34,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439691782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:28:34,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:28:34,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:28:34,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016538404] [2022-12-13 10:28:34,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:28:34,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:28:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:28:34,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:28:34,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:28:34,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-13 10:28:34,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 169 transitions, 4139 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:28:34,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:28:34,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-13 10:28:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:28:35,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 10:28:36,200 INFO L130 PetriNetUnfolder]: 556/1001 cut-off events. [2022-12-13 10:28:36,201 INFO L131 PetriNetUnfolder]: For 49803/49905 co-relation queries the response was YES. [2022-12-13 10:28:36,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12094 conditions, 1001 events. 556/1001 cut-off events. For 49803/49905 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5259 event pairs, 30 based on Foata normal form. 1/1002 useless extension candidates. Maximal degree in co-relation 11597. Up to 978 conditions per place. [2022-12-13 10:28:36,209 INFO L137 encePairwiseOnDemand]: 31/67 looper letters, 142 selfloop transitions, 35 changer transitions 5/183 dead transitions. [2022-12-13 10:28:36,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 183 transitions, 4680 flow [2022-12-13 10:28:36,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:28:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:28:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-13 10:28:36,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21641791044776118 [2022-12-13 10:28:36,212 INFO L175 Difference]: Start difference. First operand has 150 places, 169 transitions, 4139 flow. Second operand 6 states and 87 transitions. [2022-12-13 10:28:36,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 183 transitions, 4680 flow [2022-12-13 10:28:36,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 183 transitions, 4612 flow, removed 34 selfloop flow, removed 0 redundant places. [2022-12-13 10:28:36,314 INFO L231 Difference]: Finished difference. Result has 158 places, 173 transitions, 4291 flow [2022-12-13 10:28:36,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=4071, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4291, PETRI_PLACES=158, PETRI_TRANSITIONS=173} [2022-12-13 10:28:36,314 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 138 predicate places. [2022-12-13 10:28:36,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:28:36,315 INFO L89 Accepts]: Start accepts. Operand has 158 places, 173 transitions, 4291 flow [2022-12-13 10:28:36,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:28:36,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:28:36,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 173 transitions, 4291 flow [2022-12-13 10:28:36,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 173 transitions, 4291 flow [2022-12-13 10:28:36,379 INFO L130 PetriNetUnfolder]: 157/416 cut-off events. [2022-12-13 10:28:36,379 INFO L131 PetriNetUnfolder]: For 22705/22756 co-relation queries the response was YES. [2022-12-13 10:28:36,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 416 events. 157/416 cut-off events. For 22705/22756 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2507 event pairs, 2 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 4994. Up to 199 conditions per place. [2022-12-13 10:28:36,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 173 transitions, 4291 flow [2022-12-13 10:28:36,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 10:28:43,260 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 614 DAG size of output: 606 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:28:46,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1081] $Ultimate##0-->L54-5: Formula: (and (= (+ (* v_~f1_2~0_952 2584) (* v_~f2_3~0_874 1597)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_544|) (= v_~f1_2~0_950 |v_thread1Thread1of1ForFork0_minus_#in~a#1_540|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_648|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_592| |v_thread2Thread1of1ForFork1_minus_#res#1_576|) |v_thread2Thread1of1ForFork1_minus_~a#1_592|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_588| |v_thread2Thread1of1ForFork1_plus_#in~b#1_562|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_562| |v_thread1Thread1of1ForFork0_plus_#in~a#1_544|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_574| |v_thread1Thread1of1ForFork0_minus_#in~b#1_542|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_574| |v_thread1Thread1of1ForFork0_minus_#res#1_556|) |v_thread1Thread1of1ForFork0_minus_~a#1_574|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_558| (+ (* 610 v_~f2_7~0_896) |v_thread2Thread1of1ForFork1_minus_#in~b#1_570| (* v_~f1_6~0_944 987))) (<= v_~f1_6~0_944 2147483647) (<= v_~f1_2~0_950 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_570| v_~f1_6~0_942) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_540| |v_thread1Thread1of1ForFork0_minus_~a#1_574|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_664|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_574| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_574|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_574|)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_592| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_592|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_592|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_558| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_562| |v_thread1Thread1of1ForFork0_plus_~b#1_562|)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_558| |v_thread2Thread1of1ForFork1_plus_~a#1_586|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_588| |v_thread2Thread1of1ForFork1_plus_~a#1_586|) |v_thread2Thread1of1ForFork1_plus_#res#1_568|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_556| v_~f2_3~0_872) (= |v_thread1Thread1of1ForFork0_~i~0#1_713| 18) (< 17 v_~n_0~0_481) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_544| |v_thread1Thread1of1ForFork0_plus_~b#1_562|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_592| |v_thread2Thread1of1ForFork1_minus_#in~b#1_570|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_562| |v_thread2Thread1of1ForFork1_minus_#in~b#1_570|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_592| |v_thread2Thread1of1ForFork1_minus_#in~a#1_570|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_544| (+ (* v_~f1_2~0_952 1597) (* v_~f2_3~0_874 987))) (<= v_~f1_2~0_952 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_568| v_~f1_6~0_942) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_558| (+ (* 2584 v_~f1_6~0_944) (* v_~f2_7~0_896 1597))) (not (= (ite (or (<= 0 (+ v_~f1_2~0_952 2147483648)) (<= v_~f2_3~0_874 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_544| |v_thread1Thread1of1ForFork0_minus_#in~b#1_542|) (<= 0 (+ v_~f1_6~0_944 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_568| 2147483647) (= v_~f2_7~0_894 |v_thread2Thread1of1ForFork1_minus_#res#1_576|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_568| 2147483648)) (= |v_thread2Thread1of1ForFork1_~i~1#1_704| 18) (= v_~f1_2~0_950 |v_thread1Thread1of1ForFork0_plus_#res#1_558|) (<= 0 (+ v_~f1_2~0_950 2147483648))) InVars {~f1_2~0=v_~f1_2~0_952, ~f2_3~0=v_~f2_3~0_874, ~n_0~0=v_~n_0~0_481, ~f2_7~0=v_~f2_7~0_896, ~f1_6~0=v_~f1_6~0_944} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_511|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_540|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_586|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_510|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_576|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_544|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_704|, ~f1_6~0=v_~f1_6~0_942, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_519|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_592|, ~f1_2~0=v_~f1_2~0_950, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_570|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_568|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_492|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_588|, ~n_0~0=v_~n_0~0_481, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_502|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_648|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_570|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_558|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_556|, ~f2_3~0=v_~f2_3~0_872, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_562|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_592|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_562|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_562|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_664|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_542|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_574|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_713|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_574|, ~f2_7~0=v_~f2_7~0_894, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_558|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_544|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_519|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [903] L44-5-->L54-5: Formula: (and (= v_~f1_2~0_486 |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| v_~f1_6~0_463) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 1) |v_thread2Thread1of1ForFork1_~i~1#1_355|) (<= 0 (+ v_~f1_2~0_485 2147483648)) (<= v_~f2_7~0_437 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_272| v_~f2_7~0_438) (= |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_#in~a#1_287|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_280| v_~f2_7~0_438) (= |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_#in~b#1_272|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_317| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_317|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_317| (+ 2147483648 |v_thread1Thread1of1ForFork0_minus_~a#1_317|))) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#res#1_299|) |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= 0 (+ v_~f2_7~0_437 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_301| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_305| |v_thread1Thread1of1ForFork0_plus_~b#1_305|)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_285| v_~f2_3~0_446) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_minus_#in~a#1_283|) (= v_~f2_7~0_437 |v_thread2Thread1of1ForFork1_minus_#res#1_286|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| v_~f1_6~0_462) (= |v_thread1Thread1of1ForFork0_~i~0#1_382| (+ |v_thread1Thread1of1ForFork0_~i~0#1_383| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_356| v_~n_0~0_269) (= v_~f1_2~0_485 |v_thread1Thread1of1ForFork0_plus_#res#1_301|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_317| |v_thread1Thread1of1ForFork0_minus_#in~b#1_285|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_302| |v_thread2Thread1of1ForFork1_minus_#in~a#1_280|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_268| |v_thread2Thread1of1ForFork1_plus_~a#1_296|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_283| |v_thread1Thread1of1ForFork0_minus_~a#1_317|) (<= v_~f1_2~0_485 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_280| v_~f1_6~0_462) (< |v_thread1Thread1of1ForFork0_~i~0#1_383| v_~n_0~0_269) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| |v_thread1Thread1of1ForFork0_plus_~b#1_305|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#res#1_286|) |v_thread2Thread1of1ForFork1_minus_~a#1_302|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_299| v_~f2_3~0_445) (= |v_thread2Thread1of1ForFork1_minus_~b#1_302| |v_thread2Thread1of1ForFork1_minus_#in~b#1_280|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_287| v_~f2_3~0_446) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_278| (+ |v_thread2Thread1of1ForFork1_plus_~b#1_298| |v_thread2Thread1of1ForFork1_plus_~a#1_296|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_302| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_302|)) 1 0)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_278| 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_299| 2147483647)) InVars {~f1_2~0=v_~f1_2~0_486, ~f2_3~0=v_~f2_3~0_446, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_383|, ~f2_7~0=v_~f2_7~0_438, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~f1_6~0=v_~f1_6~0_463} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_221|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_283|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_296|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_257|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_286|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_346|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_287|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_355|, ~f1_6~0=v_~f1_6~0_462, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_229|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_302|, ~f1_2~0=v_~f1_2~0_485, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_280|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_278|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_239|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_298|, ~n_0~0=v_~n_0~0_269, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_249|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_391|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_280|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_268|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_299|, ~f2_3~0=v_~f2_3~0_445, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_305|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_302|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_305|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_285|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_359|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_317|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_382|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_317|, ~f2_7~0=v_~f2_7~0_437, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_301|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_287|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_229|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:28:54,076 WARN L233 SmtUtils]: Spent 7.38s on a formula simplification. DAG size of input: 677 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:28:57,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1081] $Ultimate##0-->L54-5: Formula: (and (= (+ (* v_~f1_2~0_952 2584) (* v_~f2_3~0_874 1597)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_544|) (= v_~f1_2~0_950 |v_thread1Thread1of1ForFork0_minus_#in~a#1_540|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_648|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_592| |v_thread2Thread1of1ForFork1_minus_#res#1_576|) |v_thread2Thread1of1ForFork1_minus_~a#1_592|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_588| |v_thread2Thread1of1ForFork1_plus_#in~b#1_562|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_562| |v_thread1Thread1of1ForFork0_plus_#in~a#1_544|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_574| |v_thread1Thread1of1ForFork0_minus_#in~b#1_542|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_574| |v_thread1Thread1of1ForFork0_minus_#res#1_556|) |v_thread1Thread1of1ForFork0_minus_~a#1_574|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_558| (+ (* 610 v_~f2_7~0_896) |v_thread2Thread1of1ForFork1_minus_#in~b#1_570| (* v_~f1_6~0_944 987))) (<= v_~f1_6~0_944 2147483647) (<= v_~f1_2~0_950 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_570| v_~f1_6~0_942) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_540| |v_thread1Thread1of1ForFork0_minus_~a#1_574|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_664|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_574| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_574|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_574|)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636| (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_592| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_592|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_592|)) 1 0)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_558| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_562| |v_thread1Thread1of1ForFork0_plus_~b#1_562|)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_558| |v_thread2Thread1of1ForFork1_plus_~a#1_586|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_588| |v_thread2Thread1of1ForFork1_plus_~a#1_586|) |v_thread2Thread1of1ForFork1_plus_#res#1_568|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_556| v_~f2_3~0_872) (= |v_thread1Thread1of1ForFork0_~i~0#1_713| 18) (< 17 v_~n_0~0_481) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_544| |v_thread1Thread1of1ForFork0_plus_~b#1_562|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_592| |v_thread2Thread1of1ForFork1_minus_#in~b#1_570|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_562| |v_thread2Thread1of1ForFork1_minus_#in~b#1_570|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_592| |v_thread2Thread1of1ForFork1_minus_#in~a#1_570|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_544| (+ (* v_~f1_2~0_952 1597) (* v_~f2_3~0_874 987))) (<= v_~f1_2~0_952 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#res#1_568| v_~f1_6~0_942) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_558| (+ (* 2584 v_~f1_6~0_944) (* v_~f2_7~0_896 1597))) (not (= (ite (or (<= 0 (+ v_~f1_2~0_952 2147483648)) (<= v_~f2_3~0_874 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_544| |v_thread1Thread1of1ForFork0_minus_#in~b#1_542|) (<= 0 (+ v_~f1_6~0_944 2147483648)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_568| 2147483647) (= v_~f2_7~0_894 |v_thread2Thread1of1ForFork1_minus_#res#1_576|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_568| 2147483648)) (= |v_thread2Thread1of1ForFork1_~i~1#1_704| 18) (= v_~f1_2~0_950 |v_thread1Thread1of1ForFork0_plus_#res#1_558|) (<= 0 (+ v_~f1_2~0_950 2147483648))) InVars {~f1_2~0=v_~f1_2~0_952, ~f2_3~0=v_~f2_3~0_874, ~n_0~0=v_~n_0~0_481, ~f2_7~0=v_~f2_7~0_896, ~f1_6~0=v_~f1_6~0_944} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_511|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_540|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_586|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_510|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_576|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_544|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_704|, ~f1_6~0=v_~f1_6~0_942, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_519|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_592|, ~f1_2~0=v_~f1_2~0_950, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_570|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_568|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_492|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_588|, ~n_0~0=v_~n_0~0_481, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_502|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_648|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_570|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_558|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_556|, ~f2_3~0=v_~f2_3~0_872, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_562|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_592|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_562|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_562|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_664|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_542|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_616|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_574|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_713|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_574|, ~f2_7~0=v_~f2_7~0_894, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_558|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_544|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_519|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 10:29:02,641 WARN L233 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 573 DAG size of output: 571 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:29:05,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1090] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~f1_2~0_980 |v_thread1Thread1of1ForFork0_plus_#res#1_576|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_612| |v_thread2Thread1of1ForFork1_minus_#in~b#1_590|) (= v_~l_4~0_198 (ite (< 0 v_~f1_2~0_980) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_656| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_684|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_578| |v_thread2Thread1of1ForFork1_plus_~a#1_606|) (<= v_~f1_2~0_980 2147483647) (= (+ (* v_~f1_2~0_981 2584) (* v_~f2_3~0_903 1597)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_562|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_574| v_~f2_3~0_902) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_656| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_612|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_612| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_612|))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_634| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_592| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_592|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_592|)) 1 0)) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_608| |v_thread2Thread1of1ForFork1_plus_~a#1_606|) |v_thread2Thread1of1ForFork1_plus_#res#1_588|) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_731| v_~n_0~0_493)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_634| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_666|) (<= v_~f1_2~0_981 2147483647) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_562| (+ (* v_~f2_3~0_903 987) (* v_~f1_2~0_981 1597))) (= v_~f2_7~0_926 |v_thread2Thread1of1ForFork1_minus_#res#1_596|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_562| |v_thread1Thread1of1ForFork0_plus_~b#1_580|) (not (= (ite (or (<= v_~f2_3~0_903 0) (<= 0 (+ v_~f1_2~0_981 2147483648))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_578| (+ (* v_~f2_7~0_927 1597) (* 2584 v_~f1_6~0_975))) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_578| (+ (* 610 v_~f2_7~0_927) |v_thread2Thread1of1ForFork1_minus_#in~b#1_590| (* v_~f1_6~0_975 987))) (= v_~f1_2~0_980 |v_thread1Thread1of1ForFork0_minus_#in~a#1_558|) (= |v_thread1Thread1of1ForFork0_~i~0#1_731| 18) (= |v_thread2Thread1of1ForFork1_~i~1#1_724| 18) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_590| v_~f1_6~0_974) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_588| 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_562| |v_thread1Thread1of1ForFork0_minus_#in~b#1_560|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_558| |v_thread1Thread1of1ForFork0_minus_~a#1_592|) (< 17 v_~n_0~0_493) (<= 0 (+ v_~f1_2~0_980 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_592| |v_thread1Thread1of1ForFork0_minus_#in~b#1_560|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_588| 2147483647) (= |v_thread1Thread1of1ForFork0_plus_~a#1_580| |v_thread1Thread1of1ForFork0_plus_#in~a#1_562|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_588| v_~f1_6~0_974) (= |v_thread2Thread1of1ForFork1_plus_~b#1_608| |v_thread2Thread1of1ForFork1_plus_#in~b#1_582|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_612| |v_thread2Thread1of1ForFork1_minus_#in~a#1_590|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_157| 0) (<= 0 (+ v_~f1_6~0_975 2147483648)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_592| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_592| |v_thread1Thread1of1ForFork0_minus_#res#1_574|)) (= |v_thread1Thread1of1ForFork0_#res#1.base_157| 0) (= |v_thread2Thread1of1ForFork1_minus_~a#1_612| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_612| |v_thread2Thread1of1ForFork1_minus_#res#1_596|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_576| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_580| |v_thread1Thread1of1ForFork0_plus_~b#1_580|)) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_582| |v_thread2Thread1of1ForFork1_minus_#in~b#1_590|) (<= v_~f1_6~0_975 2147483647)) InVars {~f1_2~0=v_~f1_2~0_981, ~f2_3~0=v_~f2_3~0_903, ~n_0~0=v_~n_0~0_493, ~f2_7~0=v_~f2_7~0_927, ~f1_6~0=v_~f1_6~0_975} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_531|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_558|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_606|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_528|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_596|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_656|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_562|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_724|, ~f1_6~0=v_~f1_6~0_974, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_539|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_612|, ~f1_2~0=v_~f1_2~0_980, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_590|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_588|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_510|, ~n_0~0=v_~n_0~0_493, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_608|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_520|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_666|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_590|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_157|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_578|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_574|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_157|, ~f2_3~0=v_~f2_3~0_902, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_580|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_612|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_580|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_582|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_684|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_560|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_634|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_592|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_731|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_592|, ~f2_7~0=v_~f2_7~0_926, ~l_4~0=v_~l_4~0_198, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_576|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_562|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_539|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, ~l_4~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:29:05,458 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:05,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29143 [2022-12-13 10:29:05,458 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 172 transitions, 4327 flow [2022-12-13 10:29:05,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:05,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:05,459 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:05,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 10:29:05,459 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash 17295533, now seen corresponding path program 1 times [2022-12-13 10:29:05,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:05,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759539169] [2022-12-13 10:29:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:05,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-13 10:29:05,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:05,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759539169] [2022-12-13 10:29:05,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759539169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:05,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:05,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713904367] [2022-12-13 10:29:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:05,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:05,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:05,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:05,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 10:29:05,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 172 transitions, 4327 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-13 10:29:05,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:05,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 10:29:05,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:05,790 INFO L130 PetriNetUnfolder]: 566/1025 cut-off events. [2022-12-13 10:29:05,790 INFO L131 PetriNetUnfolder]: For 55976/55976 co-relation queries the response was YES. [2022-12-13 10:29:05,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12443 conditions, 1025 events. 566/1025 cut-off events. For 55976/55976 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5446 event pairs, 153 based on Foata normal form. 4/1029 useless extension candidates. Maximal degree in co-relation 12310. Up to 843 conditions per place. [2022-12-13 10:29:05,798 INFO L137 encePairwiseOnDemand]: 56/70 looper letters, 154 selfloop transitions, 26 changer transitions 1/181 dead transitions. [2022-12-13 10:29:05,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 181 transitions, 4800 flow [2022-12-13 10:29:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-13 10:29:05,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 10:29:05,799 INFO L175 Difference]: Start difference. First operand has 156 places, 172 transitions, 4327 flow. Second operand 3 states and 80 transitions. [2022-12-13 10:29:05,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 181 transitions, 4800 flow [2022-12-13 10:29:05,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 181 transitions, 4719 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 10:29:05,909 INFO L231 Difference]: Finished difference. Result has 156 places, 170 transitions, 4191 flow [2022-12-13 10:29:05,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4098, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4191, PETRI_PLACES=156, PETRI_TRANSITIONS=170} [2022-12-13 10:29:05,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 136 predicate places. [2022-12-13 10:29:05,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:05,910 INFO L89 Accepts]: Start accepts. Operand has 156 places, 170 transitions, 4191 flow [2022-12-13 10:29:05,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:05,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:05,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 170 transitions, 4191 flow [2022-12-13 10:29:05,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 170 transitions, 4191 flow [2022-12-13 10:29:05,986 INFO L130 PetriNetUnfolder]: 158/428 cut-off events. [2022-12-13 10:29:05,986 INFO L131 PetriNetUnfolder]: For 24110/24163 co-relation queries the response was YES. [2022-12-13 10:29:05,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5255 conditions, 428 events. 158/428 cut-off events. For 24110/24163 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2646 event pairs, 3 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 5068. Up to 202 conditions per place. [2022-12-13 10:29:05,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 170 transitions, 4191 flow [2022-12-13 10:29:05,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 10:29:05,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:05,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 10:29:05,993 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 170 transitions, 4191 flow [2022-12-13 10:29:05,993 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-13 10:29:05,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:05,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:05,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 10:29:05,994 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:05,994 INFO L85 PathProgramCache]: Analyzing trace with hash -665844236, now seen corresponding path program 2 times [2022-12-13 10:29:05,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:05,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951023371] [2022-12-13 10:29:05,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:05,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:06,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:06,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951023371] [2022-12-13 10:29:06,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951023371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:06,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:06,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:29:06,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253120753] [2022-12-13 10:29:06,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:06,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:29:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:29:06,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:29:06,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 67 [2022-12-13 10:29:06,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 170 transitions, 4191 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:06,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:06,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 67 [2022-12-13 10:29:06,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:06,845 INFO L130 PetriNetUnfolder]: 575/1046 cut-off events. [2022-12-13 10:29:06,845 INFO L131 PetriNetUnfolder]: For 56465/56571 co-relation queries the response was YES. [2022-12-13 10:29:06,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12988 conditions, 1046 events. 575/1046 cut-off events. For 56465/56571 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5663 event pairs, 32 based on Foata normal form. 3/1049 useless extension candidates. Maximal degree in co-relation 12483. Up to 979 conditions per place. [2022-12-13 10:29:06,855 INFO L137 encePairwiseOnDemand]: 33/67 looper letters, 143 selfloop transitions, 38 changer transitions 7/189 dead transitions. [2022-12-13 10:29:06,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 189 transitions, 4940 flow [2022-12-13 10:29:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:29:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:29:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-13 10:29:06,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2656716417910448 [2022-12-13 10:29:06,856 INFO L175 Difference]: Start difference. First operand has 155 places, 170 transitions, 4191 flow. Second operand 5 states and 89 transitions. [2022-12-13 10:29:06,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 189 transitions, 4940 flow [2022-12-13 10:29:06,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 189 transitions, 4856 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 10:29:06,977 INFO L231 Difference]: Finished difference. Result has 159 places, 174 transitions, 4433 flow [2022-12-13 10:29:06,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=4123, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4433, PETRI_PLACES=159, PETRI_TRANSITIONS=174} [2022-12-13 10:29:06,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 139 predicate places. [2022-12-13 10:29:06,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:06,977 INFO L89 Accepts]: Start accepts. Operand has 159 places, 174 transitions, 4433 flow [2022-12-13 10:29:06,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:06,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:06,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 174 transitions, 4433 flow [2022-12-13 10:29:06,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 174 transitions, 4433 flow [2022-12-13 10:29:07,039 INFO L130 PetriNetUnfolder]: 161/433 cut-off events. [2022-12-13 10:29:07,040 INFO L131 PetriNetUnfolder]: For 25620/25673 co-relation queries the response was YES. [2022-12-13 10:29:07,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 433 events. 161/433 cut-off events. For 25620/25673 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2690 event pairs, 2 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 5338. Up to 207 conditions per place. [2022-12-13 10:29:07,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 174 transitions, 4433 flow [2022-12-13 10:29:07,045 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 10:29:07,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:29:07,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:29:07,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L44-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0) (not (< |v_thread1Thread1of1ForFork0_~i~0#1_In_1| v_~n_0~0_In_1)) (= v_~l_4~0_Out_2 (ite (< 0 v_~f1_2~0_In_3) 1 0))) InVars {~f1_2~0=v_~f1_2~0_In_3, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|} OutVars{~f1_2~0=v_~f1_2~0_In_3, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~n_0~0=v_~n_0~0_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, ~l_4~0=v_~l_4~0_Out_2, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, ~l_4~0, thread1Thread1of1ForFork0_#res#1.base] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:29:07,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:07,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 917 [2022-12-13 10:29:07,894 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 174 transitions, 4569 flow [2022-12-13 10:29:07,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:07,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:07,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:07,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 10:29:07,895 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1270437071, now seen corresponding path program 1 times [2022-12-13 10:29:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:07,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692469957] [2022-12-13 10:29:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:07,915 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-13 10:29:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:07,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692469957] [2022-12-13 10:29:07,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692469957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:07,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:07,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784769930] [2022-12-13 10:29:07,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:07,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:07,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 10:29:07,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 174 transitions, 4569 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-13 10:29:07,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:07,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 10:29:07,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:08,225 INFO L130 PetriNetUnfolder]: 577/1044 cut-off events. [2022-12-13 10:29:08,225 INFO L131 PetriNetUnfolder]: For 63394/63394 co-relation queries the response was YES. [2022-12-13 10:29:08,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13251 conditions, 1044 events. 577/1044 cut-off events. For 63394/63394 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5559 event pairs, 133 based on Foata normal form. 8/1052 useless extension candidates. Maximal degree in co-relation 13120. Up to 833 conditions per place. [2022-12-13 10:29:08,234 INFO L137 encePairwiseOnDemand]: 40/70 looper letters, 127 selfloop transitions, 57 changer transitions 0/184 dead transitions. [2022-12-13 10:29:08,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 184 transitions, 5197 flow [2022-12-13 10:29:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 10:29:08,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2022-12-13 10:29:08,235 INFO L175 Difference]: Start difference. First operand has 154 places, 174 transitions, 4569 flow. Second operand 3 states and 76 transitions. [2022-12-13 10:29:08,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 184 transitions, 5197 flow [2022-12-13 10:29:08,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 184 transitions, 5081 flow, removed 58 selfloop flow, removed 1 redundant places. [2022-12-13 10:29:08,381 INFO L231 Difference]: Finished difference. Result has 156 places, 177 transitions, 4757 flow [2022-12-13 10:29:08,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4453, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4757, PETRI_PLACES=156, PETRI_TRANSITIONS=177} [2022-12-13 10:29:08,382 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 136 predicate places. [2022-12-13 10:29:08,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:08,382 INFO L89 Accepts]: Start accepts. Operand has 156 places, 177 transitions, 4757 flow [2022-12-13 10:29:08,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:08,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:08,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 177 transitions, 4757 flow [2022-12-13 10:29:08,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 177 transitions, 4757 flow [2022-12-13 10:29:08,446 INFO L130 PetriNetUnfolder]: 165/443 cut-off events. [2022-12-13 10:29:08,446 INFO L131 PetriNetUnfolder]: For 27608/27661 co-relation queries the response was YES. [2022-12-13 10:29:08,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5726 conditions, 443 events. 165/443 cut-off events. For 27608/27661 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2750 event pairs, 3 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 5534. Up to 216 conditions per place. [2022-12-13 10:29:08,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 177 transitions, 4757 flow [2022-12-13 10:29:08,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 10:29:08,453 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:08,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 10:29:08,453 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 177 transitions, 4757 flow [2022-12-13 10:29:08,453 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-13 10:29:08,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:08,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:08,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 10:29:08,453 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash -139640881, now seen corresponding path program 1 times [2022-12-13 10:29:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:08,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705155902] [2022-12-13 10:29:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:08,586 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-13 10:29:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:08,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705155902] [2022-12-13 10:29:08,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705155902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:08,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:08,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:29:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017954437] [2022-12-13 10:29:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:08,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:29:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:29:08,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:29:08,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 70 [2022-12-13 10:29:08,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 177 transitions, 4757 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:29:08,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:08,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 70 [2022-12-13 10:29:08,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:09,221 INFO L130 PetriNetUnfolder]: 572/1035 cut-off events. [2022-12-13 10:29:09,222 INFO L131 PetriNetUnfolder]: For 62010/62116 co-relation queries the response was YES. [2022-12-13 10:29:09,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13351 conditions, 1035 events. 572/1035 cut-off events. For 62010/62116 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5558 event pairs, 26 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 12812. Up to 1011 conditions per place. [2022-12-13 10:29:09,231 INFO L137 encePairwiseOnDemand]: 32/70 looper letters, 143 selfloop transitions, 37 changer transitions 9/190 dead transitions. [2022-12-13 10:29:09,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 190 transitions, 5300 flow [2022-12-13 10:29:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:29:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:29:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-13 10:29:09,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2022-12-13 10:29:09,231 INFO L175 Difference]: Start difference. First operand has 156 places, 177 transitions, 4757 flow. Second operand 6 states and 91 transitions. [2022-12-13 10:29:09,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 190 transitions, 5300 flow [2022-12-13 10:29:09,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 190 transitions, 5187 flow, removed 28 selfloop flow, removed 1 redundant places. [2022-12-13 10:29:09,358 INFO L231 Difference]: Finished difference. Result has 162 places, 178 transitions, 4769 flow [2022-12-13 10:29:09,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4644, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4769, PETRI_PLACES=162, PETRI_TRANSITIONS=178} [2022-12-13 10:29:09,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 142 predicate places. [2022-12-13 10:29:09,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:09,358 INFO L89 Accepts]: Start accepts. Operand has 162 places, 178 transitions, 4769 flow [2022-12-13 10:29:09,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:09,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:09,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 178 transitions, 4769 flow [2022-12-13 10:29:09,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 178 transitions, 4769 flow [2022-12-13 10:29:09,445 INFO L130 PetriNetUnfolder]: 165/429 cut-off events. [2022-12-13 10:29:09,445 INFO L131 PetriNetUnfolder]: For 25140/25193 co-relation queries the response was YES. [2022-12-13 10:29:09,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 429 events. 165/429 cut-off events. For 25140/25193 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2592 event pairs, 2 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 5410. Up to 212 conditions per place. [2022-12-13 10:29:09,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 178 transitions, 4769 flow [2022-12-13 10:29:09,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 10:29:09,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1085] $Ultimate##0-->L44-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_582| |v_thread1Thread1of1ForFork0_minus_#res#1_564|) |v_thread1Thread1of1ForFork0_minus_~a#1_582|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_552| (* 377 v_~f2_3~0_888) (* v_~f1_2~0_966 610)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_552|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_578| 2147483648)) (not (= (ite (or (<= v_~f2_3~0_888 0) (<= 0 (+ v_~f1_2~0_966 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_582| |v_thread1Thread1of1ForFork0_minus_#in~b#1_550|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_602| |v_thread2Thread1of1ForFork1_minus_#in~a#1_580|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_552| |v_thread1Thread1of1ForFork0_minus_#in~b#1_550|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_602| |v_thread2Thread1of1ForFork1_minus_#in~b#1_580|) (<= 0 (+ v_~f1_2~0_964 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_570| |v_thread1Thread1of1ForFork0_plus_#in~a#1_552|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_624| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_656|) (= |v_thread2Thread1of1ForFork1_~i~1#1_714| 17) (< |v_thread2Thread1of1ForFork1_~i~1#1_714| (+ v_~n_0~0_487 1)) (= (+ (* v_~f2_7~0_911 987) (* v_~f1_6~0_959 1597)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_568|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_564| v_~f2_3~0_886) (<= 0 (+ v_~f1_6~0_959 2147483648)) (<= v_~f1_2~0_964 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_674|) (= v_~f2_7~0_910 |v_thread2Thread1of1ForFork1_minus_#res#1_586|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_598| |v_thread2Thread1of1ForFork1_plus_#in~b#1_572|) (<= v_~f1_6~0_959 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_548| |v_thread1Thread1of1ForFork0_minus_~a#1_582|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_566| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_570| |v_thread1Thread1of1ForFork0_plus_~b#1_570|)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_578| v_~f1_6~0_958) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_572| |v_thread2Thread1of1ForFork1_minus_#in~b#1_580|) (= v_~f1_2~0_964 |v_thread1Thread1of1ForFork0_minus_#in~a#1_548|) (= v_~f1_2~0_964 |v_thread1Thread1of1ForFork0_plus_#res#1_566|) (<= v_~f1_2~0_966 2147483647) (= (+ (* v_~f2_3~0_888 987) (* v_~f1_2~0_966 1597)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_552|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_582|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_582| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_582|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_624|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_568| |v_thread2Thread1of1ForFork1_plus_~a#1_596|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_598| |v_thread2Thread1of1ForFork1_plus_~a#1_596|) |v_thread2Thread1of1ForFork1_plus_#res#1_578|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_602|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_602| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_602|))) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_721| 17) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_552| |v_thread1Thread1of1ForFork0_plus_~b#1_570|) (= (+ (* 610 v_~f2_7~0_911) (* v_~f1_6~0_959 987)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_580|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_578| 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_580| v_~f1_6~0_958) (= |v_thread2Thread1of1ForFork1_minus_~a#1_602| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_602| |v_thread2Thread1of1ForFork1_minus_#res#1_586|))) InVars {~f1_2~0=v_~f1_2~0_966, ~f2_3~0=v_~f2_3~0_888, ~n_0~0=v_~n_0~0_487, ~f2_7~0=v_~f2_7~0_911, ~f1_6~0=v_~f1_6~0_959} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_521|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_548|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_518|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_596|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_552|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_586|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_714|, ~f1_6~0=v_~f1_6~0_958, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_529|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_602|, ~f1_2~0=v_~f1_2~0_964, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_500|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_580|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_578|, ~n_0~0=v_~n_0~0_487, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_598|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_510|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_656|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_580|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_568|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_564|, ~f2_3~0=v_~f2_3~0_886, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_570|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_602|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_570|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_572|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_550|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_674|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_624|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_582|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_721|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_582|, ~f2_7~0=v_~f2_7~0_910, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_566|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_552|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_529|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [752] L54-5-->thread2EXIT: Formula: (and (= v_~l_8~0_Out_2 (ite (< 0 v_~f1_6~0_In_1) 1 0)) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_3| v_~n_0~0_In_5)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1, ~n_0~0=v_~n_0~0_In_5} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~n_0~0=v_~n_0~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|, ~l_8~0=v_~l_8~0_Out_2, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_3|, ~f1_6~0=v_~f1_6~0_In_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, ~l_8~0] [2022-12-13 10:29:17,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1085] $Ultimate##0-->L44-5: Formula: (and (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_582| |v_thread1Thread1of1ForFork0_minus_#res#1_564|) |v_thread1Thread1of1ForFork0_minus_~a#1_582|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_552| (* 377 v_~f2_3~0_888) (* v_~f1_2~0_966 610)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_552|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_578| 2147483648)) (not (= (ite (or (<= v_~f2_3~0_888 0) (<= 0 (+ v_~f1_2~0_966 2147483648))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_minus_~b#1_582| |v_thread1Thread1of1ForFork0_minus_#in~b#1_550|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_602| |v_thread2Thread1of1ForFork1_minus_#in~a#1_580|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_552| |v_thread1Thread1of1ForFork0_minus_#in~b#1_550|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_602| |v_thread2Thread1of1ForFork1_minus_#in~b#1_580|) (<= 0 (+ v_~f1_2~0_964 2147483648)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_570| |v_thread1Thread1of1ForFork0_plus_#in~a#1_552|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_624| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_656|) (= |v_thread2Thread1of1ForFork1_~i~1#1_714| 17) (< |v_thread2Thread1of1ForFork1_~i~1#1_714| (+ v_~n_0~0_487 1)) (= (+ (* v_~f2_7~0_911 987) (* v_~f1_6~0_959 1597)) |v_thread2Thread1of1ForFork1_plus_#in~a#1_568|) (= |v_thread1Thread1of1ForFork0_minus_#res#1_564| v_~f2_3~0_886) (<= 0 (+ v_~f1_6~0_959 2147483648)) (<= v_~f1_2~0_964 2147483647) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_674|) (= v_~f2_7~0_910 |v_thread2Thread1of1ForFork1_minus_#res#1_586|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_598| |v_thread2Thread1of1ForFork1_plus_#in~b#1_572|) (<= v_~f1_6~0_959 2147483647) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_548| |v_thread1Thread1of1ForFork0_minus_~a#1_582|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_566| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_570| |v_thread1Thread1of1ForFork0_plus_~b#1_570|)) (= |v_thread2Thread1of1ForFork1_plus_#res#1_578| v_~f1_6~0_958) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_572| |v_thread2Thread1of1ForFork1_minus_#in~b#1_580|) (= v_~f1_2~0_964 |v_thread1Thread1of1ForFork0_minus_#in~a#1_548|) (= v_~f1_2~0_964 |v_thread1Thread1of1ForFork0_plus_#res#1_566|) (<= v_~f1_2~0_966 2147483647) (= (+ (* v_~f2_3~0_888 987) (* v_~f1_2~0_966 1597)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_552|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_582|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_582| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_582|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_624|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_568| |v_thread2Thread1of1ForFork1_plus_~a#1_596|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_598| |v_thread2Thread1of1ForFork1_plus_~a#1_596|) |v_thread2Thread1of1ForFork1_plus_#res#1_578|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_602|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_602| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_602|))) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_721| 17) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_552| |v_thread1Thread1of1ForFork0_plus_~b#1_570|) (= (+ (* 610 v_~f2_7~0_911) (* v_~f1_6~0_959 987)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_580|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_578| 2147483647) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_580| v_~f1_6~0_958) (= |v_thread2Thread1of1ForFork1_minus_~a#1_602| (+ |v_thread2Thread1of1ForFork1_minus_~b#1_602| |v_thread2Thread1of1ForFork1_minus_#res#1_586|))) InVars {~f1_2~0=v_~f1_2~0_966, ~f2_3~0=v_~f2_3~0_888, ~n_0~0=v_~n_0~0_487, ~f2_7~0=v_~f2_7~0_911, ~f1_6~0=v_~f1_6~0_959} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_521|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_548|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_518|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_596|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_552|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_586|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_646|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_714|, ~f1_6~0=v_~f1_6~0_958, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_529|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_602|, ~f1_2~0=v_~f1_2~0_964, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_500|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_580|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_578|, ~n_0~0=v_~n_0~0_487, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_598|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_510|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_656|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_580|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_568|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_564|, ~f2_3~0=v_~f2_3~0_886, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_570|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_602|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_570|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_572|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_550|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_674|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_624|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_582|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_721|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_582|, ~f2_7~0=v_~f2_7~0_910, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_566|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_552|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_529|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [763] L54-5-->L54-5: Formula: (and (= v_~f1_6~0_86 |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_53| |v_thread2Thread1of1ForFork1_minus_#in~a#1_33|) (= v_~f2_7~0_96 |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#res#1_37|) |v_thread2Thread1of1ForFork1_minus_~a#1_53|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_~b#1_51| |v_thread2Thread1of1ForFork1_plus_#in~b#1_25|) (= v_~f1_6~0_87 |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~a#1_53| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_53|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_#in~a#1_21|) (= |v_thread2Thread1of1ForFork1_minus_#in~b#1_33| v_~f2_7~0_96) (<= 0 (+ 2147483648 v_~f2_7~0_95)) (= |v_thread2Thread1of1ForFork1_minus_#res#1_37| v_~f2_7~0_95) (<= v_~f2_7~0_95 2147483647) (< |v_thread2Thread1of1ForFork1_~i~1#1_48| v_~n_0~0_71) (= |v_thread2Thread1of1ForFork1_minus_~b#1_53| |v_thread2Thread1of1ForFork1_minus_#in~b#1_33|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| v_~f1_6~0_86) (= |v_thread2Thread1of1ForFork1_plus_#res#1_31| (+ |v_thread2Thread1of1ForFork1_plus_~a#1_49| |v_thread2Thread1of1ForFork1_plus_~b#1_51|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_48|) |v_thread2Thread1of1ForFork1_~i~1#1_47|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_31| 2147483647)) InVars {~n_0~0=v_~n_0~0_71, ~f2_7~0=v_~f2_7~0_96, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_48|, ~f1_6~0=v_~f1_6~0_87} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_21|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_25|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_49|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_47|, ~f1_6~0=v_~f1_6~0_86, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_33|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_25|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_33|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_31|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_51|, ~n_0~0=v_~n_0~0_71, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_33|, ~f2_7~0=v_~f2_7~0_95, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, ~f2_7~0, thread2Thread1of1ForFork1_#t~ret6#1] [2022-12-13 10:29:23,507 WARN L233 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 590 DAG size of output: 582 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:29:32,422 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 596 DAG size of output: 582 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:29:35,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1096] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_590| (+ (* v_~f1_6~0_997 1597) (* v_~f2_7~0_949 987))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_127| 0) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_594| |v_thread2Thread1of1ForFork1_minus_#in~b#1_602|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_568| |v_thread1Thread1of1ForFork0_plus_~b#1_586|) (= (+ |v_thread1Thread1of1ForFork0_plus_#in~b#1_568| (* v_~f1_2~0_995 610) (* 377 v_~f2_3~0_911)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_568|) (<= 0 (+ v_~f1_2~0_994 2147483648)) (= |v_thread2Thread1of1ForFork1_minus_#in~a#1_602| v_~f1_6~0_996) (<= v_~f1_6~0_997 2147483647) (= |v_thread1Thread1of1ForFork0_~i~0#1_741| 17) (= |v_thread1Thread1of1ForFork0_plus_#res#1_582| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_586| |v_thread1Thread1of1ForFork0_plus_~b#1_586|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_568| |v_thread1Thread1of1ForFork0_minus_#in~b#1_566|) (= v_~f1_2~0_994 |v_thread1Thread1of1ForFork0_plus_#res#1_582|) (= |v_thread2Thread1of1ForFork1_minus_~b#1_624| |v_thread2Thread1of1ForFork1_minus_#in~b#1_602|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_590| |v_thread2Thread1of1ForFork1_plus_~a#1_618|) (= v_~f1_2~0_994 |v_thread1Thread1of1ForFork0_minus_#in~a#1_564|) (= (+ |v_thread1Thread1of1ForFork0_minus_~b#1_598| |v_thread1Thread1of1ForFork0_minus_#res#1_580|) |v_thread1Thread1of1ForFork0_minus_~a#1_598|) (= |v_thread2Thread1of1ForFork1_minus_~a#1_624| |v_thread2Thread1of1ForFork1_minus_#in~a#1_602|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_600| 2147483647) (not (= (ite (or (<= 0 (+ v_~f1_2~0_995 2147483648)) (<= v_~f2_3~0_911 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_plus_~a#1_586| |v_thread1Thread1of1ForFork0_plus_#in~a#1_568|) (= |v_thread2Thread1of1ForFork1_plus_#res#1_600| v_~f1_6~0_996) (= |v_thread1Thread1of1ForFork0_minus_#res#1_580| v_~f2_3~0_910) (= v_~l_8~0_164 (ite (< 0 v_~f1_6~0_996) 1 0)) (< |v_thread2Thread1of1ForFork1_~i~1#1_742| (+ v_~n_0~0_503 1)) (<= v_~f1_2~0_995 2147483647) (= (+ (* v_~f1_2~0_995 1597) (* v_~f2_3~0_911 987)) |v_thread1Thread1of1ForFork0_plus_#in~a#1_568|) (= |v_thread2Thread1of1ForFork1_~i~1#1_742| 17) (= |v_thread1Thread1of1ForFork0_minus_~b#1_598| |v_thread1Thread1of1ForFork0_minus_#in~b#1_566|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_564| |v_thread1Thread1of1ForFork0_minus_~a#1_598|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_668| (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_624|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_624| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_624|))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_640| (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_598| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_598|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_598|)) 1 0)) (= (+ (* v_~f1_6~0_997 987) (* 610 v_~f2_7~0_949)) |v_thread2Thread1of1ForFork1_minus_#in~b#1_602|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_668| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_696|) (= v_~f2_7~0_948 |v_thread2Thread1of1ForFork1_minus_#res#1_608|) (= (+ |v_thread2Thread1of1ForFork1_plus_~b#1_620| |v_thread2Thread1of1ForFork1_plus_~a#1_618|) |v_thread2Thread1of1ForFork1_plus_#res#1_600|) (= (+ |v_thread2Thread1of1ForFork1_minus_~b#1_624| |v_thread2Thread1of1ForFork1_minus_#res#1_608|) |v_thread2Thread1of1ForFork1_minus_~a#1_624|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_620| |v_thread2Thread1of1ForFork1_plus_#in~b#1_594|) (<= v_~f1_2~0_994 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_600| 2147483648)) (= |v_thread2Thread1of1ForFork1_#res#1.base_127| 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_742| v_~n_0~0_503)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_640| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672|) (<= 0 (+ v_~f1_6~0_997 2147483648))) InVars {~f1_2~0=v_~f1_2~0_995, ~f2_3~0=v_~f2_3~0_911, ~n_0~0=v_~n_0~0_503, ~f2_7~0=v_~f2_7~0_949, ~f1_6~0=v_~f1_6~0_997} OutVars{thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_543|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_564|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_127|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_532|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_618|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_568|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_608|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_668|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_742|, ~f1_6~0=v_~f1_6~0_996, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_551|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_624|, ~f1_2~0=v_~f1_2~0_994, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_514|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_602|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_600|, ~n_0~0=v_~n_0~0_503, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_620|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_524|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_672|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_602|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_590|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_580|, ~f2_3~0=v_~f2_3~0_910, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_586|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_624|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_586|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_594|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_566|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_696|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_640|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_127|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_598|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_741|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_598|, ~l_8~0=v_~l_8~0_164, ~f2_7~0=v_~f2_7~0_948, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_582|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_568|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_551|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~f1_6~0, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_minus_~a#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, ~l_8~0, ~f2_7~0, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1] and [762] L44-5-->L44-5: Formula: (and (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| |v_thread1Thread1of1ForFork0_plus_~a#1_45|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#res#1_37|)) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_27| |v_thread1Thread1of1ForFork0_plus_~b#1_45|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| (+ |v_thread1Thread1of1ForFork0_~i~0#1_48| 1)) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_25| v_~f2_3~0_82) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_27| v_~f1_2~0_93) (<= v_~f1_2~0_92 2147483647) (<= |v_thread1Thread1of1ForFork0_minus_#res#1_37| 2147483647) (not (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_57| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_57| 2147483648))) 1 0) 0)) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_57|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_57| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_57|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_57| |v_thread1Thread1of1ForFork0_minus_#in~b#1_25|) (= v_~f1_2~0_92 |v_thread1Thread1of1ForFork0_minus_#in~a#1_23|) (< |v_thread1Thread1of1ForFork0_~i~0#1_48| v_~n_0~0_69) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_45| |v_thread1Thread1of1ForFork0_plus_~b#1_45|)) (= |v_thread1Thread1of1ForFork0_plus_#res#1_41| v_~f1_2~0_92) (= v_~f2_3~0_81 |v_thread1Thread1of1ForFork0_minus_#res#1_37|) (<= 0 (+ v_~f1_2~0_92 2147483648))) InVars {~f1_2~0=v_~f1_2~0_93, ~f2_3~0=v_~f2_3~0_82, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_48|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_37|, ~f2_3~0=v_~f2_3~0_81, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_45|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_23|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_41|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_45|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_27|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ~f1_2~0=v_~f1_2~0_92, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_23|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_57|, ~n_0~0=v_~n_0~0_69, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_33|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_41|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_27|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, ~f2_3~0, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~f1_2~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1] [2022-12-13 10:29:35,160 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:35,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25802 [2022-12-13 10:29:35,160 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 177 transitions, 4809 flow [2022-12-13 10:29:35,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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-13 10:29:35,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:35,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 10:29:35,161 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash 545911991, now seen corresponding path program 1 times [2022-12-13 10:29:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:35,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807852036] [2022-12-13 10:29:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:35,169 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-13 10:29:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:35,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807852036] [2022-12-13 10:29:35,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807852036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:35,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:35,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:29:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259297083] [2022-12-13 10:29:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:35,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 10:29:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:35,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 10:29:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 10:29:35,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 73 [2022-12-13 10:29:35,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 177 transitions, 4809 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-13 10:29:35,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:35,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 73 [2022-12-13 10:29:35,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:35,481 INFO L130 PetriNetUnfolder]: 563/1007 cut-off events. [2022-12-13 10:29:35,481 INFO L131 PetriNetUnfolder]: For 59056/59178 co-relation queries the response was YES. [2022-12-13 10:29:35,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12804 conditions, 1007 events. 563/1007 cut-off events. For 59056/59178 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5276 event pairs, 187 based on Foata normal form. 4/1011 useless extension candidates. Maximal degree in co-relation 12673. Up to 1005 conditions per place. [2022-12-13 10:29:35,490 INFO L137 encePairwiseOnDemand]: 71/73 looper letters, 173 selfloop transitions, 0 changer transitions 1/175 dead transitions. [2022-12-13 10:29:35,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 175 transitions, 5002 flow [2022-12-13 10:29:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 10:29:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 10:29:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-12-13 10:29:35,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5068493150684932 [2022-12-13 10:29:35,491 INFO L175 Difference]: Start difference. First operand has 159 places, 177 transitions, 4809 flow. Second operand 2 states and 74 transitions. [2022-12-13 10:29:35,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 175 transitions, 5002 flow [2022-12-13 10:29:35,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 175 transitions, 4810 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-12-13 10:29:35,606 INFO L231 Difference]: Finished difference. Result has 154 places, 174 transitions, 4432 flow [2022-12-13 10:29:35,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=4462, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=4432, PETRI_PLACES=154, PETRI_TRANSITIONS=174} [2022-12-13 10:29:35,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 134 predicate places. [2022-12-13 10:29:35,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:35,607 INFO L89 Accepts]: Start accepts. Operand has 154 places, 174 transitions, 4432 flow [2022-12-13 10:29:35,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:35,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:35,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 174 transitions, 4432 flow [2022-12-13 10:29:35,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 174 transitions, 4432 flow [2022-12-13 10:29:35,673 INFO L130 PetriNetUnfolder]: 163/423 cut-off events. [2022-12-13 10:29:35,673 INFO L131 PetriNetUnfolder]: For 23512/23567 co-relation queries the response was YES. [2022-12-13 10:29:35,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 423 events. 163/423 cut-off events. For 23512/23567 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2554 event pairs, 2 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 5135. Up to 209 conditions per place. [2022-12-13 10:29:35,678 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 174 transitions, 4432 flow [2022-12-13 10:29:35,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-13 10:29:35,679 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:35,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 10:29:35,680 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 174 transitions, 4432 flow [2022-12-13 10:29:35,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-13 10:29:35,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:35,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:35,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-13 10:29:35,680 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash -582957671, now seen corresponding path program 1 times [2022-12-13 10:29:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179543095] [2022-12-13 10:29:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:35,701 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-13 10:29:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:35,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179543095] [2022-12-13 10:29:35,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179543095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:35,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:35,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2639995] [2022-12-13 10:29:35,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:35,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:35,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:35,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:35,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 10:29:35,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 174 transitions, 4432 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-13 10:29:35,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:35,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 10:29:35,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:36,052 INFO L130 PetriNetUnfolder]: 578/1043 cut-off events. [2022-12-13 10:29:36,053 INFO L131 PetriNetUnfolder]: For 55925/55925 co-relation queries the response was YES. [2022-12-13 10:29:36,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12882 conditions, 1043 events. 578/1043 cut-off events. For 55925/55925 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5490 event pairs, 120 based on Foata normal form. 4/1047 useless extension candidates. Maximal degree in co-relation 12295. Up to 754 conditions per place. [2022-12-13 10:29:36,062 INFO L137 encePairwiseOnDemand]: 35/70 looper letters, 120 selfloop transitions, 65 changer transitions 0/185 dead transitions. [2022-12-13 10:29:36,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 4978 flow [2022-12-13 10:29:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-13 10:29:36,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 10:29:36,063 INFO L175 Difference]: Start difference. First operand has 152 places, 174 transitions, 4432 flow. Second operand 3 states and 80 transitions. [2022-12-13 10:29:36,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 4978 flow [2022-12-13 10:29:36,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 185 transitions, 4938 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 10:29:36,188 INFO L231 Difference]: Finished difference. Result has 153 places, 173 transitions, 4535 flow [2022-12-13 10:29:36,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4292, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4535, PETRI_PLACES=153, PETRI_TRANSITIONS=173} [2022-12-13 10:29:36,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 133 predicate places. [2022-12-13 10:29:36,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:36,188 INFO L89 Accepts]: Start accepts. Operand has 153 places, 173 transitions, 4535 flow [2022-12-13 10:29:36,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:36,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:36,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 173 transitions, 4535 flow [2022-12-13 10:29:36,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 173 transitions, 4535 flow [2022-12-13 10:29:36,256 INFO L130 PetriNetUnfolder]: 164/439 cut-off events. [2022-12-13 10:29:36,256 INFO L131 PetriNetUnfolder]: For 25157/25212 co-relation queries the response was YES. [2022-12-13 10:29:36,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5534 conditions, 439 events. 164/439 cut-off events. For 25157/25212 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2709 event pairs, 2 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 5347. Up to 212 conditions per place. [2022-12-13 10:29:36,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 173 transitions, 4535 flow [2022-12-13 10:29:36,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 10:29:36,264 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:36,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 10:29:36,264 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 173 transitions, 4535 flow [2022-12-13 10:29:36,264 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-13 10:29:36,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:36,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:36,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-13 10:29:36,264 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -576636258, now seen corresponding path program 1 times [2022-12-13 10:29:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:36,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028887884] [2022-12-13 10:29:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:36,283 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-13 10:29:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:36,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028887884] [2022-12-13 10:29:36,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028887884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:36,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:36,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397276130] [2022-12-13 10:29:36,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:36,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:36,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:36,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 68 [2022-12-13 10:29:36,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 173 transitions, 4535 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:36,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:36,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 68 [2022-12-13 10:29:36,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:36,615 INFO L130 PetriNetUnfolder]: 581/1049 cut-off events. [2022-12-13 10:29:36,616 INFO L131 PetriNetUnfolder]: For 61309/61419 co-relation queries the response was YES. [2022-12-13 10:29:36,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13258 conditions, 1049 events. 581/1049 cut-off events. For 61309/61419 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5531 event pairs, 173 based on Foata normal form. 6/1055 useless extension candidates. Maximal degree in co-relation 12709. Up to 957 conditions per place. [2022-12-13 10:29:36,626 INFO L137 encePairwiseOnDemand]: 57/68 looper letters, 156 selfloop transitions, 22 changer transitions 0/179 dead transitions. [2022-12-13 10:29:36,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 179 transitions, 5030 flow [2022-12-13 10:29:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 10:29:36,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37745098039215685 [2022-12-13 10:29:36,627 INFO L175 Difference]: Start difference. First operand has 153 places, 173 transitions, 4535 flow. Second operand 3 states and 77 transitions. [2022-12-13 10:29:36,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 179 transitions, 5030 flow [2022-12-13 10:29:36,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 179 transitions, 4955 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 10:29:36,734 INFO L231 Difference]: Finished difference. Result has 155 places, 174 transitions, 4570 flow [2022-12-13 10:29:36,734 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=4460, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4570, PETRI_PLACES=155, PETRI_TRANSITIONS=174} [2022-12-13 10:29:36,735 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 135 predicate places. [2022-12-13 10:29:36,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:36,735 INFO L89 Accepts]: Start accepts. Operand has 155 places, 174 transitions, 4570 flow [2022-12-13 10:29:36,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:36,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:36,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 174 transitions, 4570 flow [2022-12-13 10:29:36,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 174 transitions, 4570 flow [2022-12-13 10:29:36,815 INFO L130 PetriNetUnfolder]: 166/445 cut-off events. [2022-12-13 10:29:36,815 INFO L131 PetriNetUnfolder]: For 26363/26418 co-relation queries the response was YES. [2022-12-13 10:29:36,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5638 conditions, 445 events. 166/445 cut-off events. For 26363/26418 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2755 event pairs, 2 based on Foata normal form. 0/445 useless extension candidates. Maximal degree in co-relation 5448. Up to 214 conditions per place. [2022-12-13 10:29:36,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 174 transitions, 4570 flow [2022-12-13 10:29:36,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 10:29:36,824 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:36,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 10:29:36,824 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 174 transitions, 4570 flow [2022-12-13 10:29:36,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:36,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:36,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:36,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-13 10:29:36,824 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1042056994, now seen corresponding path program 1 times [2022-12-13 10:29:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:36,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288972200] [2022-12-13 10:29:36,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:29:36,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:36,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288972200] [2022-12-13 10:29:36,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288972200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:36,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:36,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588129951] [2022-12-13 10:29:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:36,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:36,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-13 10:29:36,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 174 transitions, 4570 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-13 10:29:36,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:36,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-13 10:29:36,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:37,192 INFO L130 PetriNetUnfolder]: 592/1067 cut-off events. [2022-12-13 10:29:37,192 INFO L131 PetriNetUnfolder]: For 61009/61009 co-relation queries the response was YES. [2022-12-13 10:29:37,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13559 conditions, 1067 events. 592/1067 cut-off events. For 61009/61009 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5646 event pairs, 134 based on Foata normal form. 4/1071 useless extension candidates. Maximal degree in co-relation 12949. Up to 848 conditions per place. [2022-12-13 10:29:37,203 INFO L137 encePairwiseOnDemand]: 37/68 looper letters, 123 selfloop transitions, 59 changer transitions 0/182 dead transitions. [2022-12-13 10:29:37,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 182 transitions, 5113 flow [2022-12-13 10:29:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 10:29:37,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2022-12-13 10:29:37,205 INFO L175 Difference]: Start difference. First operand has 155 places, 174 transitions, 4570 flow. Second operand 3 states and 74 transitions. [2022-12-13 10:29:37,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 182 transitions, 5113 flow [2022-12-13 10:29:37,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 182 transitions, 5081 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 10:29:37,385 INFO L231 Difference]: Finished difference. Result has 157 places, 175 transitions, 4761 flow [2022-12-13 10:29:37,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=4538, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4761, PETRI_PLACES=157, PETRI_TRANSITIONS=175} [2022-12-13 10:29:37,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 137 predicate places. [2022-12-13 10:29:37,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:37,385 INFO L89 Accepts]: Start accepts. Operand has 157 places, 175 transitions, 4761 flow [2022-12-13 10:29:37,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:37,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:37,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 175 transitions, 4761 flow [2022-12-13 10:29:37,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 175 transitions, 4761 flow [2022-12-13 10:29:37,489 INFO L130 PetriNetUnfolder]: 168/449 cut-off events. [2022-12-13 10:29:37,489 INFO L131 PetriNetUnfolder]: For 28058/28113 co-relation queries the response was YES. [2022-12-13 10:29:37,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 449 events. 168/449 cut-off events. For 28058/28113 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2754 event pairs, 2 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 5664. Up to 217 conditions per place. [2022-12-13 10:29:37,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 175 transitions, 4761 flow [2022-12-13 10:29:37,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 10:29:37,500 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:37,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 10:29:37,501 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 175 transitions, 4761 flow [2022-12-13 10:29:37,501 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-13 10:29:37,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:37,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:29:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-13 10:29:37,501 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 10:29:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 747052581, now seen corresponding path program 1 times [2022-12-13 10:29:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073824768] [2022-12-13 10:29:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:37,980 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-13 10:29:37,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073824768] [2022-12-13 10:29:37,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073824768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:29:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062324962] [2022-12-13 10:29:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:37,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:29:37,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:29:37,982 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-13 10:29:37,983 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-13 10:29:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:38,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:29:38,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:31,332 WARN L233 SmtUtils]: Spent 52.51s on a formula simplification. DAG size of input: 96 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:31:03,707 WARN L233 SmtUtils]: Spent 32.21s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:31:24,314 WARN L233 SmtUtils]: Spent 18.29s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:31:24,480 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-13 10:31:24,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:31:26,280 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-13 10:31:26,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062324962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:31:26,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:31:26,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 10:31:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309135351] [2022-12-13 10:31:26,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:31:26,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:31:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:31:26,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2022-12-13 10:31:26,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 68 [2022-12-13 10:31:26,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 175 transitions, 4761 flow. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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-13 10:31:26,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:26,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 68 [2022-12-13 10:31:26,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:28,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:31:30,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:31:32,467 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 [0] [2022-12-13 10:31:34,482 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 [0] [2022-12-13 10:31:36,540 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 [0] [2022-12-13 10:31:38,697 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 [0] [2022-12-13 10:31:40,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:31:42,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:31:44,811 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 [0] [2022-12-13 10:31:46,878 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 [0] [2022-12-13 10:31:49,273 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 [0] [2022-12-13 10:31:51,311 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 [0] [2022-12-13 10:31:53,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:31:55,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 10:31:57,986 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 [0] [2022-12-13 10:32:59,251 WARN L233 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 129 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 10:33:00,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2022-12-13 10:33:03,368 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:33:03,368 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:33:04,378 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-13 10:33:04,569 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 10:33:04,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-13 10:33:04,604 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 10:33:04,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-13 10:33:04,604 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-13 10:33:04,606 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 10:33:04,606 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 10:33:04,606 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:33:04,609 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:33:04,609 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:33:04,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:33:04 BasicIcfg [2022-12-13 10:33:04,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:33:04,614 INFO L158 Benchmark]: Toolchain (without parser) took 722319.27ms. Allocated memory was 186.6MB in the beginning and 488.6MB in the end (delta: 302.0MB). Free memory was 163.5MB in the beginning and 375.2MB in the end (delta: -211.8MB). Peak memory consumption was 359.2MB. Max. memory is 8.0GB. [2022-12-13 10:33:04,614 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory was 163.2MB in the beginning and 163.1MB in the end (delta: 83.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:33:04,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.19ms. Allocated memory is still 186.6MB. Free memory was 162.9MB in the beginning and 151.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 10:33:04,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.03ms. Allocated memory is still 186.6MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:33:04,616 INFO L158 Benchmark]: Boogie Preprocessor took 34.56ms. Allocated memory is still 186.6MB. Free memory was 149.8MB in the beginning and 148.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 10:33:04,617 INFO L158 Benchmark]: RCFGBuilder took 493.06ms. Allocated memory is still 186.6MB. Free memory was 148.3MB in the beginning and 130.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 10:33:04,617 INFO L158 Benchmark]: TraceAbstraction took 721438.07ms. Allocated memory was 186.6MB in the beginning and 488.6MB in the end (delta: 302.0MB). Free memory was 129.4MB in the beginning and 375.2MB in the end (delta: -245.8MB). Peak memory consumption was 325.7MB. Max. memory is 8.0GB. [2022-12-13 10:33:04,620 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 186.6MB. Free memory was 163.2MB in the beginning and 163.1MB in the end (delta: 83.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.19ms. Allocated memory is still 186.6MB. Free memory was 162.9MB in the beginning and 151.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.03ms. Allocated memory is still 186.6MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.56ms. Allocated memory is still 186.6MB. Free memory was 149.8MB in the beginning and 148.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 493.06ms. Allocated memory is still 186.6MB. Free memory was 148.3MB in the beginning and 130.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 721438.07ms. Allocated memory was 186.6MB in the beginning and 488.6MB in the end (delta: 302.0MB). Free memory was 129.4MB in the beginning and 375.2MB in the end (delta: -245.8MB). Peak memory consumption was 325.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 172 PlacesBefore, 20 PlacesAfterwards, 179 TransitionsBefore, 15 TransitionsAfterwards, 7452 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 53 TrivialYvCompositions, 99 ConcurrentYvCompositions, 12 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4839, independent: 4839, independent conditional: 4839, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4314, independent: 4314, independent conditional: 0, independent unconditional: 4314, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4314, independent: 4314, independent conditional: 0, independent unconditional: 4314, 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: 4314, independent: 4314, independent conditional: 0, independent unconditional: 4314, 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: 4839, independent: 525, independent conditional: 525, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4314, unknown conditional: 4314, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4394, Positive cache size: 4394, Positive conditional cache size: 4394, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 4, Positive cache size: 4, Positive conditional cache size: 4, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 4, Positive cache size: 4, Positive conditional cache size: 4, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 26 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 5, Positive cache size: 5, Positive conditional cache size: 5, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 30 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 12, independent: 8, independent conditional: 8, 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): 9, Positive cache size: 9, Positive conditional cache size: 9, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 14, Positive cache size: 14, Positive conditional cache size: 14, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 14, Positive cache size: 14, Positive conditional cache size: 14, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 14, Positive cache size: 14, Positive conditional cache size: 14, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 14, Positive cache size: 14, Positive conditional cache size: 14, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 18, Positive cache size: 18, Positive conditional cache size: 18, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 19, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 19, Positive cache size: 19, Positive conditional cache size: 19, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 52 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 21, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 52 PlacesBefore, 52 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 37, Positive conditional cache size: 37, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 40 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 3, independent: 2, independent conditional: 2, 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): 38, Positive cache size: 38, Positive conditional cache size: 38, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 39 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 44, Positive conditional cache size: 44, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 44, Positive cache size: 44, Positive conditional cache size: 44, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 42 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 50, Positive cache size: 50, Positive conditional cache size: 50, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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): 51, Positive cache size: 51, Positive conditional cache size: 51, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 43 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, 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: 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: 9, independent: 4, independent conditional: 4, 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): 56, Positive cache size: 56, Positive conditional cache size: 56, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, 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: 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): 61, Positive cache size: 61, Positive conditional cache size: 61, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 61, Positive cache size: 61, Positive conditional cache size: 61, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 66, Positive cache size: 66, Positive conditional cache size: 66, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 76, Positive conditional cache size: 76, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 76, Positive cache size: 76, Positive conditional cache size: 76, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 77, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 10, independent: 1, independent conditional: 1, 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): 86, Positive cache size: 86, Positive conditional cache size: 86, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 51 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 46 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 15, independent: 10, independent conditional: 10, 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): 91, Positive cache size: 91, Positive conditional cache size: 91, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 91, Positive cache size: 91, Positive conditional cache size: 91, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.8s, 53 PlacesBefore, 53 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 6, independent: 1, independent conditional: 1, 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): 96, Positive cache size: 96, Positive conditional cache size: 96, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 55 PlacesBefore, 55 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 103, Positive cache size: 103, Positive conditional cache size: 103, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 53 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 104, Positive conditional cache size: 104, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 57 PlacesBefore, 56 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 14, independent: 0, independent conditional: 0, 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 118, Positive cache size: 118, Positive conditional cache size: 118, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 80 PlacesBefore, 80 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 122, Positive cache size: 122, Positive conditional cache size: 122, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 83 PlacesBefore, 83 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 204, Positive conditional cache size: 204, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 92 PlacesBefore, 91 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 14, independent: 0, independent conditional: 0, 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): 218, Positive cache size: 218, Positive conditional cache size: 218, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 90 PlacesBefore, 90 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 219, Positive conditional cache size: 219, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 219, Positive cache size: 219, Positive conditional cache size: 219, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 91 PlacesBefore, 90 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 223, Positive conditional cache size: 223, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 95 PlacesBefore, 95 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 229, Positive conditional cache size: 229, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 94 PlacesBefore, 94 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 230, Positive conditional cache size: 230, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 230, Positive cache size: 230, Positive conditional cache size: 230, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 101 PlacesBefore, 102 PlacesAfterwards, 95 TransitionsBefore, 96 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 238, Positive conditional cache size: 238, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 103 PlacesBefore, 100 PlacesAfterwards, 94 TransitionsBefore, 92 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 242, Positive cache size: 242, Positive conditional cache size: 242, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 242, Positive cache size: 242, Positive conditional cache size: 242, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 242, Positive cache size: 242, Positive conditional cache size: 242, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 242, Positive cache size: 242, Positive conditional cache size: 242, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 106 PlacesBefore, 105 PlacesAfterwards, 104 TransitionsBefore, 103 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 344, Positive conditional cache size: 344, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 109 PlacesBefore, 109 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 6, independent: 1, independent conditional: 1, 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): 349, Positive cache size: 349, Positive conditional cache size: 349, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 111 PlacesBefore, 108 PlacesAfterwards, 107 TransitionsBefore, 105 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 353, Positive cache size: 353, Positive conditional cache size: 353, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 353, Positive cache size: 353, Positive conditional cache size: 353, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 353, Positive cache size: 353, Positive conditional cache size: 353, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 353, Positive cache size: 353, Positive conditional cache size: 353, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 118 PlacesBefore, 117 PlacesAfterwards, 125 TransitionsBefore, 124 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 16, independent: 2, independent conditional: 2, 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): 367, Positive cache size: 367, Positive conditional cache size: 367, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 121 PlacesBefore, 121 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 367, Positive cache size: 367, Positive conditional cache size: 367, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 119 PlacesBefore, 118 PlacesAfterwards, 122 TransitionsBefore, 121 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, 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: 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): 371, Positive cache size: 371, Positive conditional cache size: 371, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 121 PlacesBefore, 118 PlacesAfterwards, 122 TransitionsBefore, 120 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 375, Positive cache size: 375, Positive conditional cache size: 375, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 375, Positive cache size: 375, Positive conditional cache size: 375, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 121 PlacesBefore, 121 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 376, Positive conditional cache size: 376, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 122 PlacesBefore, 121 PlacesAfterwards, 123 TransitionsBefore, 122 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 380, Positive cache size: 380, Positive conditional cache size: 380, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 121 PlacesBefore, 120 PlacesAfterwards, 121 TransitionsBefore, 119 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 387, Positive cache size: 387, Positive conditional cache size: 387, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 119 PlacesBefore, 119 PlacesAfterwards, 120 TransitionsBefore, 119 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 388, Positive conditional cache size: 388, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 118 PlacesBefore, 117 PlacesAfterwards, 120 TransitionsBefore, 119 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 392, Positive cache size: 392, Positive conditional cache size: 392, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 118 TransitionsBefore, 117 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 392, Positive cache size: 392, Positive conditional cache size: 392, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 119 PlacesBefore, 119 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 393, Positive cache size: 393, Positive conditional cache size: 393, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 120 PlacesBefore, 119 PlacesAfterwards, 121 TransitionsBefore, 120 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 397, Positive cache size: 397, Positive conditional cache size: 397, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 121 PlacesBefore, 121 PlacesAfterwards, 121 TransitionsBefore, 121 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 398, Positive conditional cache size: 398, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 398, Positive cache size: 398, Positive conditional cache size: 398, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 122 PlacesBefore, 121 PlacesAfterwards, 123 TransitionsBefore, 122 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 402, Positive cache size: 402, Positive conditional cache size: 402, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 123 PlacesBefore, 123 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 403, Positive conditional cache size: 403, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 122 PlacesBefore, 119 PlacesAfterwards, 124 TransitionsBefore, 122 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 407, Positive cache size: 407, Positive conditional cache size: 407, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 123 TransitionsBefore, 122 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 407, Positive cache size: 407, Positive conditional cache size: 407, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 407, Positive cache size: 407, Positive conditional cache size: 407, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9s, 126 PlacesBefore, 125 PlacesAfterwards, 127 TransitionsBefore, 126 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 411, Positive conditional cache size: 411, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 125 PlacesBefore, 125 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 411, Positive cache size: 411, Positive conditional cache size: 411, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 411, Positive cache size: 411, Positive conditional cache size: 411, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.0s, 130 PlacesBefore, 129 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 415, Positive cache size: 415, Positive conditional cache size: 415, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 134 PlacesBefore, 134 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 419, Positive cache size: 419, Positive conditional cache size: 419, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 131 PlacesBefore, 131 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 419, Positive cache size: 419, Positive conditional cache size: 419, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.1s, 137 PlacesBefore, 136 PlacesAfterwards, 136 TransitionsBefore, 135 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 423, Positive conditional cache size: 423, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.1s, 146 PlacesBefore, 143 PlacesAfterwards, 154 TransitionsBefore, 151 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 613, Positive cache size: 613, Positive conditional cache size: 613, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.5s, 142 PlacesBefore, 141 PlacesAfterwards, 153 TransitionsBefore, 152 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 617, Positive cache size: 617, Positive conditional cache size: 617, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 144 PlacesBefore, 144 PlacesAfterwards, 155 TransitionsBefore, 154 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 6, independent: 1, independent conditional: 1, 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): 622, Positive cache size: 622, Positive conditional cache size: 622, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.5s, 146 PlacesBefore, 145 PlacesAfterwards, 156 TransitionsBefore, 155 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 626, Positive cache size: 626, Positive conditional cache size: 626, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 144 PlacesBefore, 144 PlacesAfterwards, 156 TransitionsBefore, 155 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 626, Positive cache size: 626, Positive conditional cache size: 626, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 144 PlacesBefore, 144 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 626, Positive cache size: 626, Positive conditional cache size: 626, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.9s, 150 PlacesBefore, 149 PlacesAfterwards, 160 TransitionsBefore, 159 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 630, Positive cache size: 630, Positive conditional cache size: 630, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 151 PlacesBefore, 151 PlacesAfterwards, 162 TransitionsBefore, 164 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 640, Positive conditional cache size: 640, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 152 PlacesBefore, 151 PlacesAfterwards, 162 TransitionsBefore, 161 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 644, Positive cache size: 644, Positive conditional cache size: 644, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.8s, 153 PlacesBefore, 152 PlacesAfterwards, 163 TransitionsBefore, 162 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 648, Positive conditional cache size: 648, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 148 PlacesBefore, 148 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 649, Positive cache size: 649, Positive conditional cache size: 649, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 150 PlacesBefore, 150 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 649, Positive cache size: 649, Positive conditional cache size: 649, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.1s, 157 PlacesBefore, 156 PlacesAfterwards, 173 TransitionsBefore, 172 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 653, Positive conditional cache size: 653, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 155 PlacesBefore, 155 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 653, Positive cache size: 653, Positive conditional cache size: 653, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 154 PlacesBefore, 154 PlacesAfterwards, 174 TransitionsBefore, 174 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 662, Positive cache size: 662, Positive conditional cache size: 662, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 156 PlacesBefore, 156 PlacesAfterwards, 177 TransitionsBefore, 177 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 662, Positive cache size: 662, Positive conditional cache size: 662, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.7s, 160 PlacesBefore, 159 PlacesAfterwards, 178 TransitionsBefore, 177 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 5, independent: 3, independent conditional: 3, 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): 664, Positive cache size: 664, Positive conditional cache size: 664, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 174 TransitionsBefore, 174 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 664, Positive cache size: 664, Positive conditional cache size: 664, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 664, Positive cache size: 664, Positive conditional cache size: 664, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 155 PlacesBefore, 155 PlacesAfterwards, 174 TransitionsBefore, 174 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 664, Positive cache size: 664, Positive conditional cache size: 664, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 157 PlacesBefore, 157 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 664, Positive cache size: 664, Positive conditional cache size: 664, 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 - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 276 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: 721.2s, OverallIterations: 109, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 164.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 28 mSolverCounterUnknown, 1692 SdHoareTripleChecker+Valid, 79.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1692 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 77.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19917 IncrementalHoareTripleChecker+Invalid, 20435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 68 mSDtfsCounter, 19917 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 883 GetRequests, 313 SyntacticMatches, 27 SemanticMatches, 543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 178.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4809occurred in iteration=104, InterpolantAutomatonStates: 547, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 132.8s InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 1515 ConstructedInterpolants, 7 QuantifiedInterpolants, 21241 SizeOfPredicates, 251 NumberOfNonLiveVariables, 2422 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 133 InterpolantComputations, 97 PerfectInterpolantSequences, 4/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown