/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/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:30:07,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:30:07,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:30:07,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:30:07,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:30:07,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:30:07,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:30:07,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:30:07,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:30:07,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:30:07,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:30:07,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:30:07,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:30:07,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:30:07,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:30:07,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:30:07,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:30:07,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:30:07,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:30:07,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:30:07,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:30:07,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:30:07,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:30:07,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:30:07,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:30:07,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:30:07,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:30:07,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:30:07,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:30:07,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:30:07,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:30:07,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:30:07,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:30:07,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:30:07,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:30:07,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:30:07,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:30:07,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:30:07,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:30:07,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:30:07,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:30:07,970 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:30:07,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:30:07,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:30:07,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:30:07,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:30:07,998 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:30:07,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:30:07,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:30:07,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:30:07,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:30:07,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:30:07,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:30:08,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:30:08,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:30:08,000 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:30:08,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:30:08,000 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:30:08,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:30:08,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:30:08,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:30:08,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:30:08,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:30:08,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:30:08,002 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:30:08,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:30:08,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:30:08,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:30:08,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:30:08,341 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:30:08,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2022-12-13 10:30:09,302 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:30:09,526 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:30:09,527 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2022-12-13 10:30:09,532 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76e7f791/1406353278eb42cc9150f541fadecc03/FLAG9d38d5c29 [2022-12-13 10:30:09,542 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f76e7f791/1406353278eb42cc9150f541fadecc03 [2022-12-13 10:30:09,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:30:09,544 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:30:09,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:30:09,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:30:09,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:30:09,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a497ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09, skipping insertion in model container [2022-12-13 10:30:09,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:30:09,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:30:09,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,687 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/parallel-misc-3-extended.wvr.c[2856,2869] [2022-12-13 10:30:09,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:30:09,702 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:30:09,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:30:09,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:30:09,733 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/parallel-misc-3-extended.wvr.c[2856,2869] [2022-12-13 10:30:09,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:30:09,747 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:30:09,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09 WrapperNode [2022-12-13 10:30:09,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:30:09,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:30:09,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:30:09,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:30:09,753 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:30:09" (1/1) ... [2022-12-13 10:30:09,766 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:30:09" (1/1) ... [2022-12-13 10:30:09,783 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-12-13 10:30:09,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:30:09,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:30:09,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:30:09,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:30:09,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:30:09,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:30:09,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:30:09,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:30:09,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (1/1) ... [2022-12-13 10:30:09,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:30:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:09,873 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:30:09,947 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:30:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:30:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:30:09,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:30:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:30:09,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:30:09,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:30:09,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:30:09,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:30:09,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:30:09,963 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:30:10,027 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:30:10,028 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:30:10,249 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:30:10,265 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:30:10,265 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 10:30:10,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:30:10 BoogieIcfgContainer [2022-12-13 10:30:10,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:30:10,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:30:10,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:30:10,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:30:10,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:30:09" (1/3) ... [2022-12-13 10:30:10,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cb9499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:30:10, skipping insertion in model container [2022-12-13 10:30:10,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:30:09" (2/3) ... [2022-12-13 10:30:10,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cb9499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:30:10, skipping insertion in model container [2022-12-13 10:30:10,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:30:10" (3/3) ... [2022-12-13 10:30:10,276 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2022-12-13 10:30:10,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:30:10,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:30:10,290 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:30:10,390 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 10:30:10,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 124 transitions, 272 flow [2022-12-13 10:30:10,479 INFO L130 PetriNetUnfolder]: 16/121 cut-off events. [2022-12-13 10:30:10,480 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:30:10,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 16/121 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2022-12-13 10:30:10,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 124 transitions, 272 flow [2022-12-13 10:30:10,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 111 transitions, 240 flow [2022-12-13 10:30:10,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:10,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 111 transitions, 240 flow [2022-12-13 10:30:10,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 111 transitions, 240 flow [2022-12-13 10:30:10,527 INFO L130 PetriNetUnfolder]: 16/111 cut-off events. [2022-12-13 10:30:10,527 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:30:10,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 16/111 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 126 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2022-12-13 10:30:10,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 111 transitions, 240 flow [2022-12-13 10:30:10,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 2958 [2022-12-13 10:30:13,646 INFO L241 LiptonReduction]: Total number of compositions: 89 [2022-12-13 10:30:13,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:30:13,676 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;@b0ec53c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:30:13,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 10:30:13,688 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 10:30:13,688 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:30:13,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:13,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:13,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1291747388, now seen corresponding path program 1 times [2022-12-13 10:30:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:13,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485144711] [2022-12-13 10:30:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:13,919 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:30:13,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:13,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485144711] [2022-12-13 10:30:13,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485144711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:13,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:13,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:30:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760957942] [2022-12-13 10:30:13,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:13,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:30:13,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:13,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:30:13,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:30:13,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:30:13,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:13,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:13,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:30:13,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:14,007 INFO L130 PetriNetUnfolder]: 111/168 cut-off events. [2022-12-13 10:30:14,008 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 10:30:14,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 111/168 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 336 event pairs, 17 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 244. Up to 105 conditions per place. [2022-12-13 10:30:14,010 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 27 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-13 10:30:14,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 140 flow [2022-12-13 10:30:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:30:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:30:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 10:30:14,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 10:30:14,018 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 56 flow. Second operand 3 states and 30 transitions. [2022-12-13 10:30:14,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 140 flow [2022-12-13 10:30:14,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 29 transitions, 124 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:14,021 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 56 flow [2022-12-13 10:30:14,023 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2022-12-13 10:30:14,025 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2022-12-13 10:30:14,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:14,025 INFO L89 Accepts]: Start accepts. Operand has 23 places, 20 transitions, 56 flow [2022-12-13 10:30:14,027 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:14,027 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:14,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 20 transitions, 56 flow [2022-12-13 10:30:14,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 56 flow [2022-12-13 10:30:14,030 INFO L130 PetriNetUnfolder]: 3/20 cut-off events. [2022-12-13 10:30:14,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:30:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 20 events. 3/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 17. Up to 4 conditions per place. [2022-12-13 10:30:14,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 20 transitions, 56 flow [2022-12-13 10:30:14,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 10:30:14,033 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:14,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 10:30:14,034 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 56 flow [2022-12-13 10:30:14,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:14,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:14,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:14,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:30:14,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1393409920, now seen corresponding path program 1 times [2022-12-13 10:30:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:14,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349632552] [2022-12-13 10:30:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:14,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:30:14,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:14,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349632552] [2022-12-13 10:30:14,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349632552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:14,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:14,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:30:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129187961] [2022-12-13 10:30:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:14,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:30:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:14,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:30:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:30:14,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:30:14,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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:30:14,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:14,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:30:14,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:14,145 INFO L130 PetriNetUnfolder]: 151/226 cut-off events. [2022-12-13 10:30:14,146 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 10:30:14,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 226 events. 151/226 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 542 event pairs, 11 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 188. Up to 185 conditions per place. [2022-12-13 10:30:14,147 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-13 10:30:14,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 149 flow [2022-12-13 10:30:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:30:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:30:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 10:30:14,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 10:30:14,148 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 56 flow. Second operand 3 states and 30 transitions. [2022-12-13 10:30:14,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 149 flow [2022-12-13 10:30:14,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:30:14,149 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 66 flow [2022-12-13 10:30:14,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-13 10:30:14,150 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-12-13 10:30:14,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:14,150 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 66 flow [2022-12-13 10:30:14,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:14,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:14,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 66 flow [2022-12-13 10:30:14,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 66 flow [2022-12-13 10:30:14,153 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-13 10:30:14,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:30:14,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2022-12-13 10:30:14,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 66 flow [2022-12-13 10:30:14,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 10:30:14,154 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:14,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 10:30:14,155 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 66 flow [2022-12-13 10:30:14,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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:30:14,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:14,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:14,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:30:14,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash -506728048, now seen corresponding path program 1 times [2022-12-13 10:30:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:14,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347197012] [2022-12-13 10:30:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:14,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347197012] [2022-12-13 10:30:14,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347197012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:14,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:14,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:30:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812034053] [2022-12-13 10:30:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:14,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:30:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:30:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:30:14,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:30:14,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 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:30:14,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:14,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:30:14,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:14,345 INFO L130 PetriNetUnfolder]: 220/325 cut-off events. [2022-12-13 10:30:14,345 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-13 10:30:14,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 325 events. 220/325 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 877 event pairs, 28 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 586. Up to 243 conditions per place. [2022-12-13 10:30:14,349 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 31 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 10:30:14,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 33 transitions, 171 flow [2022-12-13 10:30:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:30:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:30:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 10:30:14,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 10:30:14,351 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-13 10:30:14,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 33 transitions, 171 flow [2022-12-13 10:30:14,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:30:14,352 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 76 flow [2022-12-13 10:30:14,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2022-12-13 10:30:14,353 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-13 10:30:14,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:14,353 INFO L89 Accepts]: Start accepts. Operand has 27 places, 22 transitions, 76 flow [2022-12-13 10:30:14,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:14,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:14,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 76 flow [2022-12-13 10:30:14,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 76 flow [2022-12-13 10:30:14,359 INFO L130 PetriNetUnfolder]: 3/22 cut-off events. [2022-12-13 10:30:14,359 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:30:14,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 26. Up to 4 conditions per place. [2022-12-13 10:30:14,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 76 flow [2022-12-13 10:30:14,360 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 10:30:14,361 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:14,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 10:30:14,365 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 76 flow [2022-12-13 10:30:14,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 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:30:14,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:14,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:14,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:30:14,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1812541563, now seen corresponding path program 1 times [2022-12-13 10:30:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:14,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963849695] [2022-12-13 10:30:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963849695] [2022-12-13 10:30:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963849695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373870346] [2022-12-13 10:30:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:14,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:14,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:14,649 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:30:14,654 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:30:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:14,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 10:30:14,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:30:14,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:30:15,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373870346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:15,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:15,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2022-12-13 10:30:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369317858] [2022-12-13 10:30:15,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:15,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:15,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:15,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 10:30:15,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 76 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:30:15,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:15,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 10:30:15,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:15,284 INFO L130 PetriNetUnfolder]: 319/470 cut-off events. [2022-12-13 10:30:15,284 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-12-13 10:30:15,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 470 events. 319/470 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1386 event pairs, 12 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 500. Up to 145 conditions per place. [2022-12-13 10:30:15,286 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 67 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2022-12-13 10:30:15,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 78 transitions, 418 flow [2022-12-13 10:30:15,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-13 10:30:15,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-13 10:30:15,294 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 76 flow. Second operand 8 states and 70 transitions. [2022-12-13 10:30:15,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 78 transitions, 418 flow [2022-12-13 10:30:15,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 78 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:30:15,296 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 149 flow [2022-12-13 10:30:15,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 10:30:15,296 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-13 10:30:15,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:15,297 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 149 flow [2022-12-13 10:30:15,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:15,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:15,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 149 flow [2022-12-13 10:30:15,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 149 flow [2022-12-13 10:30:15,301 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2022-12-13 10:30:15,301 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-13 10:30:15,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 36 events. 10/36 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2022-12-13 10:30:15,302 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 149 flow [2022-12-13 10:30:15,302 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 10:30:15,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:15,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] [2022-12-13 10:30:15,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:15,937 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:30:15,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 642 [2022-12-13 10:30:15,938 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 148 flow [2022-12-13 10:30:15,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:30:15,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:15,939 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:15,944 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:30:16,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:16,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:16,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2102831478, now seen corresponding path program 2 times [2022-12-13 10:30:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:16,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711842012] [2022-12-13 10:30:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:16,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:16,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711842012] [2022-12-13 10:30:16,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711842012] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:16,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84300973] [2022-12-13 10:30:16,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:30:16,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:16,314 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:30:16,315 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:30:16,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:30:16,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:30:16,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 10:30:16,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:16,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:16,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84300973] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:16,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:16,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-13 10:30:16,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590693695] [2022-12-13 10:30:16,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:16,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:30:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:30:16,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:30:16,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 10:30:16,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:16,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:16,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 10:30:16,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:16,642 INFO L130 PetriNetUnfolder]: 375/544 cut-off events. [2022-12-13 10:30:16,642 INFO L131 PetriNetUnfolder]: For 747/747 co-relation queries the response was YES. [2022-12-13 10:30:16,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 544 events. 375/544 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1553 event pairs, 67 based on Foata normal form. 34/490 useless extension candidates. Maximal degree in co-relation 780. Up to 177 conditions per place. [2022-12-13 10:30:16,645 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 56 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2022-12-13 10:30:16,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 64 transitions, 429 flow [2022-12-13 10:30:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:30:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:30:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-13 10:30:16,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 10:30:16,646 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 148 flow. Second operand 5 states and 55 transitions. [2022-12-13 10:30:16,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 64 transitions, 429 flow [2022-12-13 10:30:16,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 373 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-13 10:30:16,649 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 149 flow [2022-12-13 10:30:16,649 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 10:30:16,649 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-13 10:30:16,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:16,649 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 149 flow [2022-12-13 10:30:16,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:16,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:16,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 149 flow [2022-12-13 10:30:16,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 149 flow [2022-12-13 10:30:16,654 INFO L130 PetriNetUnfolder]: 10/38 cut-off events. [2022-12-13 10:30:16,654 INFO L131 PetriNetUnfolder]: For 17/19 co-relation queries the response was YES. [2022-12-13 10:30:16,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 38 events. 10/38 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 83. Up to 12 conditions per place. [2022-12-13 10:30:16,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 149 flow [2022-12-13 10:30:16,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 10:30:17,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:17,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 644 [2022-12-13 10:30:17,293 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 150 flow [2022-12-13 10:30:17,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:17,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:17,294 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:17,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 10:30:17,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:17,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1237485146, now seen corresponding path program 1 times [2022-12-13 10:30:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:17,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468163452] [2022-12-13 10:30:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:17,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468163452] [2022-12-13 10:30:17,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468163452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:17,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281843286] [2022-12-13 10:30:17,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:17,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:17,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:17,713 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:30:17,715 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:30:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:17,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 10:30:17,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 10:30:17,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:30:17,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281843286] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:17,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 8 [2022-12-13 10:30:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791207019] [2022-12-13 10:30:17,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:17,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:17,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:17,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 10:30:17,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 150 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:17,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:17,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 10:30:17,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:18,129 INFO L130 PetriNetUnfolder]: 475/686 cut-off events. [2022-12-13 10:30:18,129 INFO L131 PetriNetUnfolder]: For 896/896 co-relation queries the response was YES. [2022-12-13 10:30:18,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 686 events. 475/686 cut-off events. For 896/896 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2143 event pairs, 43 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 763. Up to 343 conditions per place. [2022-12-13 10:30:18,133 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 76 selfloop transitions, 23 changer transitions 0/99 dead transitions. [2022-12-13 10:30:18,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 99 transitions, 686 flow [2022-12-13 10:30:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-12-13 10:30:18,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-13 10:30:18,135 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 150 flow. Second operand 9 states and 81 transitions. [2022-12-13 10:30:18,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 99 transitions, 686 flow [2022-12-13 10:30:18,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 99 transitions, 661 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 10:30:18,137 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 357 flow [2022-12-13 10:30:18,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=357, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2022-12-13 10:30:18,138 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2022-12-13 10:30:18,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:18,138 INFO L89 Accepts]: Start accepts. Operand has 47 places, 47 transitions, 357 flow [2022-12-13 10:30:18,139 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:18,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:18,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 47 transitions, 357 flow [2022-12-13 10:30:18,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 357 flow [2022-12-13 10:30:18,149 INFO L130 PetriNetUnfolder]: 44/105 cut-off events. [2022-12-13 10:30:18,149 INFO L131 PetriNetUnfolder]: For 305/314 co-relation queries the response was YES. [2022-12-13 10:30:18,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 105 events. 44/105 cut-off events. For 305/314 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 329 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 344. Up to 36 conditions per place. [2022-12-13 10:30:18,150 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 47 transitions, 357 flow [2022-12-13 10:30:18,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 10:30:19,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L97-1-->L75-1: Formula: (and (= (mod v_~g3~0_62 256) 0) (= |v_thread3Thread1of1ForFork2_#res.base_19| 0) (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0) (let ((.cse0 (= (mod v_~d2~0_98 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_97)) (.cse2 (not (= (mod v_~g2~0_65 256) 0)))) (or (and .cse0 (= v_~pos~0_203 (+ v_~pos~0_202 2)) .cse1 .cse2) (and (= v_~pos~0_202 (+ v_~pos~0_203 2)) (not .cse0) .cse1 .cse2)))) (let ((.cse3 (= v_~g2~0_65 v_~g2~0_64)) (.cse5 (= (mod v_~d2~0_97 256) 0)) (.cse4 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_46| 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) (and (not .cse5) (not .cse4) (= v_~g2~0_64 0))))) InVars {~g2~0=v_~g2~0_65, ~g3~0=v_~g3~0_62, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_46|, ~pos~0=v_~pos~0_203, ~d2~0=v_~d2~0_98} OutVars{~g2~0=v_~g2~0_64, ~g3~0=v_~g3~0_62, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, ~pos~0=v_~pos~0_202, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~d2~0=v_~d2~0_97} AuxVars[] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#res.offset, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, thread3Thread1of1ForFork2_#res.base, ~d2~0] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:20,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L97-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_62 256) 0) (= |v_thread3Thread1of1ForFork2_#res.base_17| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= (mod v_~g3~0_60 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_17| 0)) InVars {~g2~0=v_~g2~0_62, ~g3~0=v_~g3~0_60} OutVars{~g2~0=v_~g2~0_62, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, ~g3~0=v_~g3~0_60, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_17|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:23,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L97-1-->L75-1: Formula: (and (= (mod v_~g3~0_62 256) 0) (= |v_thread3Thread1of1ForFork2_#res.base_19| 0) (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0) (let ((.cse0 (= (mod v_~d2~0_98 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_97)) (.cse2 (not (= (mod v_~g2~0_65 256) 0)))) (or (and .cse0 (= v_~pos~0_203 (+ v_~pos~0_202 2)) .cse1 .cse2) (and (= v_~pos~0_202 (+ v_~pos~0_203 2)) (not .cse0) .cse1 .cse2)))) (let ((.cse3 (= v_~g2~0_65 v_~g2~0_64)) (.cse5 (= (mod v_~d2~0_97 256) 0)) (.cse4 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_46| 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) (and (not .cse5) (not .cse4) (= v_~g2~0_64 0))))) InVars {~g2~0=v_~g2~0_65, ~g3~0=v_~g3~0_62, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_46|, ~pos~0=v_~pos~0_203, ~d2~0=v_~d2~0_98} OutVars{~g2~0=v_~g2~0_64, ~g3~0=v_~g3~0_62, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, ~pos~0=v_~pos~0_202, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~d2~0=v_~d2~0_97} AuxVars[] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#res.offset, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, thread3Thread1of1ForFork2_#res.base, ~d2~0] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:23,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L97-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_62 256) 0) (= |v_thread3Thread1of1ForFork2_#res.base_17| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= (mod v_~g3~0_60 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_17| 0)) InVars {~g2~0=v_~g2~0_62, ~g3~0=v_~g3~0_60} OutVars{~g2~0=v_~g2~0_62, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, ~g3~0=v_~g3~0_60, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_17|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:24,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:30:25,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [491] L97-1-->L97-1: Formula: (let ((.cse3 (= (mod v_~d3~0_168 256) 0)) (.cse8 (+ v_~pos~0_324 2)) (.cse2 (= (mod v_~d3~0_167 256) 0))) (and (let ((.cse0 (= (ite (= 0 (ite .cse3 1 0)) 0 1) v_~d3~0_167)) (.cse1 (= v_~g3~0_154 v_~g3~0_153))) (or (and .cse0 .cse1 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_128| 256) 0)) (and .cse0 .cse1 .cse2))) (let ((.cse4 (= (mod v_~d3~0_166 256) 0)) (.cse7 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_127| 256))) (.cse5 (= v_~d3~0_166 (ite (= (ite .cse2 1 0) 0) 0 1))) (.cse6 (= v_~g3~0_153 v_~g3~0_152))) (or (and .cse4 .cse5 .cse6) (and (= v_~g3~0_152 0) .cse5 (not .cse4) (not .cse7)) (and .cse7 .cse5 .cse6))) (or (and (not .cse3) (not (= (mod v_~g3~0_154 256) 0)) (= v_~pos~0_324 (+ v_~pos~0_325 2))) (and (= v_~pos~0_325 .cse8) .cse3)) (or (and (not .cse2) (not (= (mod v_~g3~0_153 256) 0)) (= v_~pos~0_323 .cse8)) (and (= v_~pos~0_324 (+ v_~pos~0_323 2)) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_128|, ~g3~0=v_~g3~0_154, ~pos~0=v_~pos~0_325, ~d3~0=v_~d3~0_168} OutVars{~g3~0=v_~g3~0_152, ~pos~0=v_~pos~0_323, ~d3~0=v_~d3~0_166} AuxVars[v_~pos~0_324, |v_thread3Thread1of1ForFork2_#t~nondet5_127|, v_~d3~0_167, v_~g3~0_153] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:30:26,295 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:30:26,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8158 [2022-12-13 10:30:26,296 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 384 flow [2022-12-13 10:30:26,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:26,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:26,297 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:26,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 10:30:26,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:26,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1040516970, now seen corresponding path program 1 times [2022-12-13 10:30:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:26,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412797627] [2022-12-13 10:30:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:27,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:27,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412797627] [2022-12-13 10:30:27,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412797627] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:27,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898516839] [2022-12-13 10:30:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:27,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:27,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:27,125 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:30:27,127 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:30:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:27,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:30:27,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:27,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:27,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898516839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:27,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:27,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 15 [2022-12-13 10:30:27,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998372549] [2022-12-13 10:30:27,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:30:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:30:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:30:27,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 10:30:27,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 384 flow. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:30:27,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:27,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 10:30:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:29,055 INFO L130 PetriNetUnfolder]: 1304/1830 cut-off events. [2022-12-13 10:30:29,055 INFO L131 PetriNetUnfolder]: For 4882/4882 co-relation queries the response was YES. [2022-12-13 10:30:29,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8000 conditions, 1830 events. 1304/1830 cut-off events. For 4882/4882 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6934 event pairs, 14 based on Foata normal form. 3/1641 useless extension candidates. Maximal degree in co-relation 4203. Up to 569 conditions per place. [2022-12-13 10:30:29,070 INFO L137 encePairwiseOnDemand]: 12/33 looper letters, 159 selfloop transitions, 166 changer transitions 8/333 dead transitions. [2022-12-13 10:30:29,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 333 transitions, 2964 flow [2022-12-13 10:30:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 10:30:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 10:30:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 285 transitions. [2022-12-13 10:30:29,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3321678321678322 [2022-12-13 10:30:29,075 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 384 flow. Second operand 26 states and 285 transitions. [2022-12-13 10:30:29,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 333 transitions, 2964 flow [2022-12-13 10:30:29,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 333 transitions, 2678 flow, removed 128 selfloop flow, removed 3 redundant places. [2022-12-13 10:30:29,100 INFO L231 Difference]: Finished difference. Result has 70 places, 218 transitions, 2113 flow [2022-12-13 10:30:29,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2113, PETRI_PLACES=70, PETRI_TRANSITIONS=218} [2022-12-13 10:30:29,101 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 44 predicate places. [2022-12-13 10:30:29,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:29,101 INFO L89 Accepts]: Start accepts. Operand has 70 places, 218 transitions, 2113 flow [2022-12-13 10:30:29,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:29,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:29,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 218 transitions, 2113 flow [2022-12-13 10:30:29,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 218 transitions, 2113 flow [2022-12-13 10:30:29,159 INFO L130 PetriNetUnfolder]: 300/521 cut-off events. [2022-12-13 10:30:29,160 INFO L131 PetriNetUnfolder]: For 1379/1416 co-relation queries the response was YES. [2022-12-13 10:30:29,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 521 events. 300/521 cut-off events. For 1379/1416 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2209 event pairs, 0 based on Foata normal form. 7/509 useless extension candidates. Maximal degree in co-relation 2028. Up to 183 conditions per place. [2022-12-13 10:30:29,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 218 transitions, 2113 flow [2022-12-13 10:30:29,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 978 [2022-12-13 10:30:29,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [503] L53-1-->L53-1: Formula: (let ((.cse3 (= (mod v_~d1~0_194 256) 0)) (.cse2 (= (mod v_~d1~0_193 256) 0)) (.cse8 (+ v_~pos~0_448 1))) (and (let ((.cse0 (= v_~g1~0_178 v_~g1~0_177)) (.cse1 (= v_~d1~0_193 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_151| 256) 0) .cse0 .cse1) (and .cse2 .cse0 .cse1))) (let ((.cse6 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_150| 256) 0)) (.cse4 (= (ite (= (ite .cse2 1 0) 0) 0 1) v_~d1~0_192)) (.cse5 (= v_~g1~0_177 v_~g1~0_176)) (.cse7 (= (mod v_~d1~0_192 256) 0))) (or (and .cse4 .cse5 .cse6) (and .cse4 (= v_~g1~0_176 0) (not .cse6) (not .cse7)) (and .cse4 .cse5 .cse7))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_143| |v_thread1Thread1of1ForFork0_#t~post2_142|) (= v_~pos~0_448 (+ v_~pos~0_449 1)) (not (= (mod v_~g1~0_178 256) 0)) (not .cse3)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_143| |v_thread1Thread1of1ForFork0_#t~post1_142|) (= v_~pos~0_449 .cse8) .cse3)) (or (and .cse2 (= v_~pos~0_448 (+ v_~pos~0_447 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_142| |v_thread1Thread1of1ForFork0_#t~post1_141|)) (and (not .cse2) (= v_~pos~0_447 .cse8) (= |v_thread1Thread1of1ForFork0_#t~post2_142| |v_thread1Thread1of1ForFork0_#t~post2_141|) (not (= (mod v_~g1~0_177 256) 0)))))) InVars {~g1~0=v_~g1~0_178, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_151|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_143|, ~pos~0=v_~pos~0_449, ~d1~0=v_~d1~0_194} OutVars{~g1~0=v_~g1~0_176, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_141|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_141|, ~pos~0=v_~pos~0_447, ~d1~0=v_~d1~0_192} AuxVars[|v_thread1Thread1of1ForFork0_#t~post1_142|, |v_thread1Thread1of1ForFork0_#t~post2_142|, v_~g1~0_177, v_~pos~0_448, v_~d1~0_193, |v_thread1Thread1of1ForFork0_#t~nondet3_150|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:29,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:30,247 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:30,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:30:31,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [495] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_180 256) 0)) (.cse1 (+ v_~pos~0_336 2)) (.cse6 (= (mod v_~d3~0_179 256) 0))) (and (or (and (not .cse0) (= v_~pos~0_336 (+ v_~pos~0_337 2))) (and .cse0 (= v_~pos~0_337 .cse1))) (let ((.cse4 (= (mod v_~d3~0_178 256) 0)) (.cse2 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d3~0_178)) (.cse3 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_139| 256) 0)) (.cse5 (= v_~g3~0_165 v_~g3~0_164))) (or (and .cse2 (not .cse3) (= v_~g3~0_164 0) (not .cse4)) (and .cse2 .cse5 .cse4) (and .cse2 .cse3 .cse5))) (let ((.cse7 (= v_~g3~0_166 v_~g3~0_165)) (.cse8 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_179))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_140| 256) 0) .cse7 .cse8) (and .cse7 .cse6 .cse8))) (let ((.cse9 (not (= (mod v_~g3~0_165 256) 0)))) (or (and (= v_~pos~0_335 .cse1) (not .cse6) .cse9) (and .cse9 (= v_~pos~0_336 (+ v_~pos~0_335 2)) .cse6))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_140|, ~g3~0=v_~g3~0_166, ~pos~0=v_~pos~0_337, ~d3~0=v_~d3~0_180} OutVars{~g3~0=v_~g3~0_164, ~pos~0=v_~pos~0_335, ~d3~0=v_~d3~0_178} AuxVars[v_~d3~0_179, |v_thread3Thread1of1ForFork2_#t~nondet5_139|, v_~g3~0_165, v_~pos~0_336] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:30:32,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:33,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:33,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:37,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L53-1-->L53-1: Formula: (let ((.cse1 (+ v_~pos~0_501 1)) (.cse0 (= (mod v_~d1~0_232 256) 0)) (.cse6 (= (mod v_~d1~0_233 256) 0))) (and (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_178| |v_thread1Thread1of1ForFork0_#t~post2_177|) (not .cse0) (= v_~pos~0_500 .cse1) (not (= (mod v_~g1~0_216 256) 0))) (and (= |v_thread1Thread1of1ForFork0_#t~post1_178| |v_thread1Thread1of1ForFork0_#t~post1_177|) (= v_~pos~0_501 (+ v_~pos~0_500 1)) .cse0)) (let ((.cse3 (= v_~g1~0_216 v_~g1~0_215)) (.cse5 (= (mod v_~d1~0_231 256) 0)) (.cse4 (= v_~d1~0_231 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_186| 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (not .cse5) (= v_~g1~0_215 0) .cse4 (not .cse2)))) (or (and (not .cse6) (= v_~pos~0_501 (+ v_~pos~0_502 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_179| |v_thread1Thread1of1ForFork0_#t~post2_178|) (not (= (mod v_~g1~0_217 256) 0))) (and (= v_~pos~0_502 .cse1) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_179| |v_thread1Thread1of1ForFork0_#t~post1_178|))) (let ((.cse7 (= v_~g1~0_217 v_~g1~0_216)) (.cse8 (= v_~d1~0_232 (ite (= (ite .cse6 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_187| 256) 0) .cse7 .cse8) (and .cse7 .cse8 .cse0))))) InVars {~g1~0=v_~g1~0_217, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_187|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_179|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_179|, ~pos~0=v_~pos~0_502, ~d1~0=v_~d1~0_233} OutVars{~g1~0=v_~g1~0_215, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_177|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_177|, ~pos~0=v_~pos~0_500, ~d1~0=v_~d1~0_231} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_186|, v_~g1~0_216, |v_thread1Thread1of1ForFork0_#t~post1_178|, |v_thread1Thread1of1ForFork0_#t~post2_178|, v_~d1~0_232, v_~pos~0_501] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:40,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L53-1-->L53-1: Formula: (let ((.cse1 (+ v_~pos~0_501 1)) (.cse0 (= (mod v_~d1~0_232 256) 0)) (.cse6 (= (mod v_~d1~0_233 256) 0))) (and (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_178| |v_thread1Thread1of1ForFork0_#t~post2_177|) (not .cse0) (= v_~pos~0_500 .cse1) (not (= (mod v_~g1~0_216 256) 0))) (and (= |v_thread1Thread1of1ForFork0_#t~post1_178| |v_thread1Thread1of1ForFork0_#t~post1_177|) (= v_~pos~0_501 (+ v_~pos~0_500 1)) .cse0)) (let ((.cse3 (= v_~g1~0_216 v_~g1~0_215)) (.cse5 (= (mod v_~d1~0_231 256) 0)) (.cse4 (= v_~d1~0_231 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_186| 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (not .cse5) (= v_~g1~0_215 0) .cse4 (not .cse2)))) (or (and (not .cse6) (= v_~pos~0_501 (+ v_~pos~0_502 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_179| |v_thread1Thread1of1ForFork0_#t~post2_178|) (not (= (mod v_~g1~0_217 256) 0))) (and (= v_~pos~0_502 .cse1) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_179| |v_thread1Thread1of1ForFork0_#t~post1_178|))) (let ((.cse7 (= v_~g1~0_217 v_~g1~0_216)) (.cse8 (= v_~d1~0_232 (ite (= (ite .cse6 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_187| 256) 0) .cse7 .cse8) (and .cse7 .cse8 .cse0))))) InVars {~g1~0=v_~g1~0_217, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_187|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_179|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_179|, ~pos~0=v_~pos~0_502, ~d1~0=v_~d1~0_233} OutVars{~g1~0=v_~g1~0_215, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_177|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_177|, ~pos~0=v_~pos~0_500, ~d1~0=v_~d1~0_231} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_186|, v_~g1~0_216, |v_thread1Thread1of1ForFork0_#t~post1_178|, |v_thread1Thread1of1ForFork0_#t~post2_178|, v_~d1~0_232, v_~pos~0_501] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:30:41,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L53-1-->L53-1: Formula: (let ((.cse1 (+ v_~pos~0_501 1)) (.cse0 (= (mod v_~d1~0_232 256) 0)) (.cse6 (= (mod v_~d1~0_233 256) 0))) (and (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_178| |v_thread1Thread1of1ForFork0_#t~post2_177|) (not .cse0) (= v_~pos~0_500 .cse1) (not (= (mod v_~g1~0_216 256) 0))) (and (= |v_thread1Thread1of1ForFork0_#t~post1_178| |v_thread1Thread1of1ForFork0_#t~post1_177|) (= v_~pos~0_501 (+ v_~pos~0_500 1)) .cse0)) (let ((.cse3 (= v_~g1~0_216 v_~g1~0_215)) (.cse5 (= (mod v_~d1~0_231 256) 0)) (.cse4 (= v_~d1~0_231 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_186| 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (not .cse5) (= v_~g1~0_215 0) .cse4 (not .cse2)))) (or (and (not .cse6) (= v_~pos~0_501 (+ v_~pos~0_502 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_179| |v_thread1Thread1of1ForFork0_#t~post2_178|) (not (= (mod v_~g1~0_217 256) 0))) (and (= v_~pos~0_502 .cse1) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_179| |v_thread1Thread1of1ForFork0_#t~post1_178|))) (let ((.cse7 (= v_~g1~0_217 v_~g1~0_216)) (.cse8 (= v_~d1~0_232 (ite (= (ite .cse6 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_187| 256) 0) .cse7 .cse8) (and .cse7 .cse8 .cse0))))) InVars {~g1~0=v_~g1~0_217, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_187|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_179|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_179|, ~pos~0=v_~pos~0_502, ~d1~0=v_~d1~0_233} OutVars{~g1~0=v_~g1~0_215, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_177|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_177|, ~pos~0=v_~pos~0_500, ~d1~0=v_~d1~0_231} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_186|, v_~g1~0_216, |v_thread1Thread1of1ForFork0_#t~post1_178|, |v_thread1Thread1of1ForFork0_#t~post2_178|, v_~d1~0_232, v_~pos~0_501] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:42,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] L53-1-->L53-1: Formula: (let ((.cse1 (+ v_~pos~0_501 1)) (.cse0 (= (mod v_~d1~0_232 256) 0)) (.cse6 (= (mod v_~d1~0_233 256) 0))) (and (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_178| |v_thread1Thread1of1ForFork0_#t~post2_177|) (not .cse0) (= v_~pos~0_500 .cse1) (not (= (mod v_~g1~0_216 256) 0))) (and (= |v_thread1Thread1of1ForFork0_#t~post1_178| |v_thread1Thread1of1ForFork0_#t~post1_177|) (= v_~pos~0_501 (+ v_~pos~0_500 1)) .cse0)) (let ((.cse3 (= v_~g1~0_216 v_~g1~0_215)) (.cse5 (= (mod v_~d1~0_231 256) 0)) (.cse4 (= v_~d1~0_231 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_186| 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (not .cse5) (= v_~g1~0_215 0) .cse4 (not .cse2)))) (or (and (not .cse6) (= v_~pos~0_501 (+ v_~pos~0_502 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_179| |v_thread1Thread1of1ForFork0_#t~post2_178|) (not (= (mod v_~g1~0_217 256) 0))) (and (= v_~pos~0_502 .cse1) .cse6 (= |v_thread1Thread1of1ForFork0_#t~post1_179| |v_thread1Thread1of1ForFork0_#t~post1_178|))) (let ((.cse7 (= v_~g1~0_217 v_~g1~0_216)) (.cse8 (= v_~d1~0_232 (ite (= (ite .cse6 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_187| 256) 0) .cse7 .cse8) (and .cse7 .cse8 .cse0))))) InVars {~g1~0=v_~g1~0_217, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_187|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_179|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_179|, ~pos~0=v_~pos~0_502, ~d1~0=v_~d1~0_233} OutVars{~g1~0=v_~g1~0_215, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_177|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_177|, ~pos~0=v_~pos~0_500, ~d1~0=v_~d1~0_231} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet3_186|, v_~g1~0_216, |v_thread1Thread1of1ForFork0_#t~post1_178|, |v_thread1Thread1of1ForFork0_#t~post2_178|, v_~d1~0_232, v_~pos~0_501] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [495] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_180 256) 0)) (.cse1 (+ v_~pos~0_336 2)) (.cse6 (= (mod v_~d3~0_179 256) 0))) (and (or (and (not .cse0) (= v_~pos~0_336 (+ v_~pos~0_337 2))) (and .cse0 (= v_~pos~0_337 .cse1))) (let ((.cse4 (= (mod v_~d3~0_178 256) 0)) (.cse2 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d3~0_178)) (.cse3 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_139| 256) 0)) (.cse5 (= v_~g3~0_165 v_~g3~0_164))) (or (and .cse2 (not .cse3) (= v_~g3~0_164 0) (not .cse4)) (and .cse2 .cse5 .cse4) (and .cse2 .cse3 .cse5))) (let ((.cse7 (= v_~g3~0_166 v_~g3~0_165)) (.cse8 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_179))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_140| 256) 0) .cse7 .cse8) (and .cse7 .cse6 .cse8))) (let ((.cse9 (not (= (mod v_~g3~0_165 256) 0)))) (or (and (= v_~pos~0_335 .cse1) (not .cse6) .cse9) (and .cse9 (= v_~pos~0_336 (+ v_~pos~0_335 2)) .cse6))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_140|, ~g3~0=v_~g3~0_166, ~pos~0=v_~pos~0_337, ~d3~0=v_~d3~0_180} OutVars{~g3~0=v_~g3~0_164, ~pos~0=v_~pos~0_335, ~d3~0=v_~d3~0_178} AuxVars[v_~d3~0_179, |v_thread3Thread1of1ForFork2_#t~nondet5_139|, v_~g3~0_165, v_~pos~0_336] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:30:47,381 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:30:47,382 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18281 [2022-12-13 10:30:47,382 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 216 transitions, 2175 flow [2022-12-13 10:30:47,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:30:47,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:47,382 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:47,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 10:30:47,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:47,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:47,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1073138286, now seen corresponding path program 1 times [2022-12-13 10:30:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:47,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291798183] [2022-12-13 10:30:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:48,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:48,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291798183] [2022-12-13 10:30:48,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291798183] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:48,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127881304] [2022-12-13 10:30:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:48,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:48,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:48,204 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:30:48,206 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:30:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:48,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:30:48,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:48,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:48,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:48,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127881304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:48,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:48,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 15 [2022-12-13 10:30:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697188592] [2022-12-13 10:30:48,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:48,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:30:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:30:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:30:48,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:30:48,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 216 transitions, 2175 flow. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:48,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:48,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:30:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:50,807 INFO L130 PetriNetUnfolder]: 3517/5054 cut-off events. [2022-12-13 10:30:50,807 INFO L131 PetriNetUnfolder]: For 13941/13941 co-relation queries the response was YES. [2022-12-13 10:30:50,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23620 conditions, 5054 events. 3517/5054 cut-off events. For 13941/13941 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 24206 event pairs, 28 based on Foata normal form. 31/4917 useless extension candidates. Maximal degree in co-relation 22909. Up to 1637 conditions per place. [2022-12-13 10:30:50,841 INFO L137 encePairwiseOnDemand]: 12/48 looper letters, 294 selfloop transitions, 436 changer transitions 24/754 dead transitions. [2022-12-13 10:30:50,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 754 transitions, 7753 flow [2022-12-13 10:30:50,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 10:30:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 10:30:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 410 transitions. [2022-12-13 10:30:50,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29454022988505746 [2022-12-13 10:30:50,844 INFO L175 Difference]: Start difference. First operand has 68 places, 216 transitions, 2175 flow. Second operand 29 states and 410 transitions. [2022-12-13 10:30:50,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 754 transitions, 7753 flow [2022-12-13 10:30:50,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 754 transitions, 7369 flow, removed 183 selfloop flow, removed 1 redundant places. [2022-12-13 10:30:50,902 INFO L231 Difference]: Finished difference. Result has 108 places, 535 transitions, 6313 flow [2022-12-13 10:30:50,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=6313, PETRI_PLACES=108, PETRI_TRANSITIONS=535} [2022-12-13 10:30:50,903 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 82 predicate places. [2022-12-13 10:30:50,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:50,903 INFO L89 Accepts]: Start accepts. Operand has 108 places, 535 transitions, 6313 flow [2022-12-13 10:30:50,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:50,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:50,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 535 transitions, 6313 flow [2022-12-13 10:30:50,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 535 transitions, 6313 flow [2022-12-13 10:30:51,058 INFO L130 PetriNetUnfolder]: 702/1321 cut-off events. [2022-12-13 10:30:51,058 INFO L131 PetriNetUnfolder]: For 4877/5176 co-relation queries the response was YES. [2022-12-13 10:30:51,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6347 conditions, 1321 events. 702/1321 cut-off events. For 4877/5176 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7609 event pairs, 3 based on Foata normal form. 13/1270 useless extension candidates. Maximal degree in co-relation 6077. Up to 339 conditions per place. [2022-12-13 10:30:51,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 535 transitions, 6313 flow [2022-12-13 10:30:51,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 2668 [2022-12-13 10:30:51,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:51,356 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [503] L53-1-->L53-1: Formula: (let ((.cse3 (= (mod v_~d1~0_194 256) 0)) (.cse2 (= (mod v_~d1~0_193 256) 0)) (.cse8 (+ v_~pos~0_448 1))) (and (let ((.cse0 (= v_~g1~0_178 v_~g1~0_177)) (.cse1 (= v_~d1~0_193 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_151| 256) 0) .cse0 .cse1) (and .cse2 .cse0 .cse1))) (let ((.cse6 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_150| 256) 0)) (.cse4 (= (ite (= (ite .cse2 1 0) 0) 0 1) v_~d1~0_192)) (.cse5 (= v_~g1~0_177 v_~g1~0_176)) (.cse7 (= (mod v_~d1~0_192 256) 0))) (or (and .cse4 .cse5 .cse6) (and .cse4 (= v_~g1~0_176 0) (not .cse6) (not .cse7)) (and .cse4 .cse5 .cse7))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_143| |v_thread1Thread1of1ForFork0_#t~post2_142|) (= v_~pos~0_448 (+ v_~pos~0_449 1)) (not (= (mod v_~g1~0_178 256) 0)) (not .cse3)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_143| |v_thread1Thread1of1ForFork0_#t~post1_142|) (= v_~pos~0_449 .cse8) .cse3)) (or (and .cse2 (= v_~pos~0_448 (+ v_~pos~0_447 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_142| |v_thread1Thread1of1ForFork0_#t~post1_141|)) (and (not .cse2) (= v_~pos~0_447 .cse8) (= |v_thread1Thread1of1ForFork0_#t~post2_142| |v_thread1Thread1of1ForFork0_#t~post2_141|) (not (= (mod v_~g1~0_177 256) 0)))))) InVars {~g1~0=v_~g1~0_178, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_151|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_143|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_143|, ~pos~0=v_~pos~0_449, ~d1~0=v_~d1~0_194} OutVars{~g1~0=v_~g1~0_176, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_141|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_141|, ~pos~0=v_~pos~0_447, ~d1~0=v_~d1~0_192} AuxVars[|v_thread1Thread1of1ForFork0_#t~post1_142|, |v_thread1Thread1of1ForFork0_#t~post2_142|, v_~g1~0_177, v_~pos~0_448, v_~d1~0_193, |v_thread1Thread1of1ForFork0_#t~nondet3_150|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:51,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:51,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1032 [2022-12-13 10:30:51,935 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 535 transitions, 6333 flow [2022-12-13 10:30:51,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:51,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:51,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:30:51,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 10:30:52,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:52,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:30:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1377466942, now seen corresponding path program 1 times [2022-12-13 10:30:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:52,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003873338] [2022-12-13 10:30:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:52,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:52,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003873338] [2022-12-13 10:30:52,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003873338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:52,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513809618] [2022-12-13 10:30:52,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:52,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:52,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:52,609 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:30:52,610 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:30:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:52,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 10:30:52,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:52,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:30:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:53,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513809618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:30:53,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:30:53,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:30:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833852875] [2022-12-13 10:30:53,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:30:53,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:30:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:53,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:30:53,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:30:53,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:30:53,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 535 transitions, 6333 flow. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:30:53,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:53,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:30:53,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:55,418 INFO L130 PetriNetUnfolder]: 5838/8528 cut-off events. [2022-12-13 10:30:55,418 INFO L131 PetriNetUnfolder]: For 39925/39925 co-relation queries the response was YES. [2022-12-13 10:30:55,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46760 conditions, 8528 events. 5838/8528 cut-off events. For 39925/39925 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 45767 event pairs, 297 based on Foata normal form. 95/8333 useless extension candidates. Maximal degree in co-relation 45598. Up to 3714 conditions per place. [2022-12-13 10:30:55,489 INFO L137 encePairwiseOnDemand]: 17/49 looper letters, 440 selfloop transitions, 737 changer transitions 52/1229 dead transitions. [2022-12-13 10:30:55,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 1229 transitions, 15813 flow [2022-12-13 10:30:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 10:30:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 10:30:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 342 transitions. [2022-12-13 10:30:55,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2585034013605442 [2022-12-13 10:30:55,491 INFO L175 Difference]: Start difference. First operand has 106 places, 535 transitions, 6333 flow. Second operand 27 states and 342 transitions. [2022-12-13 10:30:55,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 1229 transitions, 15813 flow [2022-12-13 10:30:55,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 1229 transitions, 15184 flow, removed 278 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:55,745 INFO L231 Difference]: Finished difference. Result has 140 places, 977 transitions, 13844 flow [2022-12-13 10:30:55,745 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5934, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=13844, PETRI_PLACES=140, PETRI_TRANSITIONS=977} [2022-12-13 10:30:55,746 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 114 predicate places. [2022-12-13 10:30:55,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:55,746 INFO L89 Accepts]: Start accepts. Operand has 140 places, 977 transitions, 13844 flow [2022-12-13 10:30:55,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:55,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:55,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 977 transitions, 13844 flow [2022-12-13 10:30:55,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 977 transitions, 13844 flow [2022-12-13 10:30:56,078 INFO L130 PetriNetUnfolder]: 1188/2376 cut-off events. [2022-12-13 10:30:56,078 INFO L131 PetriNetUnfolder]: For 13220/13440 co-relation queries the response was YES. [2022-12-13 10:30:56,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13399 conditions, 2376 events. 1188/2376 cut-off events. For 13220/13440 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16522 event pairs, 0 based on Foata normal form. 8/2295 useless extension candidates. Maximal degree in co-relation 12877. Up to 601 conditions per place. [2022-12-13 10:30:56,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 977 transitions, 13844 flow [2022-12-13 10:30:56,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 4804 [2022-12-13 10:30:56,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:30:57,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:57,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:30:57,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [541] L53-1-->L53-1: Formula: (let ((.cse3 (= (mod v_~d1~0_383 256) 0)) (.cse4 (+ v_~pos~0_743 1)) (.cse0 (= (mod v_~d1~0_382 256) 0))) (and (let ((.cse1 (= v_~g1~0_367 v_~g1~0_366)) (.cse2 (= v_~d1~0_382 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_339| 256) 0) .cse1 .cse2))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_333| |v_thread1Thread1of1ForFork0_#t~post1_332|) (= v_~pos~0_744 .cse4) .cse3) (and (not .cse3) (= |v_thread1Thread1of1ForFork0_#t~post2_333| |v_thread1Thread1of1ForFork0_#t~post2_332|) (= v_~pos~0_743 (+ v_~pos~0_744 1)) (not (= (mod v_~g1~0_367 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_332| |v_thread1Thread1of1ForFork0_#t~post1_331|) (= (+ v_~pos~0_742 1) v_~pos~0_743) .cse0) (and (= v_~pos~0_742 .cse4) (not (= (mod v_~g1~0_366 256) 0)) (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~post2_332| |v_thread1Thread1of1ForFork0_#t~post2_331|))) (let ((.cse6 (= v_~g1~0_366 v_~g1~0_365)) (.cse5 (= v_~d1~0_381 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse7 (= (mod v_~d1~0_381 256) 0)) (.cse8 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_338| 256) 0))) (or (and .cse5 .cse6 .cse7) (and .cse8 .cse5 .cse6) (and (= v_~g1~0_365 0) .cse5 (not .cse7) (not .cse8)))))) InVars {~g1~0=v_~g1~0_367, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_339|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_333|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_333|, ~pos~0=v_~pos~0_744, ~d1~0=v_~d1~0_383} OutVars{~g1~0=v_~g1~0_365, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_331|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_331|, ~pos~0=v_~pos~0_742, ~d1~0=v_~d1~0_381} AuxVars[|v_thread1Thread1of1ForFork0_#t~post1_332|, |v_thread1Thread1of1ForFork0_#t~post2_332|, |v_thread1Thread1of1ForFork0_#t~nondet3_338|, v_~g1~0_366, v_~pos~0_743, v_~d1~0_382] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:58,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [542] L53-1-->L97-1: Formula: (let ((.cse4 (= (mod v_~d1~0_388 256) 0)) (.cse8 (= (mod v_~d3~0_260 256) 0)) (.cse10 (+ v_~pos~0_750 2)) (.cse7 (= (mod v_~d3~0_261 256) 0))) (and (let ((.cse1 (= (mod v_~d1~0_387 256) 0)) (.cse0 (= v_~g1~0_371 v_~g1~0_372)) (.cse2 (= v_~d1~0_387 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_344| 256) 0))) (or (and .cse0 .cse1 .cse2) (and (not .cse1) .cse2 (= v_~g1~0_371 0) (not .cse3)) (and .cse0 .cse2 .cse3))) (let ((.cse5 (= (ite (= (ite .cse8 1 0) 0) 0 1) v_~d3~0_261)) (.cse6 (= v_~g3~0_289 v_~g3~0_288))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_215| 256) 0) .cse5 .cse6) (and .cse5 .cse7 .cse6))) (let ((.cse9 (not (= (mod v_~g1~0_372 256) 0)))) (or (and .cse9 (= |v_thread1Thread1of1ForFork0_#t~post1_338| |v_thread1Thread1of1ForFork0_#t~post1_337|) .cse4 (= v_~pos~0_751 (+ v_~pos~0_749 1))) (and (= |v_thread1Thread1of1ForFork0_#t~post2_338| |v_thread1Thread1of1ForFork0_#t~post2_337|) (= v_~pos~0_749 (+ v_~pos~0_751 1)) .cse9 (not .cse4)))) (or (and (not .cse8) (= v_~pos~0_750 (+ v_~pos~0_749 2))) (and .cse8 (= v_~pos~0_749 .cse10))) (let ((.cse11 (not (= (mod v_~g3~0_289 256) 0)))) (or (and .cse11 .cse7 (= v_~pos~0_750 (+ v_~pos~0_748 2))) (and .cse11 (= v_~pos~0_748 .cse10) (not .cse7)))) (let ((.cse14 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_213| 256) 0)) (.cse12 (= (ite (= (ite .cse7 1 0) 0) 0 1) v_~d3~0_259)) (.cse13 (= v_~g3~0_289 v_~g3~0_287)) (.cse15 (= (mod v_~d3~0_259 256) 0))) (or (and .cse12 .cse13 .cse14) (and .cse12 (= v_~g3~0_287 0) (not .cse14) (not .cse15)) (and .cse12 .cse13 .cse15))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_215|, ~g1~0=v_~g1~0_372, ~g3~0=v_~g3~0_288, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_344|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_338|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_338|, ~pos~0=v_~pos~0_751, ~d3~0=v_~d3~0_260, ~d1~0=v_~d1~0_388} OutVars{~g1~0=v_~g1~0_371, ~g3~0=v_~g3~0_287, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_337|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_337|, ~pos~0=v_~pos~0_748, ~d3~0=v_~d3~0_259, ~d1~0=v_~d1~0_387} AuxVars[v_~pos~0_750, |v_thread3Thread1of1ForFork2_#t~nondet5_213|, v_~pos~0_749, v_~d3~0_261, v_~g3~0_289] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d3~0, ~d1~0] [2022-12-13 10:30:59,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:30:59,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:31:00,108 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:31:00,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [495] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_180 256) 0)) (.cse1 (+ v_~pos~0_336 2)) (.cse6 (= (mod v_~d3~0_179 256) 0))) (and (or (and (not .cse0) (= v_~pos~0_336 (+ v_~pos~0_337 2))) (and .cse0 (= v_~pos~0_337 .cse1))) (let ((.cse4 (= (mod v_~d3~0_178 256) 0)) (.cse2 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d3~0_178)) (.cse3 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_139| 256) 0)) (.cse5 (= v_~g3~0_165 v_~g3~0_164))) (or (and .cse2 (not .cse3) (= v_~g3~0_164 0) (not .cse4)) (and .cse2 .cse5 .cse4) (and .cse2 .cse3 .cse5))) (let ((.cse7 (= v_~g3~0_166 v_~g3~0_165)) (.cse8 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_179))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_140| 256) 0) .cse7 .cse8) (and .cse7 .cse6 .cse8))) (let ((.cse9 (not (= (mod v_~g3~0_165 256) 0)))) (or (and (= v_~pos~0_335 .cse1) (not .cse6) .cse9) (and .cse9 (= v_~pos~0_336 (+ v_~pos~0_335 2)) .cse6))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_140|, ~g3~0=v_~g3~0_166, ~pos~0=v_~pos~0_337, ~d3~0=v_~d3~0_180} OutVars{~g3~0=v_~g3~0_164, ~pos~0=v_~pos~0_335, ~d3~0=v_~d3~0_178} AuxVars[v_~d3~0_179, |v_thread3Thread1of1ForFork2_#t~nondet5_139|, v_~g3~0_165, v_~pos~0_336] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:31:01,899 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:31:01,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6154 [2022-12-13 10:31:01,900 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 977 transitions, 13904 flow [2022-12-13 10:31:01,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:01,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:01,900 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:31:01,905 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:31:02,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:02,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:31:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash -778473852, now seen corresponding path program 2 times [2022-12-13 10:31:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:02,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554107302] [2022-12-13 10:31:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:02,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:02,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554107302] [2022-12-13 10:31:02,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554107302] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:02,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118583659] [2022-12-13 10:31:02,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:31:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:02,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:02,632 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:31:02,668 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:31:02,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:31:02,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:31:02,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:31:02,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:02,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:31:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:03,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118583659] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:31:03,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:31:03,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-13 10:31:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951018790] [2022-12-13 10:31:03,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:31:03,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:31:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:31:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:31:03,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 10:31:03,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 977 transitions, 13904 flow. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:03,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:03,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 10:31:03,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:10,696 INFO L130 PetriNetUnfolder]: 13107/19884 cut-off events. [2022-12-13 10:31:10,696 INFO L131 PetriNetUnfolder]: For 151521/151521 co-relation queries the response was YES. [2022-12-13 10:31:10,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130514 conditions, 19884 events. 13107/19884 cut-off events. For 151521/151521 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 131373 event pairs, 195 based on Foata normal form. 355/19627 useless extension candidates. Maximal degree in co-relation 127714. Up to 5531 conditions per place. [2022-12-13 10:31:10,860 INFO L137 encePairwiseOnDemand]: 15/58 looper letters, 1034 selfloop transitions, 1816 changer transitions 53/2903 dead transitions. [2022-12-13 10:31:10,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 2903 transitions, 43093 flow [2022-12-13 10:31:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-13 10:31:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-12-13 10:31:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 835 transitions. [2022-12-13 10:31:10,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.232202447163515 [2022-12-13 10:31:10,863 INFO L175 Difference]: Start difference. First operand has 139 places, 977 transitions, 13904 flow. Second operand 62 states and 835 transitions. [2022-12-13 10:31:10,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 2903 transitions, 43093 flow [2022-12-13 10:31:12,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 2903 transitions, 42127 flow, removed 458 selfloop flow, removed 3 redundant places. [2022-12-13 10:31:12,682 INFO L231 Difference]: Finished difference. Result has 228 places, 2219 transitions, 35512 flow [2022-12-13 10:31:12,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=12685, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=672, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=35512, PETRI_PLACES=228, PETRI_TRANSITIONS=2219} [2022-12-13 10:31:12,683 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 202 predicate places. [2022-12-13 10:31:12,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:12,684 INFO L89 Accepts]: Start accepts. Operand has 228 places, 2219 transitions, 35512 flow [2022-12-13 10:31:12,689 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:12,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:12,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 2219 transitions, 35512 flow [2022-12-13 10:31:12,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 2219 transitions, 35512 flow [2022-12-13 10:31:13,904 INFO L130 PetriNetUnfolder]: 2461/5522 cut-off events. [2022-12-13 10:31:13,905 INFO L131 PetriNetUnfolder]: For 56601/56968 co-relation queries the response was YES. [2022-12-13 10:31:13,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37293 conditions, 5522 events. 2461/5522 cut-off events. For 56601/56968 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 50114 event pairs, 0 based on Foata normal form. 9/5413 useless extension candidates. Maximal degree in co-relation 36020. Up to 1363 conditions per place. [2022-12-13 10:31:13,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 2219 transitions, 35512 flow [2022-12-13 10:31:13,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 10892 [2022-12-13 10:31:17,781 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:31:17,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5097 [2022-12-13 10:31:17,781 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 2216 transitions, 35486 flow [2022-12-13 10:31:17,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:17,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:17,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:31:17,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 10:31:17,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:17,984 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:31:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1845862125, now seen corresponding path program 1 times [2022-12-13 10:31:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:17,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350384357] [2022-12-13 10:31:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:31:18,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:18,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350384357] [2022-12-13 10:31:18,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350384357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:18,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227516670] [2022-12-13 10:31:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:18,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:18,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:18,248 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:31:18,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 10:31:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:18,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 10:31:18,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:31:18,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:31:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:18,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227516670] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:31:18,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:31:18,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 7 [2022-12-13 10:31:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082799540] [2022-12-13 10:31:18,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:31:18,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:31:18,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:18,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:31:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:31:18,680 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 10:31:18,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 2216 transitions, 35486 flow. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:18,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:18,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 10:31:18,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:26,356 INFO L130 PetriNetUnfolder]: 13668/20820 cut-off events. [2022-12-13 10:31:26,356 INFO L131 PetriNetUnfolder]: For 262545/262545 co-relation queries the response was YES. [2022-12-13 10:31:26,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159624 conditions, 20820 events. 13668/20820 cut-off events. For 262545/262545 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 138897 event pairs, 1432 based on Foata normal form. 100/20862 useless extension candidates. Maximal degree in co-relation 156980. Up to 13764 conditions per place. [2022-12-13 10:31:26,612 INFO L137 encePairwiseOnDemand]: 21/63 looper letters, 1712 selfloop transitions, 933 changer transitions 28/2673 dead transitions. [2022-12-13 10:31:26,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 2673 transitions, 47246 flow [2022-12-13 10:31:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:31:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:31:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2022-12-13 10:31:26,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18192918192918192 [2022-12-13 10:31:26,615 INFO L175 Difference]: Start difference. First operand has 221 places, 2216 transitions, 35486 flow. Second operand 13 states and 149 transitions. [2022-12-13 10:31:26,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 2673 transitions, 47246 flow [2022-12-13 10:31:31,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 2673 transitions, 45342 flow, removed 807 selfloop flow, removed 5 redundant places. [2022-12-13 10:31:31,316 INFO L231 Difference]: Finished difference. Result has 233 places, 2366 transitions, 39151 flow [2022-12-13 10:31:31,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=33838, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=786, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=39151, PETRI_PLACES=233, PETRI_TRANSITIONS=2366} [2022-12-13 10:31:31,318 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 207 predicate places. [2022-12-13 10:31:31,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:31,318 INFO L89 Accepts]: Start accepts. Operand has 233 places, 2366 transitions, 39151 flow [2022-12-13 10:31:31,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:31,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:31,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 2366 transitions, 39151 flow [2022-12-13 10:31:31,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 2366 transitions, 39151 flow [2022-12-13 10:31:32,831 INFO L130 PetriNetUnfolder]: 2571/5797 cut-off events. [2022-12-13 10:31:32,831 INFO L131 PetriNetUnfolder]: For 66331/66687 co-relation queries the response was YES. [2022-12-13 10:31:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39526 conditions, 5797 events. 2571/5797 cut-off events. For 66331/66687 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 52956 event pairs, 0 based on Foata normal form. 5/5681 useless extension candidates. Maximal degree in co-relation 38961. Up to 1423 conditions per place. [2022-12-13 10:31:32,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 2366 transitions, 39151 flow [2022-12-13 10:31:32,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 11296 [2022-12-13 10:31:32,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:31:33,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [506] L53-1-->L97-1: Formula: (let ((.cse4 (= (mod v_~d1~0_228 256) 0)) (.cse7 (= (mod v_~d3~0_194 256) 0)) (.cse5 (+ v_~pos~0_494 2)) (.cse15 (= (mod v_~d3~0_193 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_182| 256) 0)) (.cse0 (= (mod v_~d1~0_227 256) 0)) (.cse2 (= v_~d1~0_227 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse3 (= v_~g1~0_212 v_~g1~0_211))) (or (and (not .cse0) (not .cse1) .cse2 (= v_~g1~0_211 0)) (and .cse2 .cse1 .cse3) (and .cse0 .cse2 .cse3))) (let ((.cse6 (not (= (mod v_~g3~0_210 256) 0)))) (or (and (= v_~pos~0_492 .cse5) .cse6 (not .cse7)) (and .cse7 .cse6 (= v_~pos~0_494 (+ v_~pos~0_492 2))))) (let ((.cse9 (= (mod v_~d3~0_192 256) 0)) (.cse10 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_146| 256) 0)) (.cse8 (= (ite (= (ite .cse7 1 0) 0) 0 1) v_~d3~0_192)) (.cse11 (= v_~g3~0_208 v_~g3~0_210))) (or (and (= v_~g3~0_208 0) .cse8 (not .cse9) (not .cse10)) (and .cse8 .cse9 .cse11) (and .cse10 .cse8 .cse11))) (let ((.cse12 (not (= (mod v_~g1~0_212 256) 0)))) (or (and (= v_~pos~0_493 (+ v_~pos~0_495 1)) .cse12 (= |v_thread1Thread1of1ForFork0_#t~post2_174| |v_thread1Thread1of1ForFork0_#t~post2_173|) (not .cse4)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_174| |v_thread1Thread1of1ForFork0_#t~post1_173|) .cse4 .cse12 (= v_~pos~0_495 (+ v_~pos~0_493 1))))) (let ((.cse13 (= v_~g3~0_209 v_~g3~0_210)) (.cse14 (= (ite (= (ite .cse15 1 0) 0) 0 1) v_~d3~0_194))) (or (and .cse7 .cse13 .cse14) (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_148| 256) 0) .cse13 .cse14))) (or (and (not .cse15) (= v_~pos~0_494 (+ v_~pos~0_493 2))) (and (= v_~pos~0_493 .cse5) .cse15)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_148|, ~g1~0=v_~g1~0_212, ~g3~0=v_~g3~0_209, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_182|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_174|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_174|, ~pos~0=v_~pos~0_495, ~d3~0=v_~d3~0_193, ~d1~0=v_~d1~0_228} OutVars{~g1~0=v_~g1~0_211, ~g3~0=v_~g3~0_208, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_173|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_173|, ~pos~0=v_~pos~0_492, ~d3~0=v_~d3~0_192, ~d1~0=v_~d1~0_227} AuxVars[|v_thread3Thread1of1ForFork2_#t~nondet5_146|, v_~pos~0_493, v_~pos~0_494, v_~g3~0_210, v_~d3~0_194] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d3~0, ~d1~0] [2022-12-13 10:31:34,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [493] L97-1-->L97-1: Formula: (let ((.cse1 (+ v_~pos~0_330 2)) (.cse0 (= (mod v_~d3~0_174 256) 0)) (.cse2 (= (mod v_~d3~0_173 256) 0))) (and (or (and .cse0 (= v_~pos~0_331 .cse1)) (and (not .cse0) (not (= (mod v_~g3~0_160 256) 0)) (= v_~pos~0_330 (+ v_~pos~0_331 2)))) (or (and (= v_~pos~0_329 .cse1) (not .cse2) (not (= (mod v_~g3~0_159 256) 0))) (and (= v_~pos~0_330 (+ v_~pos~0_329 2)) .cse2)) (let ((.cse3 (= v_~g3~0_159 v_~g3~0_160)) (.cse4 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_173))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_134| 256) 0)))) (let ((.cse7 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_133| 256))) (.cse6 (= (ite (= (ite .cse2 1 0) 0) 0 1) v_~d3~0_172)) (.cse8 (= v_~g3~0_159 v_~g3~0_158)) (.cse5 (= (mod v_~d3~0_172 256) 0))) (or (and (not .cse5) .cse6 (not .cse7) (= v_~g3~0_158 0)) (and .cse7 .cse6 .cse8) (and .cse6 .cse8 .cse5))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_134|, ~g3~0=v_~g3~0_160, ~pos~0=v_~pos~0_331, ~d3~0=v_~d3~0_174} OutVars{~g3~0=v_~g3~0_158, ~pos~0=v_~pos~0_329, ~d3~0=v_~d3~0_172} AuxVars[|v_thread3Thread1of1ForFork2_#t~nondet5_133|, v_~g3~0_159, v_~pos~0_330, v_~d3~0_173] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:31:36,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [493] L97-1-->L97-1: Formula: (let ((.cse1 (+ v_~pos~0_330 2)) (.cse0 (= (mod v_~d3~0_174 256) 0)) (.cse2 (= (mod v_~d3~0_173 256) 0))) (and (or (and .cse0 (= v_~pos~0_331 .cse1)) (and (not .cse0) (not (= (mod v_~g3~0_160 256) 0)) (= v_~pos~0_330 (+ v_~pos~0_331 2)))) (or (and (= v_~pos~0_329 .cse1) (not .cse2) (not (= (mod v_~g3~0_159 256) 0))) (and (= v_~pos~0_330 (+ v_~pos~0_329 2)) .cse2)) (let ((.cse3 (= v_~g3~0_159 v_~g3~0_160)) (.cse4 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_173))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_134| 256) 0)))) (let ((.cse7 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_133| 256))) (.cse6 (= (ite (= (ite .cse2 1 0) 0) 0 1) v_~d3~0_172)) (.cse8 (= v_~g3~0_159 v_~g3~0_158)) (.cse5 (= (mod v_~d3~0_172 256) 0))) (or (and (not .cse5) .cse6 (not .cse7) (= v_~g3~0_158 0)) (and .cse7 .cse6 .cse8) (and .cse6 .cse8 .cse5))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_134|, ~g3~0=v_~g3~0_160, ~pos~0=v_~pos~0_331, ~d3~0=v_~d3~0_174} OutVars{~g3~0=v_~g3~0_158, ~pos~0=v_~pos~0_329, ~d3~0=v_~d3~0_172} AuxVars[|v_thread3Thread1of1ForFork2_#t~nondet5_133|, v_~g3~0_159, v_~pos~0_330, v_~d3~0_173] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:31:37,985 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:31:37,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6668 [2022-12-13 10:31:37,986 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 2366 transitions, 39199 flow [2022-12-13 10:31:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:37,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:37,986 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:31:37,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 10:31:38,186 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,SelfDestructingSolverStorable10 [2022-12-13 10:31:38,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:31:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash -531365116, now seen corresponding path program 1 times [2022-12-13 10:31:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:38,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356073984] [2022-12-13 10:31:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:31:38,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356073984] [2022-12-13 10:31:38,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356073984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871535354] [2022-12-13 10:31:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:38,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:38,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:38,497 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:31:38,499 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:31:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:38,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 10:31:38,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:31:38,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:31:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 10:31:38,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871535354] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:31:38,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:31:38,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 10:31:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485633084] [2022-12-13 10:31:38,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:31:38,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:31:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:31:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:31:38,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-13 10:31:38,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 2366 transitions, 39199 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:38,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:38,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-13 10:31:38,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:44,780 INFO L130 PetriNetUnfolder]: 10404/15467 cut-off events. [2022-12-13 10:31:44,780 INFO L131 PetriNetUnfolder]: For 205545/205545 co-relation queries the response was YES. [2022-12-13 10:31:44,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120399 conditions, 15467 events. 10404/15467 cut-off events. For 205545/205545 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 95679 event pairs, 396 based on Foata normal form. 766/16141 useless extension candidates. Maximal degree in co-relation 119080. Up to 6592 conditions per place. [2022-12-13 10:31:44,916 INFO L137 encePairwiseOnDemand]: 29/67 looper letters, 1667 selfloop transitions, 833 changer transitions 14/2514 dead transitions. [2022-12-13 10:31:44,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 2514 transitions, 45951 flow [2022-12-13 10:31:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:31:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:31:44,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2022-12-13 10:31:44,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2198100407055631 [2022-12-13 10:31:44,917 INFO L175 Difference]: Start difference. First operand has 233 places, 2366 transitions, 39199 flow. Second operand 11 states and 162 transitions. [2022-12-13 10:31:44,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 2514 transitions, 45951 flow [2022-12-13 10:31:48,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 2514 transitions, 45064 flow, removed 299 selfloop flow, removed 10 redundant places. [2022-12-13 10:31:48,657 INFO L231 Difference]: Finished difference. Result has 230 places, 2026 transitions, 34404 flow [2022-12-13 10:31:48,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=31708, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=764, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=34404, PETRI_PLACES=230, PETRI_TRANSITIONS=2026} [2022-12-13 10:31:48,659 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 204 predicate places. [2022-12-13 10:31:48,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:48,659 INFO L89 Accepts]: Start accepts. Operand has 230 places, 2026 transitions, 34404 flow [2022-12-13 10:31:48,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:48,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:48,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 2026 transitions, 34404 flow [2022-12-13 10:31:48,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 2026 transitions, 34404 flow [2022-12-13 10:31:49,633 INFO L130 PetriNetUnfolder]: 2278/4547 cut-off events. [2022-12-13 10:31:49,633 INFO L131 PetriNetUnfolder]: For 50063/50467 co-relation queries the response was YES. [2022-12-13 10:31:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33735 conditions, 4547 events. 2278/4547 cut-off events. For 50063/50467 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 35821 event pairs, 0 based on Foata normal form. 13/4484 useless extension candidates. Maximal degree in co-relation 33126. Up to 1296 conditions per place. [2022-12-13 10:31:49,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 230 places, 2026 transitions, 34404 flow [2022-12-13 10:31:49,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 8450 [2022-12-13 10:31:49,778 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:49,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1120 [2022-12-13 10:31:49,779 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 2026 transitions, 34404 flow [2022-12-13 10:31:49,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:49,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:49,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:31:49,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 10:31:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:49,984 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:31:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash -760611728, now seen corresponding path program 1 times [2022-12-13 10:31:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:49,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280889820] [2022-12-13 10:31:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:50,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:50,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280889820] [2022-12-13 10:31:50,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280889820] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:50,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176233571] [2022-12-13 10:31:50,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:50,214 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:31:50,216 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:31:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:50,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 10:31:50,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:50,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:31:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:50,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176233571] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:31:50,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:31:50,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2022-12-13 10:31:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331763762] [2022-12-13 10:31:50,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:31:50,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:50,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:50,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-13 10:31:50,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 2026 transitions, 34404 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:50,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:50,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-13 10:31:50,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:55,332 INFO L130 PetriNetUnfolder]: 9776/14825 cut-off events. [2022-12-13 10:31:55,333 INFO L131 PetriNetUnfolder]: For 220090/220090 co-relation queries the response was YES. [2022-12-13 10:31:55,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111600 conditions, 14825 events. 9776/14825 cut-off events. For 220090/220090 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 94520 event pairs, 1392 based on Foata normal form. 1322/16083 useless extension candidates. Maximal degree in co-relation 111093. Up to 6997 conditions per place. [2022-12-13 10:31:55,492 INFO L137 encePairwiseOnDemand]: 33/67 looper letters, 1616 selfloop transitions, 356 changer transitions 0/1972 dead transitions. [2022-12-13 10:31:55,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1972 transitions, 35510 flow [2022-12-13 10:31:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:31:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:31:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-12-13 10:31:55,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30597014925373134 [2022-12-13 10:31:55,493 INFO L175 Difference]: Start difference. First operand has 230 places, 2026 transitions, 34404 flow. Second operand 6 states and 123 transitions. [2022-12-13 10:31:55,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1972 transitions, 35510 flow [2022-12-13 10:31:58,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1972 transitions, 33635 flow, removed 662 selfloop flow, removed 14 redundant places. [2022-12-13 10:31:58,123 INFO L231 Difference]: Finished difference. Result has 222 places, 1811 transitions, 28987 flow [2022-12-13 10:31:58,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=26961, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=28987, PETRI_PLACES=222, PETRI_TRANSITIONS=1811} [2022-12-13 10:31:58,124 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 196 predicate places. [2022-12-13 10:31:58,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:58,125 INFO L89 Accepts]: Start accepts. Operand has 222 places, 1811 transitions, 28987 flow [2022-12-13 10:31:58,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:58,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:58,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 1811 transitions, 28987 flow [2022-12-13 10:31:58,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 1811 transitions, 28987 flow [2022-12-13 10:31:58,961 INFO L130 PetriNetUnfolder]: 1978/4209 cut-off events. [2022-12-13 10:31:58,961 INFO L131 PetriNetUnfolder]: For 41411/41863 co-relation queries the response was YES. [2022-12-13 10:31:58,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28971 conditions, 4209 events. 1978/4209 cut-off events. For 41411/41863 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 34905 event pairs, 0 based on Foata normal form. 13/4151 useless extension candidates. Maximal degree in co-relation 27984. Up to 1328 conditions per place. [2022-12-13 10:31:59,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 1811 transitions, 28987 flow [2022-12-13 10:31:59,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 7762 [2022-12-13 10:31:59,016 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:59,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 892 [2022-12-13 10:31:59,017 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 1811 transitions, 28987 flow [2022-12-13 10:31:59,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:59,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:59,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:31:59,033 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:31:59,222 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,SelfDestructingSolverStorable12 [2022-12-13 10:31:59,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:31:59,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash 685003521, now seen corresponding path program 1 times [2022-12-13 10:31:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:59,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586138175] [2022-12-13 10:31:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:59,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586138175] [2022-12-13 10:31:59,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586138175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864602467] [2022-12-13 10:31:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:59,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:59,524 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:31:59,526 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:31:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:59,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 10:31:59,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:59,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:31:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:59,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864602467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:31:59,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:31:59,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-13 10:31:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675565142] [2022-12-13 10:31:59,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:31:59,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 10:31:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 10:31:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-13 10:31:59,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-13 10:31:59,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1811 transitions, 28987 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:31:59,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:59,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-13 10:31:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:04,573 INFO L130 PetriNetUnfolder]: 10032/15179 cut-off events. [2022-12-13 10:32:04,573 INFO L131 PetriNetUnfolder]: For 216842/216842 co-relation queries the response was YES. [2022-12-13 10:32:04,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111740 conditions, 15179 events. 10032/15179 cut-off events. For 216842/216842 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 97971 event pairs, 669 based on Foata normal form. 1338/16485 useless extension candidates. Maximal degree in co-relation 108940. Up to 9202 conditions per place. [2022-12-13 10:32:04,707 INFO L137 encePairwiseOnDemand]: 28/61 looper letters, 1308 selfloop transitions, 860 changer transitions 15/2183 dead transitions. [2022-12-13 10:32:04,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 2183 transitions, 38198 flow [2022-12-13 10:32:04,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:32:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:32:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-12-13 10:32:04,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2505854800936768 [2022-12-13 10:32:04,708 INFO L175 Difference]: Start difference. First operand has 222 places, 1811 transitions, 28987 flow. Second operand 7 states and 107 transitions. [2022-12-13 10:32:04,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 2183 transitions, 38198 flow [2022-12-13 10:32:07,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 2183 transitions, 37222 flow, removed 327 selfloop flow, removed 3 redundant places. [2022-12-13 10:32:07,747 INFO L231 Difference]: Finished difference. Result has 223 places, 1830 transitions, 30911 flow [2022-12-13 10:32:07,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=26324, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=724, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=30911, PETRI_PLACES=223, PETRI_TRANSITIONS=1830} [2022-12-13 10:32:07,749 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 197 predicate places. [2022-12-13 10:32:07,749 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:07,749 INFO L89 Accepts]: Start accepts. Operand has 223 places, 1830 transitions, 30911 flow [2022-12-13 10:32:07,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:07,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:07,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 1830 transitions, 30911 flow [2022-12-13 10:32:07,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 1830 transitions, 30911 flow [2022-12-13 10:32:08,710 INFO L130 PetriNetUnfolder]: 2162/4327 cut-off events. [2022-12-13 10:32:08,710 INFO L131 PetriNetUnfolder]: For 42729/43311 co-relation queries the response was YES. [2022-12-13 10:32:08,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 4327 events. 2162/4327 cut-off events. For 42729/43311 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 34168 event pairs, 2 based on Foata normal form. 12/4303 useless extension candidates. Maximal degree in co-relation 31070. Up to 1568 conditions per place. [2022-12-13 10:32:08,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 1830 transitions, 30911 flow [2022-12-13 10:32:08,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 7684 [2022-12-13 10:32:08,769 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:32:08,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1021 [2022-12-13 10:32:08,770 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 1830 transitions, 30911 flow [2022-12-13 10:32:08,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:32:08,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:08,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:32:08,793 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:32:08,975 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,SelfDestructingSolverStorable13 [2022-12-13 10:32:08,975 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:32:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 470386445, now seen corresponding path program 1 times [2022-12-13 10:32:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:08,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256757360] [2022-12-13 10:32:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:32:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:09,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256757360] [2022-12-13 10:32:09,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256757360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:32:09,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062190364] [2022-12-13 10:32:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:09,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:32:09,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:32:09,520 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:32:09,554 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:32:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:09,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:32:09,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:32:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:32:09,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:32:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:32:10,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062190364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:32:10,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:32:10,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 10:32:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081173613] [2022-12-13 10:32:10,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:32:10,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 10:32:10,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:10,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 10:32:10,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:32:10,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:32:10,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1830 transitions, 30911 flow. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:32:10,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:10,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:32:10,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:17,833 INFO L130 PetriNetUnfolder]: 13840/20800 cut-off events. [2022-12-13 10:32:17,833 INFO L131 PetriNetUnfolder]: For 265648/265648 co-relation queries the response was YES. [2022-12-13 10:32:17,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161871 conditions, 20800 events. 13840/20800 cut-off events. For 265648/265648 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 138115 event pairs, 331 based on Foata normal form. 14/20800 useless extension candidates. Maximal degree in co-relation 158925. Up to 10023 conditions per place. [2022-12-13 10:32:18,020 INFO L137 encePairwiseOnDemand]: 17/57 looper letters, 1041 selfloop transitions, 1881 changer transitions 51/2973 dead transitions. [2022-12-13 10:32:18,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 2973 transitions, 53273 flow [2022-12-13 10:32:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 10:32:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 10:32:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 391 transitions. [2022-12-13 10:32:18,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21436403508771928 [2022-12-13 10:32:18,022 INFO L175 Difference]: Start difference. First operand has 223 places, 1830 transitions, 30911 flow. Second operand 32 states and 391 transitions. [2022-12-13 10:32:18,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 2973 transitions, 53273 flow [2022-12-13 10:32:23,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 2973 transitions, 52381 flow, removed 347 selfloop flow, removed 6 redundant places. [2022-12-13 10:32:23,432 INFO L231 Difference]: Finished difference. Result has 265 places, 2661 transitions, 51455 flow [2022-12-13 10:32:23,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=30399, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=51455, PETRI_PLACES=265, PETRI_TRANSITIONS=2661} [2022-12-13 10:32:23,434 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 239 predicate places. [2022-12-13 10:32:23,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:23,434 INFO L89 Accepts]: Start accepts. Operand has 265 places, 2661 transitions, 51455 flow [2022-12-13 10:32:23,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:23,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:23,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 2661 transitions, 51455 flow [2022-12-13 10:32:23,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 2661 transitions, 51455 flow [2022-12-13 10:32:25,128 INFO L130 PetriNetUnfolder]: 3076/6039 cut-off events. [2022-12-13 10:32:25,128 INFO L131 PetriNetUnfolder]: For 76914/77695 co-relation queries the response was YES. [2022-12-13 10:32:25,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49934 conditions, 6039 events. 3076/6039 cut-off events. For 76914/77695 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 49943 event pairs, 7 based on Foata normal form. 10/6000 useless extension candidates. Maximal degree in co-relation 49069. Up to 2342 conditions per place. [2022-12-13 10:32:25,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 2661 transitions, 51455 flow [2022-12-13 10:32:25,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 11032 [2022-12-13 10:32:25,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:32:25,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [495] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_180 256) 0)) (.cse1 (+ v_~pos~0_336 2)) (.cse6 (= (mod v_~d3~0_179 256) 0))) (and (or (and (not .cse0) (= v_~pos~0_336 (+ v_~pos~0_337 2))) (and .cse0 (= v_~pos~0_337 .cse1))) (let ((.cse4 (= (mod v_~d3~0_178 256) 0)) (.cse2 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d3~0_178)) (.cse3 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_139| 256) 0)) (.cse5 (= v_~g3~0_165 v_~g3~0_164))) (or (and .cse2 (not .cse3) (= v_~g3~0_164 0) (not .cse4)) (and .cse2 .cse5 .cse4) (and .cse2 .cse3 .cse5))) (let ((.cse7 (= v_~g3~0_166 v_~g3~0_165)) (.cse8 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_179))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_140| 256) 0) .cse7 .cse8) (and .cse7 .cse6 .cse8))) (let ((.cse9 (not (= (mod v_~g3~0_165 256) 0)))) (or (and (= v_~pos~0_335 .cse1) (not .cse6) .cse9) (and .cse9 (= v_~pos~0_336 (+ v_~pos~0_335 2)) .cse6))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_140|, ~g3~0=v_~g3~0_166, ~pos~0=v_~pos~0_337, ~d3~0=v_~d3~0_180} OutVars{~g3~0=v_~g3~0_164, ~pos~0=v_~pos~0_335, ~d3~0=v_~d3~0_178} AuxVars[v_~d3~0_179, |v_thread3Thread1of1ForFork2_#t~nondet5_139|, v_~g3~0_165, v_~pos~0_336] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:32:27,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:32:27,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:32:27,533 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:32:27,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4100 [2022-12-13 10:32:27,534 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 2661 transitions, 51491 flow [2022-12-13 10:32:27,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:32:27,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:27,535 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:32:27,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 10:32:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 10:32:27,739 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:32:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash -258805200, now seen corresponding path program 2 times [2022-12-13 10:32:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135788233] [2022-12-13 10:32:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:32:28,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:28,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135788233] [2022-12-13 10:32:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135788233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:32:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98022513] [2022-12-13 10:32:28,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:32:28,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:32:28,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:32:28,416 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:32:28,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 10:32:28,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:32:28,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:32:28,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 10:32:28,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:32:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:32:28,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:32:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:32:29,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98022513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:32:29,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:32:29,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 10:32:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113833918] [2022-12-13 10:32:29,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:32:29,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 10:32:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 10:32:29,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-12-13 10:32:29,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 10:32:29,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 2661 transitions, 51491 flow. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:32:29,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:29,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 10:32:29,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:44,896 INFO L130 PetriNetUnfolder]: 22073/33121 cut-off events. [2022-12-13 10:32:44,897 INFO L131 PetriNetUnfolder]: For 555255/555255 co-relation queries the response was YES. [2022-12-13 10:32:45,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290037 conditions, 33121 events. 22073/33121 cut-off events. For 555255/555255 co-relation queries the response was YES. Maximal size of possible extension queue 1904. Compared 232288 event pairs, 1023 based on Foata normal form. 40/33143 useless extension candidates. Maximal degree in co-relation 287756. Up to 11737 conditions per place. [2022-12-13 10:32:45,354 INFO L137 encePairwiseOnDemand]: 19/62 looper letters, 1471 selfloop transitions, 2972 changer transitions 120/4563 dead transitions. [2022-12-13 10:32:45,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 4563 transitions, 96746 flow [2022-12-13 10:32:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 10:32:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 10:32:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 425 transitions. [2022-12-13 10:32:45,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2363737486095662 [2022-12-13 10:32:45,356 INFO L175 Difference]: Start difference. First operand has 265 places, 2661 transitions, 51491 flow. Second operand 29 states and 425 transitions. [2022-12-13 10:32:45,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 4563 transitions, 96746 flow [2022-12-13 10:33:02,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 4563 transitions, 96024 flow, removed 227 selfloop flow, removed 2 redundant places. [2022-12-13 10:33:02,340 INFO L231 Difference]: Finished difference. Result has 305 places, 4068 transitions, 91370 flow [2022-12-13 10:33:02,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=50964, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1721, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=774, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=91370, PETRI_PLACES=305, PETRI_TRANSITIONS=4068} [2022-12-13 10:33:02,343 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 279 predicate places. [2022-12-13 10:33:02,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:33:02,343 INFO L89 Accepts]: Start accepts. Operand has 305 places, 4068 transitions, 91370 flow [2022-12-13 10:33:02,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:33:02,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:33:02,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 4068 transitions, 91370 flow [2022-12-13 10:33:02,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 4068 transitions, 91370 flow [2022-12-13 10:33:06,299 INFO L130 PetriNetUnfolder]: 4778/9518 cut-off events. [2022-12-13 10:33:06,299 INFO L131 PetriNetUnfolder]: For 163551/164987 co-relation queries the response was YES. [2022-12-13 10:33:06,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88269 conditions, 9518 events. 4778/9518 cut-off events. For 163551/164987 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 85328 event pairs, 17 based on Foata normal form. 13/9455 useless extension candidates. Maximal degree in co-relation 86819. Up to 3714 conditions per place. [2022-12-13 10:33:06,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 4068 transitions, 91370 flow [2022-12-13 10:33:06,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 17462 [2022-12-13 10:33:06,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-13 10:33:06,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:33:06,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:33:08,059 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:33:08,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5717 [2022-12-13 10:33:08,060 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 4068 transitions, 91457 flow [2022-12-13 10:33:08,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:33:08,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:33:08,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:33:08,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 10:33:08,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 10:33:08,266 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:33:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:33:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 485494591, now seen corresponding path program 1 times [2022-12-13 10:33:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:33:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332941025] [2022-12-13 10:33:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:33:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:33:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:33:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:33:08,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:33:08,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332941025] [2022-12-13 10:33:08,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332941025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:33:08,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123819483] [2022-12-13 10:33:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:33:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:33:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:33:08,694 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:33:08,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 10:33:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:33:08,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:33:08,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:33:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:33:08,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:33:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:33:09,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123819483] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:33:09,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:33:09,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-13 10:33:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361843439] [2022-12-13 10:33:09,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:33:09,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:33:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:33:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:33:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:33:09,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-13 10:33:09,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 4068 transitions, 91457 flow. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:33:09,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:33:09,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-13 10:33:09,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:33:44,638 INFO L130 PetriNetUnfolder]: 27408/41648 cut-off events. [2022-12-13 10:33:44,638 INFO L131 PetriNetUnfolder]: For 872183/872183 co-relation queries the response was YES. [2022-12-13 10:33:45,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399145 conditions, 41648 events. 27408/41648 cut-off events. For 872183/872183 co-relation queries the response was YES. Maximal size of possible extension queue 2454. Compared 308149 event pairs, 140 based on Foata normal form. 39/41669 useless extension candidates. Maximal degree in co-relation 396336. Up to 15159 conditions per place. [2022-12-13 10:33:45,423 INFO L137 encePairwiseOnDemand]: 17/66 looper letters, 1472 selfloop transitions, 4119 changer transitions 209/5800 dead transitions. [2022-12-13 10:33:45,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 5800 transitions, 135821 flow [2022-12-13 10:33:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-13 10:33:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-13 10:33:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 554 transitions. [2022-12-13 10:33:45,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16787878787878788 [2022-12-13 10:33:45,426 INFO L175 Difference]: Start difference. First operand has 303 places, 4068 transitions, 91457 flow. Second operand 50 states and 554 transitions. [2022-12-13 10:33:45,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 5800 transitions, 135821 flow [2022-12-13 10:34:18,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 5800 transitions, 134527 flow, removed 618 selfloop flow, removed 1 redundant places. [2022-12-13 10:34:18,988 INFO L231 Difference]: Finished difference. Result has 377 places, 5309 transitions, 132157 flow [2022-12-13 10:34:18,991 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=90487, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4066, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2936, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=132157, PETRI_PLACES=377, PETRI_TRANSITIONS=5309} [2022-12-13 10:34:18,991 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 351 predicate places. [2022-12-13 10:34:18,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:34:18,992 INFO L89 Accepts]: Start accepts. Operand has 377 places, 5309 transitions, 132157 flow [2022-12-13 10:34:19,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:34:19,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:34:19,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 377 places, 5309 transitions, 132157 flow [2022-12-13 10:34:19,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 376 places, 5309 transitions, 132157 flow [2022-12-13 10:34:25,642 INFO L130 PetriNetUnfolder]: 5899/11893 cut-off events. [2022-12-13 10:34:25,642 INFO L131 PetriNetUnfolder]: For 295595/297258 co-relation queries the response was YES. [2022-12-13 10:34:25,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125462 conditions, 11893 events. 5899/11893 cut-off events. For 295595/297258 co-relation queries the response was YES. Maximal size of possible extension queue 1153. Compared 111234 event pairs, 22 based on Foata normal form. 3/11827 useless extension candidates. Maximal degree in co-relation 124904. Up to 4856 conditions per place. [2022-12-13 10:34:25,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 376 places, 5309 transitions, 132157 flow [2022-12-13 10:34:25,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 22278 [2022-12-13 10:34:26,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [522] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_286 256) 0)) (.cse10 (+ v_~pos~0_601 1)) (.cse9 (+ v_~pos~0_599 1)) (.cse5 (= (mod v_~d1~0_285 256) 0)) (.cse11 (+ v_~pos~0_598 1)) (.cse8 (= (mod v_~d1~0_288 256) 0)) (.cse14 (= (mod v_~d1~0_287 256) 0))) (and (let ((.cse1 (= 0 (mod v_~d1~0_284 256))) (.cse0 (= v_~d1~0_284 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_238| 256) 0)) (.cse3 (= v_~g1~0_268 v_~g1~0_270))) (or (and .cse0 (not .cse1) (= v_~g1~0_268 0) (not .cse2)) (and .cse1 .cse0 .cse3) (and .cse0 .cse2 .cse3))) (let ((.cse6 (= v_~d1~0_285 (ite (= (ite .cse8 1 0) 0) 0 1))) (.cse7 (= v_~g1~0_269 v_~g1~0_272))) (or (and .cse5 .cse6 .cse7) (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_241| 256) 0) .cse6 .cse7))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_234| |v_thread1Thread1of1ForFork0_#t~post2_232|) (= v_~pos~0_597 .cse9) (not .cse4)) (and (= v_~pos~0_599 (+ v_~pos~0_597 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_234| |v_thread1Thread1of1ForFork0_#t~post1_232|) .cse4)) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_236| |v_thread1Thread1of1ForFork0_#t~post2_233|) (not .cse8) (= .cse10 v_~pos~0_598) (not (= (mod v_~g1~0_272 256) 0))) (and .cse8 (= v_~pos~0_601 .cse11) (= |v_thread1Thread1of1ForFork0_#t~post1_236| |v_thread1Thread1of1ForFork0_#t~post1_233|))) (let ((.cse12 (= v_~g1~0_269 v_~g1~0_270)) (.cse13 (= v_~d1~0_286 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse12 .cse4 .cse13) (and .cse12 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_240| 256) 0) .cse13))) (or (and (not (= (mod v_~g1~0_271 256) 0)) (not .cse14) (= v_~pos~0_601 (+ v_~pos~0_600 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_236| |v_thread1Thread1of1ForFork0_#t~post2_235|)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_236| |v_thread1Thread1of1ForFork0_#t~post1_235|) .cse14 (= .cse10 v_~pos~0_600))) (or (and .cse5 (= |v_thread1Thread1of1ForFork0_#t~post1_234| |v_thread1Thread1of1ForFork0_#t~post1_233|) (= v_~pos~0_598 .cse9)) (and (not .cse5) (= |v_thread1Thread1of1ForFork0_#t~post2_234| |v_thread1Thread1of1ForFork0_#t~post2_233|) (= v_~pos~0_599 .cse11))) (let ((.cse15 (= v_~g1~0_272 v_~g1~0_271)) (.cse16 (= v_~d1~0_288 (ite (= 0 (ite .cse14 1 0)) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_242| 256) 0) .cse15 .cse16) (and .cse15 .cse16 .cse8))))) InVars {~g1~0=v_~g1~0_271, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_242|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_235|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_235|, ~pos~0=v_~pos~0_600, ~d1~0=v_~d1~0_287} OutVars{~g1~0=v_~g1~0_268, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_232|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_232|, ~pos~0=v_~pos~0_597, ~d1~0=v_~d1~0_284} AuxVars[|v_thread1Thread1of1ForFork0_#t~post2_236|, v_~g1~0_270, |v_thread1Thread1of1ForFork0_#t~post2_234|, |v_thread1Thread1of1ForFork0_#t~post2_233|, v_~g1~0_272, |v_thread1Thread1of1ForFork0_#t~nondet3_238|, v_~pos~0_598, |v_thread1Thread1of1ForFork0_#t~nondet3_241|, |v_thread1Thread1of1ForFork0_#t~nondet3_240|, v_~pos~0_599, |v_thread1Thread1of1ForFork0_#t~post1_234|, |v_thread1Thread1of1ForFork0_#t~post1_233|, |v_thread1Thread1of1ForFork0_#t~post1_236|, v_~d1~0_286, v_~d1~0_285, v_~d1~0_288, v_~g1~0_269, v_~pos~0_601] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:34:30,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [522] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_286 256) 0)) (.cse10 (+ v_~pos~0_601 1)) (.cse9 (+ v_~pos~0_599 1)) (.cse5 (= (mod v_~d1~0_285 256) 0)) (.cse11 (+ v_~pos~0_598 1)) (.cse8 (= (mod v_~d1~0_288 256) 0)) (.cse14 (= (mod v_~d1~0_287 256) 0))) (and (let ((.cse1 (= 0 (mod v_~d1~0_284 256))) (.cse0 (= v_~d1~0_284 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_238| 256) 0)) (.cse3 (= v_~g1~0_268 v_~g1~0_270))) (or (and .cse0 (not .cse1) (= v_~g1~0_268 0) (not .cse2)) (and .cse1 .cse0 .cse3) (and .cse0 .cse2 .cse3))) (let ((.cse6 (= v_~d1~0_285 (ite (= (ite .cse8 1 0) 0) 0 1))) (.cse7 (= v_~g1~0_269 v_~g1~0_272))) (or (and .cse5 .cse6 .cse7) (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_241| 256) 0) .cse6 .cse7))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_234| |v_thread1Thread1of1ForFork0_#t~post2_232|) (= v_~pos~0_597 .cse9) (not .cse4)) (and (= v_~pos~0_599 (+ v_~pos~0_597 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_234| |v_thread1Thread1of1ForFork0_#t~post1_232|) .cse4)) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_236| |v_thread1Thread1of1ForFork0_#t~post2_233|) (not .cse8) (= .cse10 v_~pos~0_598) (not (= (mod v_~g1~0_272 256) 0))) (and .cse8 (= v_~pos~0_601 .cse11) (= |v_thread1Thread1of1ForFork0_#t~post1_236| |v_thread1Thread1of1ForFork0_#t~post1_233|))) (let ((.cse12 (= v_~g1~0_269 v_~g1~0_270)) (.cse13 (= v_~d1~0_286 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse12 .cse4 .cse13) (and .cse12 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_240| 256) 0) .cse13))) (or (and (not (= (mod v_~g1~0_271 256) 0)) (not .cse14) (= v_~pos~0_601 (+ v_~pos~0_600 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_236| |v_thread1Thread1of1ForFork0_#t~post2_235|)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_236| |v_thread1Thread1of1ForFork0_#t~post1_235|) .cse14 (= .cse10 v_~pos~0_600))) (or (and .cse5 (= |v_thread1Thread1of1ForFork0_#t~post1_234| |v_thread1Thread1of1ForFork0_#t~post1_233|) (= v_~pos~0_598 .cse9)) (and (not .cse5) (= |v_thread1Thread1of1ForFork0_#t~post2_234| |v_thread1Thread1of1ForFork0_#t~post2_233|) (= v_~pos~0_599 .cse11))) (let ((.cse15 (= v_~g1~0_272 v_~g1~0_271)) (.cse16 (= v_~d1~0_288 (ite (= 0 (ite .cse14 1 0)) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_242| 256) 0) .cse15 .cse16) (and .cse15 .cse16 .cse8))))) InVars {~g1~0=v_~g1~0_271, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_242|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_235|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_235|, ~pos~0=v_~pos~0_600, ~d1~0=v_~d1~0_287} OutVars{~g1~0=v_~g1~0_268, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_232|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_232|, ~pos~0=v_~pos~0_597, ~d1~0=v_~d1~0_284} AuxVars[|v_thread1Thread1of1ForFork0_#t~post2_236|, v_~g1~0_270, |v_thread1Thread1of1ForFork0_#t~post2_234|, |v_thread1Thread1of1ForFork0_#t~post2_233|, v_~g1~0_272, |v_thread1Thread1of1ForFork0_#t~nondet3_238|, v_~pos~0_598, |v_thread1Thread1of1ForFork0_#t~nondet3_241|, |v_thread1Thread1of1ForFork0_#t~nondet3_240|, v_~pos~0_599, |v_thread1Thread1of1ForFork0_#t~post1_234|, |v_thread1Thread1of1ForFork0_#t~post1_233|, |v_thread1Thread1of1ForFork0_#t~post1_236|, v_~d1~0_286, v_~d1~0_285, v_~d1~0_288, v_~g1~0_269, v_~pos~0_601] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [495] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_180 256) 0)) (.cse1 (+ v_~pos~0_336 2)) (.cse6 (= (mod v_~d3~0_179 256) 0))) (and (or (and (not .cse0) (= v_~pos~0_336 (+ v_~pos~0_337 2))) (and .cse0 (= v_~pos~0_337 .cse1))) (let ((.cse4 (= (mod v_~d3~0_178 256) 0)) (.cse2 (= (ite (= (ite .cse6 1 0) 0) 0 1) v_~d3~0_178)) (.cse3 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_139| 256) 0)) (.cse5 (= v_~g3~0_165 v_~g3~0_164))) (or (and .cse2 (not .cse3) (= v_~g3~0_164 0) (not .cse4)) (and .cse2 .cse5 .cse4) (and .cse2 .cse3 .cse5))) (let ((.cse7 (= v_~g3~0_166 v_~g3~0_165)) (.cse8 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_179))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_140| 256) 0) .cse7 .cse8) (and .cse7 .cse6 .cse8))) (let ((.cse9 (not (= (mod v_~g3~0_165 256) 0)))) (or (and (= v_~pos~0_335 .cse1) (not .cse6) .cse9) (and .cse9 (= v_~pos~0_336 (+ v_~pos~0_335 2)) .cse6))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_140|, ~g3~0=v_~g3~0_166, ~pos~0=v_~pos~0_337, ~d3~0=v_~d3~0_180} OutVars{~g3~0=v_~g3~0_164, ~pos~0=v_~pos~0_335, ~d3~0=v_~d3~0_178} AuxVars[v_~d3~0_179, |v_thread3Thread1of1ForFork2_#t~nondet5_139|, v_~g3~0_165, v_~pos~0_336] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:37,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:37,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:34:37,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 10:34:37,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:38,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:34:38,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 10:34:38,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:39,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:34:39,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:34:39,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:39,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:40,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:40,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:34:40,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [596] L75-1-->L97-1: Formula: (let ((.cse1 (= (mod v_~d3~0_399 256) 0))) (and (let ((.cse0 (not (= (mod v_~g3~0_447 256) 0)))) (or (and .cse0 (not .cse1) (= (+ 2 v_~pos~0_1153) v_~pos~0_1152)) (and .cse1 (= (+ 2 v_~pos~0_1152) v_~pos~0_1153) .cse0))) (= |v_thread2Thread1of1ForFork1_#res.base_87| 0) (= (mod v_~g2~0_363 256) 0) (let ((.cse4 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_351| 256) 0)) (.cse2 (= (ite (= (ite .cse1 1 0) 0) 0 1) v_~d3~0_398)) (.cse3 (= (mod v_~d3~0_398 256) 0)) (.cse5 (= v_~g3~0_447 v_~g3~0_446))) (or (and (= v_~g3~0_446 0) .cse2 (not .cse3) (not .cse4)) (and .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse5))) (= |v_thread2Thread1of1ForFork1_#res.offset_87| 0))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_351|, ~g2~0=v_~g2~0_363, ~g3~0=v_~g3~0_447, ~pos~0=v_~pos~0_1153, ~d3~0=v_~d3~0_399} OutVars{~g2~0=v_~g2~0_363, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_87|, ~g3~0=v_~g3~0_446, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_87|, ~pos~0=v_~pos~0_1152, ~d3~0=v_~d3~0_398} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, thread2Thread1of1ForFork1_#res.offset, ~g3~0, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d3~0] [2022-12-13 10:34:41,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:41,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:34:41,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-13 10:34:41,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:42,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [597] L53-1-->L97-1: Formula: (let ((.cse4 (= 0 (mod v_~d3~0_403 256)))) (and (= |v_thread1Thread1of1ForFork0_#res.offset_57| 0) (let ((.cse2 (= v_~g3~0_451 v_~g3~0_450)) (.cse0 (= (ite (= (ite .cse4 1 0) 0) 0 1) v_~d3~0_402)) (.cse1 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_355| 256) 0)) (.cse3 (= (mod v_~d3~0_402 256) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 (not .cse1) (not .cse3) (= v_~g3~0_450 0)))) (= (mod v_~g1~0_591 256) 0) (= |v_thread1Thread1of1ForFork0_#res.base_57| 0) (let ((.cse5 (not (= (mod v_~g3~0_451 256) 0)))) (or (and .cse5 .cse4 (= v_~pos~0_1157 (+ 2 v_~pos~0_1156))) (and .cse5 (not .cse4) (= (+ 2 v_~pos~0_1157) v_~pos~0_1156)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_355|, ~g1~0=v_~g1~0_591, ~g3~0=v_~g3~0_451, ~pos~0=v_~pos~0_1157, ~d3~0=v_~d3~0_403} OutVars{~g1~0=v_~g1~0_591, ~g3~0=v_~g3~0_450, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_57|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_57|, ~pos~0=v_~pos~0_1156, ~d3~0=v_~d3~0_402} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, ~pos~0, ~d3~0] [2022-12-13 10:34:42,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:42,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:34:42,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L53-1-->thread1EXIT: Formula: (and (= (mod v_~g1~0_In_1 256) 0) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {~g1~0=v_~g1~0_In_1} OutVars{~g1~0=v_~g1~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:34:43,241 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 10:34:43,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24250 [2022-12-13 10:34:43,241 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 5305 transitions, 132572 flow [2022-12-13 10:34:43,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:34:43,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:34:43,242 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:34:43,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 10:34:43,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:34:43,447 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:34:43,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:34:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1748415733, now seen corresponding path program 1 times [2022-12-13 10:34:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:34:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684231700] [2022-12-13 10:34:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:34:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:34:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:34:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:34:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:34:44,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684231700] [2022-12-13 10:34:44,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684231700] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:34:44,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150169935] [2022-12-13 10:34:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:34:44,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:34:44,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:34:44,198 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:34:44,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 10:34:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:34:44,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 10:34:44,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:34:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:34:44,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:34:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:34:45,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150169935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:34:45,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:34:45,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-12-13 10:34:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604320572] [2022-12-13 10:34:45,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:34:45,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 10:34:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:34:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 10:34:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-13 10:34:45,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 89 [2022-12-13 10:34:45,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 5305 transitions, 132572 flow. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:34:45,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:34:45,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 89 [2022-12-13 10:34:45,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:35:43,388 INFO L130 PetriNetUnfolder]: 33867/50597 cut-off events. [2022-12-13 10:35:43,388 INFO L131 PetriNetUnfolder]: For 1606634/1606634 co-relation queries the response was YES. [2022-12-13 10:35:44,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556223 conditions, 50597 events. 33867/50597 cut-off events. For 1606634/1606634 co-relation queries the response was YES. Maximal size of possible extension queue 3032. Compared 372551 event pairs, 1853 based on Foata normal form. 240/50813 useless extension candidates. Maximal degree in co-relation 553869. Up to 19669 conditions per place. [2022-12-13 10:35:44,586 INFO L137 encePairwiseOnDemand]: 27/89 looper letters, 3201 selfloop transitions, 4401 changer transitions 88/7690 dead transitions. [2022-12-13 10:35:44,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 7690 transitions, 203426 flow [2022-12-13 10:35:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 10:35:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 10:35:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 389 transitions. [2022-12-13 10:35:44,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12487961476725522 [2022-12-13 10:35:44,589 INFO L175 Difference]: Start difference. First operand has 372 places, 5305 transitions, 132572 flow. Second operand 35 states and 389 transitions. [2022-12-13 10:35:44,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 7690 transitions, 203426 flow [2022-12-13 10:37:10,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 7690 transitions, 199587 flow, removed 1702 selfloop flow, removed 10 redundant places. [2022-12-13 10:37:10,874 INFO L231 Difference]: Finished difference. Result has 420 places, 7223 transitions, 193355 flow [2022-12-13 10:37:10,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=129809, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2719, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2094, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=193355, PETRI_PLACES=420, PETRI_TRANSITIONS=7223} [2022-12-13 10:37:10,878 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 394 predicate places. [2022-12-13 10:37:10,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:37:10,878 INFO L89 Accepts]: Start accepts. Operand has 420 places, 7223 transitions, 193355 flow [2022-12-13 10:37:10,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:37:10,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:37:10,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 420 places, 7223 transitions, 193355 flow [2022-12-13 10:37:11,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 419 places, 7223 transitions, 193355 flow [2022-12-13 10:37:26,183 INFO L130 PetriNetUnfolder]: 7947/15329 cut-off events. [2022-12-13 10:37:26,184 INFO L131 PetriNetUnfolder]: For 423284/425605 co-relation queries the response was YES. [2022-12-13 10:37:26,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175187 conditions, 15329 events. 7947/15329 cut-off events. For 423284/425605 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 142405 event pairs, 30 based on Foata normal form. 7/15206 useless extension candidates. Maximal degree in co-relation 174672. Up to 6558 conditions per place. [2022-12-13 10:37:26,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 7223 transitions, 193355 flow [2022-12-13 10:37:26,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 28068 [2022-12-13 10:37:26,497 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:37:26,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15623 [2022-12-13 10:37:26,501 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 7223 transitions, 193355 flow [2022-12-13 10:37:26,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:37:26,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:37:26,502 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:37:26,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 10:37:26,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 10:37:26,712 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:37:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:37:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1737912629, now seen corresponding path program 2 times [2022-12-13 10:37:26,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:37:26,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229959035] [2022-12-13 10:37:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:37:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:37:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:37:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:37:27,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229959035] [2022-12-13 10:37:27,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229959035] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:37:27,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033008010] [2022-12-13 10:37:27,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:37:27,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:37:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:37:27,496 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:37:27,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 10:37:27,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 10:37:27,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:37:27,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 10:37:27,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:37:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:27,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:37:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:37:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033008010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:37:28,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:37:28,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-12-13 10:37:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015778544] [2022-12-13 10:37:28,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:37:28,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 10:37:28,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:37:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 10:37:28,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-12-13 10:37:28,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 89 [2022-12-13 10:37:28,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 7223 transitions, 193355 flow. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:37:28,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:37:28,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 89 [2022-12-13 10:37:28,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:39:12,518 INFO L130 PetriNetUnfolder]: 38684/57648 cut-off events. [2022-12-13 10:39:12,519 INFO L131 PetriNetUnfolder]: For 2017115/2017115 co-relation queries the response was YES. [2022-12-13 10:39:13,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670221 conditions, 57648 events. 38684/57648 cut-off events. For 2017115/2017115 co-relation queries the response was YES. Maximal size of possible extension queue 3419. Compared 430684 event pairs, 1050 based on Foata normal form. 15/57627 useless extension candidates. Maximal degree in co-relation 667227. Up to 29099 conditions per place. [2022-12-13 10:39:14,075 INFO L137 encePairwiseOnDemand]: 31/89 looper letters, 3911 selfloop transitions, 4991 changer transitions 23/8925 dead transitions. [2022-12-13 10:39:14,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 8925 transitions, 253053 flow [2022-12-13 10:39:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 10:39:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-13 10:39:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 476 transitions. [2022-12-13 10:39:14,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11379392780301219 [2022-12-13 10:39:14,077 INFO L175 Difference]: Start difference. First operand has 419 places, 7223 transitions, 193355 flow. Second operand 47 states and 476 transitions. [2022-12-13 10:39:14,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 8925 transitions, 253053 flow [2022-12-13 10:41:31,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 8925 transitions, 250052 flow, removed 1460 selfloop flow, removed 3 redundant places. [2022-12-13 10:41:31,204 INFO L231 Difference]: Finished difference. Result has 482 places, 8657 transitions, 249729 flow [2022-12-13 10:41:31,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=190902, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3706, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=249729, PETRI_PLACES=482, PETRI_TRANSITIONS=8657} [2022-12-13 10:41:31,209 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 456 predicate places. [2022-12-13 10:41:31,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:41:31,209 INFO L89 Accepts]: Start accepts. Operand has 482 places, 8657 transitions, 249729 flow [2022-12-13 10:41:31,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:41:31,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:41:31,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 482 places, 8657 transitions, 249729 flow [2022-12-13 10:41:31,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 481 places, 8657 transitions, 249729 flow [2022-12-13 10:41:54,428 INFO L130 PetriNetUnfolder]: 9394/17772 cut-off events. [2022-12-13 10:41:54,428 INFO L131 PetriNetUnfolder]: For 629809/632808 co-relation queries the response was YES. [2022-12-13 10:41:54,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220850 conditions, 17772 events. 9394/17772 cut-off events. For 629809/632808 co-relation queries the response was YES. Maximal size of possible extension queue 1755. Compared 165852 event pairs, 39 based on Foata normal form. 26/17538 useless extension candidates. Maximal degree in co-relation 220319. Up to 7648 conditions per place. [2022-12-13 10:41:54,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 481 places, 8657 transitions, 249729 flow [2022-12-13 10:41:54,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 33162 [2022-12-13 10:41:54,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [504] L97-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_199 256) 0))) (and (= |v_thread3Thread1of1ForFork2_#res.offset_33| 0) (= |v_thread3Thread1of1ForFork2_#res.base_33| 0) (let ((.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_150| 256) 0)) (.cse1 (= (mod v_~d2~0_208 256) 0)) (.cse2 (= v_~g2~0_185 v_~g2~0_184))) (or (and (= v_~g2~0_184 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) (let ((.cse3 (not (= 0 (mod v_~g1~0_183 256))))) (or (and .cse3 (= v_~pos~0_454 (+ v_~pos~0_453 1)) .cse4 (= |v_thread1Thread1of1ForFork0_#t~post1_148| |v_thread1Thread1of1ForFork0_#t~post1_147|)) (and .cse3 (not .cse4) (= v_~pos~0_453 (+ v_~pos~0_454 1)) (= |v_thread1Thread1of1ForFork0_#t~post2_148| |v_thread1Thread1of1ForFork0_#t~post2_147|)))) (= (mod v_~g3~0_196 256) 0) (let ((.cse5 (= v_~g1~0_183 v_~g1~0_182)) (.cse8 (= (mod v_~d1~0_198 256) 0)) (.cse6 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_156| 256) 0)) (.cse7 (= v_~d1~0_198 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse5 .cse6 .cse7) (and .cse5 .cse7 .cse8) (and (not .cse8) (not .cse6) .cse7 (= v_~g1~0_182 0)))) (let ((.cse11 (= 0 (mod v_~d2~0_209 256)))) (let ((.cse9 (= v_~d2~0_208 (ite (= (ite .cse11 1 0) 0) 0 1))) (.cse10 (not (= (mod v_~g2~0_185 256) 0)))) (or (and .cse9 (= v_~pos~0_455 (+ v_~pos~0_454 2)) .cse10 .cse11) (and .cse9 (not .cse11) .cse10 (= v_~pos~0_454 (+ v_~pos~0_455 2)))))))) InVars {~g2~0=v_~g2~0_185, ~g1~0=v_~g1~0_183, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_156|, ~g3~0=v_~g3~0_196, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_148|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_148|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_150|, ~pos~0=v_~pos~0_455, ~d1~0=v_~d1~0_199, ~d2~0=v_~d2~0_209} OutVars{~g2~0=v_~g2~0_184, ~g1~0=v_~g1~0_182, ~g3~0=v_~g3~0_196, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_147|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_147|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_33|, ~pos~0=v_~pos~0_453, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_33|, ~d1~0=v_~d1~0_198, ~d2~0=v_~d2~0_208} AuxVars[v_~pos~0_454] AssignedVars[~g2~0, ~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread3Thread1of1ForFork2_#res.offset, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, thread3Thread1of1ForFork2_#res.base, ~d1~0, ~d2~0] [2022-12-13 10:41:56,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:41:57,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:41:57,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L75-1-->L97-1: Formula: (let ((.cse10 (= (mod v_~d1~0_466 256) 0)) (.cse3 (= (mod v_~d3~0_300 256) 0)) (.cse5 (+ v_~pos~0_876 2)) (.cse16 (= (mod v_~d3~0_299 256) 0))) (and (let ((.cse0 (= (mod v_~d2~0_298 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_297)) (.cse2 (not (= (mod v_~g2~0_289 256) 0)))) (or (and (= v_~pos~0_874 (+ v_~pos~0_877 2)) (not .cse0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_~pos~0_877 (+ v_~pos~0_874 2)))))) (let ((.cse4 (not (= (mod v_~g3~0_342 256) 0)))) (or (and .cse3 (= v_~pos~0_876 (+ v_~pos~0_873 2)) .cse4) (and (= v_~pos~0_873 .cse5) .cse4 (not .cse3)))) (let ((.cse6 (= v_~g1~0_449 v_~g1~0_450)) (.cse8 (= (mod v_~d1~0_465 256) 0)) (.cse7 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_465)) (.cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_421| 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse7) (and (not .cse8) .cse7 (not .cse9) (= v_~g1~0_449 0)))) (let ((.cse11 (= v_~g2~0_289 v_~g2~0_288)) (.cse12 (= (mod v_~d2~0_297 256) 0)) (.cse13 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_227| 256) 0))) (or (and .cse11 .cse12) (and .cse13 .cse11) (and (not .cse12) (= v_~g2~0_288 0) (not .cse13)))) (let ((.cse14 (= v_~d3~0_300 (ite (= (ite .cse16 1 0) 0) 0 1))) (.cse15 (= v_~g3~0_342 v_~g3~0_341))) (or (and .cse14 .cse3 .cse15) (and .cse14 .cse15 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_254| 256) 0)))) (let ((.cse17 (not (= (mod v_~g1~0_450 256) 0)))) (or (and (not .cse10) (= |v_thread1Thread1of1ForFork0_#t~post2_415| |v_thread1Thread1of1ForFork0_#t~post2_414|) (= v_~pos~0_875 (+ v_~pos~0_874 1)) .cse17) (and (= (+ v_~pos~0_875 1) v_~pos~0_874) .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_415| |v_thread1Thread1of1ForFork0_#t~post1_414|)))) (let ((.cse19 (= v_~g3~0_342 v_~g3~0_340)) (.cse20 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_252| 256) 0)) (.cse21 (= (mod v_~d3~0_298 256) 0)) (.cse18 (= v_~d3~0_298 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse18 .cse19 .cse20) (and .cse18 .cse19 .cse21) (and (not .cse20) (not .cse21) .cse18 (= v_~g3~0_340 0)))) (or (and .cse16 (= v_~pos~0_875 .cse5)) (and (= v_~pos~0_876 (+ v_~pos~0_875 2)) (not .cse16))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_254|, ~g2~0=v_~g2~0_289, ~g1~0=v_~g1~0_450, ~g3~0=v_~g3~0_341, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_421|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_415|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_415|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_227|, ~pos~0=v_~pos~0_877, ~d3~0=v_~d3~0_299, ~d1~0=v_~d1~0_466, ~d2~0=v_~d2~0_298} OutVars{~g2~0=v_~g2~0_288, ~g1~0=v_~g1~0_449, ~g3~0=v_~g3~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_414|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~pos~0=v_~pos~0_873, ~d3~0=v_~d3~0_298, ~d1~0=v_~d1~0_465, ~d2~0=v_~d2~0_297} AuxVars[v_~pos~0_874, v_~d3~0_300, v_~g3~0_342, v_~pos~0_875, |v_thread3Thread1of1ForFork2_#t~nondet5_252|, v_~pos~0_876] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d3~0, ~d1~0, ~d2~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:42:00,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L75-1-->L97-1: Formula: (let ((.cse10 (= (mod v_~d1~0_466 256) 0)) (.cse3 (= (mod v_~d3~0_300 256) 0)) (.cse5 (+ v_~pos~0_876 2)) (.cse16 (= (mod v_~d3~0_299 256) 0))) (and (let ((.cse0 (= (mod v_~d2~0_298 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_297)) (.cse2 (not (= (mod v_~g2~0_289 256) 0)))) (or (and (= v_~pos~0_874 (+ v_~pos~0_877 2)) (not .cse0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_~pos~0_877 (+ v_~pos~0_874 2)))))) (let ((.cse4 (not (= (mod v_~g3~0_342 256) 0)))) (or (and .cse3 (= v_~pos~0_876 (+ v_~pos~0_873 2)) .cse4) (and (= v_~pos~0_873 .cse5) .cse4 (not .cse3)))) (let ((.cse6 (= v_~g1~0_449 v_~g1~0_450)) (.cse8 (= (mod v_~d1~0_465 256) 0)) (.cse7 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_465)) (.cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_421| 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse7) (and (not .cse8) .cse7 (not .cse9) (= v_~g1~0_449 0)))) (let ((.cse11 (= v_~g2~0_289 v_~g2~0_288)) (.cse12 (= (mod v_~d2~0_297 256) 0)) (.cse13 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_227| 256) 0))) (or (and .cse11 .cse12) (and .cse13 .cse11) (and (not .cse12) (= v_~g2~0_288 0) (not .cse13)))) (let ((.cse14 (= v_~d3~0_300 (ite (= (ite .cse16 1 0) 0) 0 1))) (.cse15 (= v_~g3~0_342 v_~g3~0_341))) (or (and .cse14 .cse3 .cse15) (and .cse14 .cse15 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_254| 256) 0)))) (let ((.cse17 (not (= (mod v_~g1~0_450 256) 0)))) (or (and (not .cse10) (= |v_thread1Thread1of1ForFork0_#t~post2_415| |v_thread1Thread1of1ForFork0_#t~post2_414|) (= v_~pos~0_875 (+ v_~pos~0_874 1)) .cse17) (and (= (+ v_~pos~0_875 1) v_~pos~0_874) .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_415| |v_thread1Thread1of1ForFork0_#t~post1_414|)))) (let ((.cse19 (= v_~g3~0_342 v_~g3~0_340)) (.cse20 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_252| 256) 0)) (.cse21 (= (mod v_~d3~0_298 256) 0)) (.cse18 (= v_~d3~0_298 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse18 .cse19 .cse20) (and .cse18 .cse19 .cse21) (and (not .cse20) (not .cse21) .cse18 (= v_~g3~0_340 0)))) (or (and .cse16 (= v_~pos~0_875 .cse5)) (and (= v_~pos~0_876 (+ v_~pos~0_875 2)) (not .cse16))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_254|, ~g2~0=v_~g2~0_289, ~g1~0=v_~g1~0_450, ~g3~0=v_~g3~0_341, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_421|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_415|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_415|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_227|, ~pos~0=v_~pos~0_877, ~d3~0=v_~d3~0_299, ~d1~0=v_~d1~0_466, ~d2~0=v_~d2~0_298} OutVars{~g2~0=v_~g2~0_288, ~g1~0=v_~g1~0_449, ~g3~0=v_~g3~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_414|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~pos~0=v_~pos~0_873, ~d3~0=v_~d3~0_298, ~d1~0=v_~d1~0_465, ~d2~0=v_~d2~0_297} AuxVars[v_~pos~0_874, v_~d3~0_300, v_~g3~0_342, v_~pos~0_875, |v_thread3Thread1of1ForFork2_#t~nondet5_252|, v_~pos~0_876] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d3~0, ~d1~0, ~d2~0] and [610] L75-1-->L53-1: Formula: (let ((.cse0 (= (mod v_~d1~0_612 256) 0)) (.cse2 (= (mod v_~d2~0_374 256) 0)) (.cse11 (+ 2 v_~pos~0_1240))) (and (let ((.cse1 (not (= (mod v_~g1~0_618 256) 0)))) (or (and (not .cse0) (= (+ v_~pos~0_1241 1) v_~pos~0_1239) .cse1 (= |v_thread1Thread1of1ForFork0_#t~post2_571| |v_thread1Thread1of1ForFork0_#t~post2_570|)) (and (= (+ v_~pos~0_1239 1) v_~pos~0_1241) (= |v_thread1Thread1of1ForFork0_#t~post1_571| |v_thread1Thread1of1ForFork0_#t~post1_570|) .cse1 .cse0))) (= |v_thread3Thread1of1ForFork2_#res.base_103| 0) (let ((.cse3 (= v_~g2~0_394 v_~g2~0_393))) (or (and .cse2 .cse3) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_287| 256) 0) .cse3))) (let ((.cse5 (= (mod v_~d1~0_611 256) 0)) (.cse4 (= v_~g1~0_618 v_~g1~0_617)) (.cse6 (= v_~d1~0_611 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse7 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_561| 256) 0))) (or (and .cse4 .cse5 .cse6) (and (= v_~g1~0_617 0) .cse6 (not .cse5) (not .cse7)) (and .cse4 .cse6 .cse7))) (let ((.cse8 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_286| 256) 0)) (.cse9 (= (mod v_~d2~0_373 256) 0)) (.cse10 (= v_~g2~0_392 v_~g2~0_393))) (or (and (not .cse8) (= v_~g2~0_392 0) (not .cse9)) (and .cse8 .cse10) (and .cse9 .cse10))) (= |v_thread3Thread1of1ForFork2_#res.offset_103| 0) (let ((.cse12 (= (ite (= (ite .cse2 1 0) 0) 0 1) v_~d2~0_373)) (.cse13 (not (= (mod v_~g2~0_393 256) 0)))) (or (and (= .cse11 v_~pos~0_1241) (not .cse2) .cse12 .cse13) (and (= (+ 2 v_~pos~0_1241) v_~pos~0_1240) .cse2 .cse12 .cse13))) (= (mod v_~g3~0_500 256) 0) (let ((.cse15 (= (mod v_~d2~0_375 256) 0))) (let ((.cse14 (= (ite (= (ite .cse15 1 0) 0) 0 1) v_~d2~0_374))) (or (and .cse14 .cse15 (= .cse11 v_~pos~0_1242)) (and .cse14 (not .cse15) (= (+ 2 v_~pos~0_1242) v_~pos~0_1240))))))) InVars {~g2~0=v_~g2~0_394, ~g1~0=v_~g1~0_618, ~g3~0=v_~g3~0_500, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_561|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_571|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_571|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_287|, ~pos~0=v_~pos~0_1242, ~d1~0=v_~d1~0_612, ~d2~0=v_~d2~0_375} OutVars{~g2~0=v_~g2~0_392, ~g1~0=v_~g1~0_617, ~g3~0=v_~g3~0_500, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_570|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_570|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_103|, ~pos~0=v_~pos~0_1239, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_103|, ~d1~0=v_~d1~0_611, ~d2~0=v_~d2~0_373} AuxVars[|v_thread2Thread1of1ForFork1_#t~nondet4_286|, v_~d2~0_374, v_~pos~0_1241, v_~g2~0_393, v_~pos~0_1240] AssignedVars[~g2~0, ~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread3Thread1of1ForFork2_#res.offset, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, thread3Thread1of1ForFork2_#res.base, ~d1~0, ~d2~0] [2022-12-13 10:42:04,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L75-1-->L97-1: Formula: (let ((.cse10 (= (mod v_~d1~0_466 256) 0)) (.cse3 (= (mod v_~d3~0_300 256) 0)) (.cse5 (+ v_~pos~0_876 2)) (.cse16 (= (mod v_~d3~0_299 256) 0))) (and (let ((.cse0 (= (mod v_~d2~0_298 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_297)) (.cse2 (not (= (mod v_~g2~0_289 256) 0)))) (or (and (= v_~pos~0_874 (+ v_~pos~0_877 2)) (not .cse0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_~pos~0_877 (+ v_~pos~0_874 2)))))) (let ((.cse4 (not (= (mod v_~g3~0_342 256) 0)))) (or (and .cse3 (= v_~pos~0_876 (+ v_~pos~0_873 2)) .cse4) (and (= v_~pos~0_873 .cse5) .cse4 (not .cse3)))) (let ((.cse6 (= v_~g1~0_449 v_~g1~0_450)) (.cse8 (= (mod v_~d1~0_465 256) 0)) (.cse7 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_465)) (.cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_421| 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse7) (and (not .cse8) .cse7 (not .cse9) (= v_~g1~0_449 0)))) (let ((.cse11 (= v_~g2~0_289 v_~g2~0_288)) (.cse12 (= (mod v_~d2~0_297 256) 0)) (.cse13 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_227| 256) 0))) (or (and .cse11 .cse12) (and .cse13 .cse11) (and (not .cse12) (= v_~g2~0_288 0) (not .cse13)))) (let ((.cse14 (= v_~d3~0_300 (ite (= (ite .cse16 1 0) 0) 0 1))) (.cse15 (= v_~g3~0_342 v_~g3~0_341))) (or (and .cse14 .cse3 .cse15) (and .cse14 .cse15 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_254| 256) 0)))) (let ((.cse17 (not (= (mod v_~g1~0_450 256) 0)))) (or (and (not .cse10) (= |v_thread1Thread1of1ForFork0_#t~post2_415| |v_thread1Thread1of1ForFork0_#t~post2_414|) (= v_~pos~0_875 (+ v_~pos~0_874 1)) .cse17) (and (= (+ v_~pos~0_875 1) v_~pos~0_874) .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_415| |v_thread1Thread1of1ForFork0_#t~post1_414|)))) (let ((.cse19 (= v_~g3~0_342 v_~g3~0_340)) (.cse20 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_252| 256) 0)) (.cse21 (= (mod v_~d3~0_298 256) 0)) (.cse18 (= v_~d3~0_298 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse18 .cse19 .cse20) (and .cse18 .cse19 .cse21) (and (not .cse20) (not .cse21) .cse18 (= v_~g3~0_340 0)))) (or (and .cse16 (= v_~pos~0_875 .cse5)) (and (= v_~pos~0_876 (+ v_~pos~0_875 2)) (not .cse16))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_254|, ~g2~0=v_~g2~0_289, ~g1~0=v_~g1~0_450, ~g3~0=v_~g3~0_341, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_421|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_415|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_415|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_227|, ~pos~0=v_~pos~0_877, ~d3~0=v_~d3~0_299, ~d1~0=v_~d1~0_466, ~d2~0=v_~d2~0_298} OutVars{~g2~0=v_~g2~0_288, ~g1~0=v_~g1~0_449, ~g3~0=v_~g3~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_414|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~pos~0=v_~pos~0_873, ~d3~0=v_~d3~0_298, ~d1~0=v_~d1~0_465, ~d2~0=v_~d2~0_297} AuxVars[v_~pos~0_874, v_~d3~0_300, v_~g3~0_342, v_~pos~0_875, |v_thread3Thread1of1ForFork2_#t~nondet5_252|, v_~pos~0_876] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d3~0, ~d1~0, ~d2~0] and [612] L75-1-->L75-1: Formula: (let ((.cse2 (+ 2 v_~pos~0_1248)) (.cse0 (= (mod v_~d2~0_380 256) 0))) (and (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_379))) (or (and (not .cse0) .cse1 (= v_~pos~0_1247 .cse2)) (and .cse1 (= v_~pos~0_1248 (+ 2 v_~pos~0_1247)) .cse0))) (let ((.cse4 (= (mod v_~d2~0_381 256) 0))) (let ((.cse3 (= v_~d2~0_380 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse5 (not (= (mod v_~g2~0_400 256) 0)))) (or (and (= (+ 2 v_~pos~0_1249) v_~pos~0_1248) .cse3 (not .cse4) .cse5) (and .cse3 .cse4 (= v_~pos~0_1249 .cse2) .cse5)))) (let ((.cse6 (= v_~g2~0_399 v_~g2~0_400))) (or (and .cse0 .cse6) (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_293| 256) 0) .cse6))) (let ((.cse7 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_292| 256) 0)) (.cse9 (= (mod v_~d2~0_379 256) 0)) (.cse8 (= v_~g2~0_399 v_~g2~0_398))) (or (and .cse7 .cse8) (and (not .cse7) (not .cse9) (= v_~g2~0_398 0)) (and .cse9 .cse8))))) InVars {~g2~0=v_~g2~0_400, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_293|, ~pos~0=v_~pos~0_1249, ~d2~0=v_~d2~0_381} OutVars{~g2~0=v_~g2~0_398, ~pos~0=v_~pos~0_1247, ~d2~0=v_~d2~0_379} AuxVars[v_~g2~0_399, v_~d2~0_380, |v_thread2Thread1of1ForFork1_#t~nondet4_292|, v_~pos~0_1248] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:42:07,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L75-1-->L97-1: Formula: (let ((.cse10 (= (mod v_~d1~0_466 256) 0)) (.cse3 (= (mod v_~d3~0_300 256) 0)) (.cse5 (+ v_~pos~0_876 2)) (.cse16 (= (mod v_~d3~0_299 256) 0))) (and (let ((.cse0 (= (mod v_~d2~0_298 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_297)) (.cse2 (not (= (mod v_~g2~0_289 256) 0)))) (or (and (= v_~pos~0_874 (+ v_~pos~0_877 2)) (not .cse0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_~pos~0_877 (+ v_~pos~0_874 2)))))) (let ((.cse4 (not (= (mod v_~g3~0_342 256) 0)))) (or (and .cse3 (= v_~pos~0_876 (+ v_~pos~0_873 2)) .cse4) (and (= v_~pos~0_873 .cse5) .cse4 (not .cse3)))) (let ((.cse6 (= v_~g1~0_449 v_~g1~0_450)) (.cse8 (= (mod v_~d1~0_465 256) 0)) (.cse7 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_465)) (.cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_421| 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse7) (and (not .cse8) .cse7 (not .cse9) (= v_~g1~0_449 0)))) (let ((.cse11 (= v_~g2~0_289 v_~g2~0_288)) (.cse12 (= (mod v_~d2~0_297 256) 0)) (.cse13 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_227| 256) 0))) (or (and .cse11 .cse12) (and .cse13 .cse11) (and (not .cse12) (= v_~g2~0_288 0) (not .cse13)))) (let ((.cse14 (= v_~d3~0_300 (ite (= (ite .cse16 1 0) 0) 0 1))) (.cse15 (= v_~g3~0_342 v_~g3~0_341))) (or (and .cse14 .cse3 .cse15) (and .cse14 .cse15 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_254| 256) 0)))) (let ((.cse17 (not (= (mod v_~g1~0_450 256) 0)))) (or (and (not .cse10) (= |v_thread1Thread1of1ForFork0_#t~post2_415| |v_thread1Thread1of1ForFork0_#t~post2_414|) (= v_~pos~0_875 (+ v_~pos~0_874 1)) .cse17) (and (= (+ v_~pos~0_875 1) v_~pos~0_874) .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_415| |v_thread1Thread1of1ForFork0_#t~post1_414|)))) (let ((.cse19 (= v_~g3~0_342 v_~g3~0_340)) (.cse20 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_252| 256) 0)) (.cse21 (= (mod v_~d3~0_298 256) 0)) (.cse18 (= v_~d3~0_298 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse18 .cse19 .cse20) (and .cse18 .cse19 .cse21) (and (not .cse20) (not .cse21) .cse18 (= v_~g3~0_340 0)))) (or (and .cse16 (= v_~pos~0_875 .cse5)) (and (= v_~pos~0_876 (+ v_~pos~0_875 2)) (not .cse16))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_254|, ~g2~0=v_~g2~0_289, ~g1~0=v_~g1~0_450, ~g3~0=v_~g3~0_341, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_421|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_415|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_415|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_227|, ~pos~0=v_~pos~0_877, ~d3~0=v_~d3~0_299, ~d1~0=v_~d1~0_466, ~d2~0=v_~d2~0_298} OutVars{~g2~0=v_~g2~0_288, ~g1~0=v_~g1~0_449, ~g3~0=v_~g3~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_414|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~pos~0=v_~pos~0_873, ~d3~0=v_~d3~0_298, ~d1~0=v_~d1~0_465, ~d2~0=v_~d2~0_297} AuxVars[v_~pos~0_874, v_~d3~0_300, v_~g3~0_342, v_~pos~0_875, |v_thread3Thread1of1ForFork2_#t~nondet5_252|, v_~pos~0_876] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d3~0, ~d1~0, ~d2~0] and [613] L75-1-->L97-1: Formula: (let ((.cse1 (+ 2 v_~pos~0_1254)) (.cse2 (= (mod v_~d3~0_451 256) 0))) (and (let ((.cse0 (not (= (mod v_~g3~0_503 256) 0)))) (or (and .cse0 (= .cse1 v_~pos~0_1253) (not .cse2)) (and .cse2 .cse0 (= (+ 2 v_~pos~0_1253) v_~pos~0_1254)))) (let ((.cse3 (= (mod v_~d2~0_386 256) 0))) (let ((.cse4 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_385)) (.cse5 (not (= (mod v_~g2~0_405 256) 0)))) (or (and (not .cse3) .cse4 .cse5 (= (+ 2 v_~pos~0_1255) v_~pos~0_1254)) (and (= .cse1 v_~pos~0_1255) .cse4 .cse3 .cse5)))) (let ((.cse7 (= v_~g2~0_405 v_~g2~0_404)) (.cse8 (= (mod v_~d2~0_385 256) 0)) (.cse6 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_298| 256) 0))) (or (and .cse6 .cse7) (and .cse8 .cse7) (and (not .cse8) (= v_~g2~0_404 0) (not .cse6)))) (let ((.cse10 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_399| 256) 0)) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) v_~d3~0_450)) (.cse12 (= v_~g3~0_503 v_~g3~0_502)) (.cse11 (= (mod v_~d3~0_450 256) 0))) (or (and .cse9 (not .cse10) (= v_~g3~0_502 0) (not .cse11)) (and .cse9 .cse12 .cse10) (and .cse9 .cse12 .cse11))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_399|, ~g2~0=v_~g2~0_405, ~g3~0=v_~g3~0_503, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_298|, ~pos~0=v_~pos~0_1255, ~d3~0=v_~d3~0_451, ~d2~0=v_~d2~0_386} OutVars{~g2~0=v_~g2~0_404, ~g3~0=v_~g3~0_502, ~pos~0=v_~pos~0_1253, ~d3~0=v_~d3~0_450, ~d2~0=v_~d2~0_385} AuxVars[v_~pos~0_1254] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d3~0, ~d2~0] [2022-12-13 10:42:10,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L75-1-->L97-1: Formula: (let ((.cse10 (= (mod v_~d1~0_466 256) 0)) (.cse3 (= (mod v_~d3~0_300 256) 0)) (.cse5 (+ v_~pos~0_876 2)) (.cse16 (= (mod v_~d3~0_299 256) 0))) (and (let ((.cse0 (= (mod v_~d2~0_298 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_297)) (.cse2 (not (= (mod v_~g2~0_289 256) 0)))) (or (and (= v_~pos~0_874 (+ v_~pos~0_877 2)) (not .cse0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_~pos~0_877 (+ v_~pos~0_874 2)))))) (let ((.cse4 (not (= (mod v_~g3~0_342 256) 0)))) (or (and .cse3 (= v_~pos~0_876 (+ v_~pos~0_873 2)) .cse4) (and (= v_~pos~0_873 .cse5) .cse4 (not .cse3)))) (let ((.cse6 (= v_~g1~0_449 v_~g1~0_450)) (.cse8 (= (mod v_~d1~0_465 256) 0)) (.cse7 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_465)) (.cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_421| 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse7) (and (not .cse8) .cse7 (not .cse9) (= v_~g1~0_449 0)))) (let ((.cse11 (= v_~g2~0_289 v_~g2~0_288)) (.cse12 (= (mod v_~d2~0_297 256) 0)) (.cse13 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_227| 256) 0))) (or (and .cse11 .cse12) (and .cse13 .cse11) (and (not .cse12) (= v_~g2~0_288 0) (not .cse13)))) (let ((.cse14 (= v_~d3~0_300 (ite (= (ite .cse16 1 0) 0) 0 1))) (.cse15 (= v_~g3~0_342 v_~g3~0_341))) (or (and .cse14 .cse3 .cse15) (and .cse14 .cse15 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_254| 256) 0)))) (let ((.cse17 (not (= (mod v_~g1~0_450 256) 0)))) (or (and (not .cse10) (= |v_thread1Thread1of1ForFork0_#t~post2_415| |v_thread1Thread1of1ForFork0_#t~post2_414|) (= v_~pos~0_875 (+ v_~pos~0_874 1)) .cse17) (and (= (+ v_~pos~0_875 1) v_~pos~0_874) .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_415| |v_thread1Thread1of1ForFork0_#t~post1_414|)))) (let ((.cse19 (= v_~g3~0_342 v_~g3~0_340)) (.cse20 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_252| 256) 0)) (.cse21 (= (mod v_~d3~0_298 256) 0)) (.cse18 (= v_~d3~0_298 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse18 .cse19 .cse20) (and .cse18 .cse19 .cse21) (and (not .cse20) (not .cse21) .cse18 (= v_~g3~0_340 0)))) (or (and .cse16 (= v_~pos~0_875 .cse5)) (and (= v_~pos~0_876 (+ v_~pos~0_875 2)) (not .cse16))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_254|, ~g2~0=v_~g2~0_289, ~g1~0=v_~g1~0_450, ~g3~0=v_~g3~0_341, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_421|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_415|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_415|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_227|, ~pos~0=v_~pos~0_877, ~d3~0=v_~d3~0_299, ~d1~0=v_~d1~0_466, ~d2~0=v_~d2~0_298} OutVars{~g2~0=v_~g2~0_288, ~g1~0=v_~g1~0_449, ~g3~0=v_~g3~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_414|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~pos~0=v_~pos~0_873, ~d3~0=v_~d3~0_298, ~d1~0=v_~d1~0_465, ~d2~0=v_~d2~0_297} AuxVars[v_~pos~0_874, v_~d3~0_300, v_~g3~0_342, v_~pos~0_875, |v_thread3Thread1of1ForFork2_#t~nondet5_252|, v_~pos~0_876] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d3~0, ~d1~0, ~d2~0] and [614] L75-1-->L53-1: Formula: (let ((.cse0 (= (mod v_~d1~0_616 256) 0))) (and (let ((.cse1 (not (= 0 (mod v_~g1~0_622 256))))) (or (and (not .cse0) .cse1 (= |v_thread1Thread1of1ForFork0_#t~post2_575| |v_thread1Thread1of1ForFork0_#t~post2_574|) (= (+ v_~pos~0_1260 1) v_~pos~0_1259)) (and .cse1 (= v_~pos~0_1260 (+ v_~pos~0_1259 1)) .cse0 (= |v_thread1Thread1of1ForFork0_#t~post1_575| |v_thread1Thread1of1ForFork0_#t~post1_574|)))) (let ((.cse3 (= (mod v_~d2~0_390 256) 0))) (let ((.cse2 (not (= (mod v_~g2~0_409 256) 0))) (.cse4 (= (ite (= (ite .cse3 1 0) 0) 0 1) v_~d2~0_389))) (or (and .cse2 (not .cse3) .cse4 (= v_~pos~0_1260 (+ 2 v_~pos~0_1261))) (and .cse2 (= v_~pos~0_1261 (+ 2 v_~pos~0_1260)) .cse3 .cse4)))) (let ((.cse6 (= (mod v_~d2~0_389 256) 0)) (.cse7 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_302| 256) 0)) (.cse5 (= v_~g2~0_408 v_~g2~0_409))) (or (and .cse5 .cse6) (and (= v_~g2~0_408 0) (not .cse7) (not .cse6)) (and .cse7 .cse5))) (let ((.cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_565| 256) 0)) (.cse8 (= v_~g1~0_622 v_~g1~0_621)) (.cse11 (= (mod v_~d1~0_615 256) 0)) (.cse10 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d1~0_615))) (or (and .cse8 .cse9 .cse10) (and (not .cse11) (= v_~g1~0_621 0) (not .cse9) .cse10) (and .cse8 .cse11 .cse10))))) InVars {~g2~0=v_~g2~0_409, ~g1~0=v_~g1~0_622, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_565|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_575|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_575|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_302|, ~pos~0=v_~pos~0_1261, ~d1~0=v_~d1~0_616, ~d2~0=v_~d2~0_390} OutVars{~g2~0=v_~g2~0_408, ~g1~0=v_~g1~0_621, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_574|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_574|, ~pos~0=v_~pos~0_1259, ~d1~0=v_~d1~0_615, ~d2~0=v_~d2~0_389} AuxVars[v_~pos~0_1260] AssignedVars[~g2~0, ~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d1~0, ~d2~0] [2022-12-13 10:42:18,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L75-1-->L97-1: Formula: (let ((.cse10 (= (mod v_~d1~0_466 256) 0)) (.cse3 (= (mod v_~d3~0_300 256) 0)) (.cse5 (+ v_~pos~0_876 2)) (.cse16 (= (mod v_~d3~0_299 256) 0))) (and (let ((.cse0 (= (mod v_~d2~0_298 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_297)) (.cse2 (not (= (mod v_~g2~0_289 256) 0)))) (or (and (= v_~pos~0_874 (+ v_~pos~0_877 2)) (not .cse0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_~pos~0_877 (+ v_~pos~0_874 2)))))) (let ((.cse4 (not (= (mod v_~g3~0_342 256) 0)))) (or (and .cse3 (= v_~pos~0_876 (+ v_~pos~0_873 2)) .cse4) (and (= v_~pos~0_873 .cse5) .cse4 (not .cse3)))) (let ((.cse6 (= v_~g1~0_449 v_~g1~0_450)) (.cse8 (= (mod v_~d1~0_465 256) 0)) (.cse7 (= (ite (= (ite .cse10 1 0) 0) 0 1) v_~d1~0_465)) (.cse9 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_421| 256) 0))) (or (and .cse6 .cse7 .cse8) (and .cse6 .cse9 .cse7) (and (not .cse8) .cse7 (not .cse9) (= v_~g1~0_449 0)))) (let ((.cse11 (= v_~g2~0_289 v_~g2~0_288)) (.cse12 (= (mod v_~d2~0_297 256) 0)) (.cse13 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_227| 256) 0))) (or (and .cse11 .cse12) (and .cse13 .cse11) (and (not .cse12) (= v_~g2~0_288 0) (not .cse13)))) (let ((.cse14 (= v_~d3~0_300 (ite (= (ite .cse16 1 0) 0) 0 1))) (.cse15 (= v_~g3~0_342 v_~g3~0_341))) (or (and .cse14 .cse3 .cse15) (and .cse14 .cse15 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_254| 256) 0)))) (let ((.cse17 (not (= (mod v_~g1~0_450 256) 0)))) (or (and (not .cse10) (= |v_thread1Thread1of1ForFork0_#t~post2_415| |v_thread1Thread1of1ForFork0_#t~post2_414|) (= v_~pos~0_875 (+ v_~pos~0_874 1)) .cse17) (and (= (+ v_~pos~0_875 1) v_~pos~0_874) .cse10 .cse17 (= |v_thread1Thread1of1ForFork0_#t~post1_415| |v_thread1Thread1of1ForFork0_#t~post1_414|)))) (let ((.cse19 (= v_~g3~0_342 v_~g3~0_340)) (.cse20 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_252| 256) 0)) (.cse21 (= (mod v_~d3~0_298 256) 0)) (.cse18 (= v_~d3~0_298 (ite (= (ite .cse3 1 0) 0) 0 1)))) (or (and .cse18 .cse19 .cse20) (and .cse18 .cse19 .cse21) (and (not .cse20) (not .cse21) .cse18 (= v_~g3~0_340 0)))) (or (and .cse16 (= v_~pos~0_875 .cse5)) (and (= v_~pos~0_876 (+ v_~pos~0_875 2)) (not .cse16))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_254|, ~g2~0=v_~g2~0_289, ~g1~0=v_~g1~0_450, ~g3~0=v_~g3~0_341, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_421|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_415|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_415|, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_227|, ~pos~0=v_~pos~0_877, ~d3~0=v_~d3~0_299, ~d1~0=v_~d1~0_466, ~d2~0=v_~d2~0_298} OutVars{~g2~0=v_~g2~0_288, ~g1~0=v_~g1~0_449, ~g3~0=v_~g3~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_414|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_414|, ~pos~0=v_~pos~0_873, ~d3~0=v_~d3~0_298, ~d1~0=v_~d1~0_465, ~d2~0=v_~d2~0_297} AuxVars[v_~pos~0_874, v_~d3~0_300, v_~g3~0_342, v_~pos~0_875, |v_thread3Thread1of1ForFork2_#t~nondet5_252|, v_~pos~0_876] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#t~nondet5, ~g1~0, ~g3~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d3~0, ~d1~0, ~d2~0] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:22,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:22,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:22,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:42:22,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-13 10:42:22,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-13 10:42:22,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:23,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:42:23,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:23,653 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:23,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:42:24,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:24,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-13 10:42:24,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (= (mod v_~g3~0_In_5 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~g3~0=v_~g3~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, ~g3~0=v_~g3~0_In_5, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] [2022-12-13 10:42:24,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-13 10:42:24,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_2| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_2| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_2|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:25,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-13 10:42:26,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_123 256) 0)) (.cse1 (+ v_~pos~0_257 2)) (.cse4 (= (mod v_~d3~0_122 256) 0))) (and (or (and .cse0 (= v_~pos~0_258 .cse1)) (and (= (+ v_~pos~0_258 2) v_~pos~0_257) (not .cse0))) (let ((.cse2 (= v_~g3~0_103 v_~g3~0_102)) (.cse3 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d3~0_122))) (or (and (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_83| 256) 0) .cse2 .cse3) (and .cse4 .cse2 .cse3))) (let ((.cse7 (= (mod |v_thread3Thread1of1ForFork2_#t~nondet5_82| 256) 0)) (.cse8 (= v_~g3~0_102 v_~g3~0_101)) (.cse5 (= v_~d3~0_121 (ite (= (ite .cse4 1 0) 0) 0 1))) (.cse6 (= (mod v_~d3~0_121 256) 0))) (or (and .cse5 (= v_~g3~0_101 0) (not .cse6) (not .cse7)) (and .cse8 .cse5 .cse7) (and .cse8 .cse5 .cse6))) (let ((.cse9 (not (= (mod v_~g3~0_102 256) 0)))) (or (and .cse9 .cse4 (= v_~pos~0_257 (+ v_~pos~0_256 2))) (and .cse9 (= v_~pos~0_256 .cse1) (not .cse4)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_83|, ~g3~0=v_~g3~0_103, ~pos~0=v_~pos~0_258, ~d3~0=v_~d3~0_123} OutVars{~g3~0=v_~g3~0_101, ~pos~0=v_~pos~0_256, ~d3~0=v_~d3~0_121} AuxVars[v_~pos~0_257, v_~d3~0_122, v_~g3~0_102, |v_thread3Thread1of1ForFork2_#t~nondet5_82|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:42:27,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-13 10:42:28,387 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 10:42:28,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57189 [2022-12-13 10:42:28,398 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 8655 transitions, 250417 flow [2022-12-13 10:42:28,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:42:28,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:42:28,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:42:28,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 10:42:28,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:42:28,604 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:42:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:42:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash 598874513, now seen corresponding path program 1 times [2022-12-13 10:42:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:42:28,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602665772] [2022-12-13 10:42:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:42:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:42:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:42:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:42:29,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:42:29,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602665772] [2022-12-13 10:42:29,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602665772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:42:29,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554840708] [2022-12-13 10:42:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:42:29,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:42:29,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:42:29,041 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 10:42:29,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 10:42:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:42:29,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 10:42:29,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:42:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:42:29,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 10:42:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:42:29,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554840708] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 10:42:29,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 10:42:29,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-13 10:42:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539927621] [2022-12-13 10:42:29,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 10:42:29,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 10:42:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:42:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 10:42:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-13 10:42:29,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 119 [2022-12-13 10:42:29,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 8655 transitions, 250417 flow. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:42:29,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:42:29,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 119 [2022-12-13 10:42:29,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 10:43:59,706 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 10:43:59,706 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:44:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 10:44:00,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 10:44:00,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 10:44:00,724 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 0 [2022-12-13 10:44:00,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:44:00,739 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/119 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 530997 conditions, 42044 events (29342/42043 cut-off events. For 1819955/1819955 co-relation queries the response was YES. Maximal size of possible extension queue 4501. Compared 317396 event pairs, 270 based on Foata normal form. 0/46077 useless extension candidates. Maximal degree in co-relation 530856. Up to 16529 conditions per place.). [2022-12-13 10:44:00,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 10:44:00,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 10:44:00,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 10:44:00,741 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:44:00,745 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:44:00,745 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:44:00,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:44:00 BasicIcfg [2022-12-13 10:44:00,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:44:00,747 INFO L158 Benchmark]: Toolchain (without parser) took 831202.61ms. Allocated memory was 178.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 154.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 10:44:00,747 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:44:00,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.62ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 141.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 10:44:00,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.25ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 139.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 10:44:00,747 INFO L158 Benchmark]: Boogie Preprocessor took 31.51ms. Allocated memory is still 178.3MB. Free memory was 139.7MB in the beginning and 138.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:44:00,748 INFO L158 Benchmark]: RCFGBuilder took 453.12ms. Allocated memory is still 178.3MB. Free memory was 138.1MB in the beginning and 122.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 10:44:00,748 INFO L158 Benchmark]: TraceAbstraction took 830475.10ms. Allocated memory was 178.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 121.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 10:44:00,749 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 109.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.62ms. Allocated memory is still 178.3MB. Free memory was 153.8MB in the beginning and 141.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.25ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 139.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.51ms. Allocated memory is still 178.3MB. Free memory was 139.7MB in the beginning and 138.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 453.12ms. Allocated memory is still 178.3MB. Free memory was 138.1MB in the beginning and 122.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 830475.10ms. Allocated memory was 178.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 121.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 105 PlacesBefore, 26 PlacesAfterwards, 111 TransitionsBefore, 19 TransitionsAfterwards, 2958 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 45 ConcurrentYvCompositions, 10 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1823, independent: 1823, independent conditional: 1823, 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: 1482, independent: 1482, independent conditional: 0, independent unconditional: 1482, 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: 1482, independent: 1482, independent conditional: 0, independent unconditional: 1482, 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: 1482, independent: 1468, independent conditional: 0, independent unconditional: 1468, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 73, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1823, independent: 341, independent conditional: 341, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1482, unknown conditional: 1482, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1564, Positive cache size: 1564, Positive conditional cache size: 1564, 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, 23 PlacesBefore, 23 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 102 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 122 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 144 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 36 PlacesBefore, 34 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 7, independent unconditional: 5, 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: 12, independent: 12, independent conditional: 7, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 12, 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, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 36, Positive conditional cache size: 36, 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.1s, 47 PlacesBefore, 45 PlacesAfterwards, 47 TransitionsBefore, 45 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 101, independent conditional: 101, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 37, 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: 37, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 239, Positive conditional cache size: 239, 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: 18.2s, 70 PlacesBefore, 68 PlacesAfterwards, 218 TransitionsBefore, 216 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 106, 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: 106, independent: 92, independent conditional: 92, 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): 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: 0.9s, 106 PlacesBefore, 106 PlacesAfterwards, 535 TransitionsBefore, 535 TransitionsAfterwards, 2668 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: 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): 381, Positive cache size: 381, Positive conditional cache size: 381, 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, 139 PlacesBefore, 139 PlacesAfterwards, 977 TransitionsBefore, 977 TransitionsAfterwards, 4804 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, 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: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 519, Positive conditional cache size: 519, 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, 224 PlacesBefore, 221 PlacesAfterwards, 2219 TransitionsBefore, 2216 TransitionsAfterwards, 10892 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 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: 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): 524, Positive cache size: 524, Positive conditional cache size: 524, 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, 233 PlacesBefore, 233 PlacesAfterwards, 2366 TransitionsBefore, 2366 TransitionsAfterwards, 11296 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 528, Positive conditional cache size: 528, 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, 230 PlacesBefore, 230 PlacesAfterwards, 2026 TransitionsBefore, 2026 TransitionsAfterwards, 8450 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): 528, Positive cache size: 528, Positive conditional cache size: 528, 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, 222 PlacesBefore, 222 PlacesAfterwards, 1811 TransitionsBefore, 1811 TransitionsAfterwards, 7762 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): 528, Positive cache size: 528, Positive conditional cache size: 528, 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, 223 PlacesBefore, 223 PlacesAfterwards, 1830 TransitionsBefore, 1830 TransitionsAfterwards, 7684 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): 528, Positive cache size: 528, Positive conditional cache size: 528, 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.3s, 265 PlacesBefore, 265 PlacesAfterwards, 2661 TransitionsBefore, 2661 TransitionsAfterwards, 11032 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 17, independent: 11, independent conditional: 11, 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): 603, Positive cache size: 603, Positive conditional cache size: 603, 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.4s, 303 PlacesBefore, 303 PlacesAfterwards, 4068 TransitionsBefore, 4068 TransitionsAfterwards, 17462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 13, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 608, Positive cache size: 608, Positive conditional cache size: 608, 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.4s, 376 PlacesBefore, 372 PlacesAfterwards, 5309 TransitionsBefore, 5305 TransitionsAfterwards, 22278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 113, independent conditional: 113, 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: 49, independent: 49, independent conditional: 49, 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: 49, independent: 49, independent conditional: 49, 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: 49, independent: 49, independent conditional: 0, independent unconditional: 49, 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: 113, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 49, unknown conditional: 49, 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, 419 PlacesBefore, 419 PlacesAfterwards, 7223 TransitionsBefore, 7223 TransitionsAfterwards, 28068 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: 33.6s, 481 PlacesBefore, 479 PlacesAfterwards, 8657 TransitionsBefore, 8655 TransitionsAfterwards, 33162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 929, Positive cache size: 929, Positive conditional cache size: 929, 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: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/119 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 530997 conditions, 42044 events (29342/42043 cut-off events. For 1819955/1819955 co-relation queries the response was YES. Maximal size of possible extension queue 4501. Compared 317396 event pairs, 270 based on Foata normal form. 0/46077 useless extension candidates. Maximal degree in co-relation 530856. Up to 16529 conditions per place.). - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/119 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 530997 conditions, 42044 events (29342/42043 cut-off events. For 1819955/1819955 co-relation queries the response was YES. Maximal size of possible extension queue 4501. Compared 317396 event pairs, 270 based on Foata normal form. 0/46077 useless extension candidates. Maximal degree in co-relation 530856. Up to 16529 conditions per place.). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/119 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 530997 conditions, 42044 events (29342/42043 cut-off events. For 1819955/1819955 co-relation queries the response was YES. Maximal size of possible extension queue 4501. Compared 317396 event pairs, 270 based on Foata normal form. 0/46077 useless extension candidates. Maximal degree in co-relation 530856. Up to 16529 conditions per place.). - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 0/119 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 530997 conditions, 42044 events (29342/42043 cut-off events. For 1819955/1819955 co-relation queries the response was YES. Maximal size of possible extension queue 4501. Compared 317396 event pairs, 270 based on Foata normal form. 0/46077 useless extension candidates. Maximal degree in co-relation 530856. Up to 16529 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 4 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: 830.3s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 647.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5057 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5057 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12459 IncrementalHoareTripleChecker+Invalid, 16798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4339 mSolverCounterUnsat, 0 mSDtfsCounter, 12459 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1000 GetRequests, 453 SyntacticMatches, 25 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7413 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250417occurred in iteration=19, InterpolantAutomatonStates: 405, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 683 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 945 ConstructedInterpolants, 0 QuantifiedInterpolants, 11612 SizeOfPredicates, 154 NumberOfNonLiveVariables, 2918 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 54 InterpolantComputations, 3 PerfectInterpolantSequences, 28/153 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