/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 02:23:03,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 02:23:03,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 02:23:03,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 02:23:03,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 02:23:03,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 02:23:03,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 02:23:03,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 02:23:03,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 02:23:03,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 02:23:03,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 02:23:03,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 02:23:03,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 02:23:03,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 02:23:03,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 02:23:03,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 02:23:03,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 02:23:03,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 02:23:03,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 02:23:03,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 02:23:03,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 02:23:03,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 02:23:03,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 02:23:03,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 02:23:03,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 02:23:03,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 02:23:03,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 02:23:03,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 02:23:03,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 02:23:03,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 02:23:03,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 02:23:03,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 02:23:03,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 02:23:03,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 02:23:03,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 02:23:03,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 02:23:03,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 02:23:03,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 02:23:03,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 02:23:03,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 02:23:03,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 02:23:04,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 02:23:04,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 02:23:04,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 02:23:04,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 02:23:04,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 02:23:04,030 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 02:23:04,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 02:23:04,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 02:23:04,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 02:23:04,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 02:23:04,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 02:23:04,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 02:23:04,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 02:23:04,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 02:23:04,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:23:04,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 02:23:04,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 02:23:04,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 02:23:04,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 02:23:04,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 02:23:04,033 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 02:23:04,033 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 02:23:04,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 02:23:04,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 02:23:04,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 02:23:04,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 02:23:04,295 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 02:23:04,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-13 02:23:05,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 02:23:05,444 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 02:23:05,444 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-12-13 02:23:05,452 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3552b1b/b3c9acedd0a8441bbba089dd844741a7/FLAG570dfce8b [2022-12-13 02:23:05,471 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3552b1b/b3c9acedd0a8441bbba089dd844741a7 [2022-12-13 02:23:05,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 02:23:05,474 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 02:23:05,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 02:23:05,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 02:23:05,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 02:23:05,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f99a8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05, skipping insertion in model container [2022-12-13 02:23:05,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 02:23:05,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 02:23:05,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,647 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/popl20-two-queue.wvr.c[2987,3000] [2022-12-13 02:23:05,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:23:05,663 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 02:23:05,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 02:23:05,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 02:23:05,708 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/popl20-two-queue.wvr.c[2987,3000] [2022-12-13 02:23:05,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 02:23:05,723 INFO L208 MainTranslator]: Completed translation [2022-12-13 02:23:05,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05 WrapperNode [2022-12-13 02:23:05,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 02:23:05,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 02:23:05,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 02:23:05,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 02:23:05,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,775 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-12-13 02:23:05,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 02:23:05,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 02:23:05,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 02:23:05,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 02:23:05,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,812 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 02:23:05,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 02:23:05,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 02:23:05,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 02:23:05,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (1/1) ... [2022-12-13 02:23:05,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 02:23:05,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:23:05,847 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 02:23:05,864 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 02:23:05,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 02:23:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 02:23:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 02:23:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 02:23:05,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 02:23:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 02:23:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 02:23:05,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 02:23:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 02:23:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 02:23:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 02:23:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 02:23:05,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 02:23:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 02:23:05,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 02:23:05,879 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 02:23:06,021 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 02:23:06,022 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 02:23:06,309 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 02:23:06,378 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 02:23:06,378 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 02:23:06,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:23:06 BoogieIcfgContainer [2022-12-13 02:23:06,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 02:23:06,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 02:23:06,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 02:23:06,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 02:23:06,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:23:05" (1/3) ... [2022-12-13 02:23:06,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b7265d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:23:06, skipping insertion in model container [2022-12-13 02:23:06,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:23:05" (2/3) ... [2022-12-13 02:23:06,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b7265d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:23:06, skipping insertion in model container [2022-12-13 02:23:06,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:23:06" (3/3) ... [2022-12-13 02:23:06,387 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-12-13 02:23:06,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 02:23:06,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 02:23:06,403 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 02:23:06,469 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 02:23:06,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 163 transitions, 342 flow [2022-12-13 02:23:06,603 INFO L130 PetriNetUnfolder]: 13/161 cut-off events. [2022-12-13 02:23:06,604 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:23:06,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 161 events. 13/161 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 02:23:06,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 163 transitions, 342 flow [2022-12-13 02:23:06,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 153 transitions, 318 flow [2022-12-13 02:23:06,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:06,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 02:23:06,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 153 transitions, 318 flow [2022-12-13 02:23:06,698 INFO L130 PetriNetUnfolder]: 13/153 cut-off events. [2022-12-13 02:23:06,698 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:23:06,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 153 events. 13/153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 02:23:06,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 153 transitions, 318 flow [2022-12-13 02:23:06,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 02:23:12,386 INFO L241 LiptonReduction]: Total number of compositions: 134 [2022-12-13 02:23:12,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 02:23:12,403 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;@740b6cb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 02:23:12,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 02:23:12,408 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-13 02:23:12,408 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 02:23:12,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:12,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:12,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -737479510, now seen corresponding path program 1 times [2022-12-13 02:23:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:12,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145908156] [2022-12-13 02:23:12,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:12,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145908156] [2022-12-13 02:23:12,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145908156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:12,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:12,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 02:23:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303610378] [2022-12-13 02:23:12,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:12,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:23:12,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:12,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:23:12,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:23:12,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:23:12,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:12,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:12,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:23:12,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:12,851 INFO L130 PetriNetUnfolder]: 81/147 cut-off events. [2022-12-13 02:23:12,851 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 02:23:12,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 424 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2022-12-13 02:23:12,854 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-13 02:23:12,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2022-12-13 02:23:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:23:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:23:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 02:23:12,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-13 02:23:12,866 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 32 transitions. [2022-12-13 02:23:12,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2022-12-13 02:23:12,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 02:23:12,871 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2022-12-13 02:23:12,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2022-12-13 02:23:12,875 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2022-12-13 02:23:12,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:12,876 INFO L89 Accepts]: Start accepts. Operand has 21 places, 21 transitions, 61 flow [2022-12-13 02:23:12,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:12,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:12,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-13 02:23:12,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 21 transitions, 61 flow [2022-12-13 02:23:12,885 INFO L130 PetriNetUnfolder]: 7/31 cut-off events. [2022-12-13 02:23:12,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 02:23:12,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 31 events. 7/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 22. Up to 8 conditions per place. [2022-12-13 02:23:12,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 21 transitions, 61 flow [2022-12-13 02:23:12,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 02:23:12,900 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:23:12,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 02:23:12,901 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2022-12-13 02:23:12,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:12,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:12,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 02:23:12,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1426168016, now seen corresponding path program 1 times [2022-12-13 02:23:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:12,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549764916] [2022-12-13 02:23:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:12,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:12,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549764916] [2022-12-13 02:23:12,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549764916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:12,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:12,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840748716] [2022-12-13 02:23:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:12,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:23:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:23:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:23:12,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:23:12,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:12,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:12,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:23:12,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,079 INFO L130 PetriNetUnfolder]: 77/143 cut-off events. [2022-12-13 02:23:13,079 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 02:23:13,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 143 events. 77/143 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 428 event pairs, 11 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 114. Up to 88 conditions per place. [2022-12-13 02:23:13,080 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 7 changer transitions 5/39 dead transitions. [2022-12-13 02:23:13,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 39 transitions, 185 flow [2022-12-13 02:23:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:23:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:23:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-13 02:23:13,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 02:23:13,083 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 4 states and 40 transitions. [2022-12-13 02:23:13,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 39 transitions, 185 flow [2022-12-13 02:23:13,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 39 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 02:23:13,084 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 99 flow [2022-12-13 02:23:13,084 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-13 02:23:13,085 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2022-12-13 02:23:13,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,085 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 99 flow [2022-12-13 02:23:13,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-13 02:23:13,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 99 flow [2022-12-13 02:23:13,092 INFO L130 PetriNetUnfolder]: 14/46 cut-off events. [2022-12-13 02:23:13,092 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-13 02:23:13,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 46 events. 14/46 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 111 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 64. Up to 15 conditions per place. [2022-12-13 02:23:13,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 99 flow [2022-12-13 02:23:13,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 02:23:13,104 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:23:13,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 02:23:13,105 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 99 flow [2022-12-13 02:23:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:13,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:13,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:13,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 02:23:13,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:13,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1982189810, now seen corresponding path program 2 times [2022-12-13 02:23:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:13,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751569806] [2022-12-13 02:23:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751569806] [2022-12-13 02:23:13,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751569806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:13,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:13,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517721352] [2022-12-13 02:23:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:13,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:23:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:23:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:23:13,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:23:13,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:13,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:13,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:23:13,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,278 INFO L130 PetriNetUnfolder]: 88/162 cut-off events. [2022-12-13 02:23:13,279 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 02:23:13,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 162 events. 88/162 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 13 based on Foata normal form. 10/170 useless extension candidates. Maximal degree in co-relation 169. Up to 86 conditions per place. [2022-12-13 02:23:13,280 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 32 selfloop transitions, 7 changer transitions 6/45 dead transitions. [2022-12-13 02:23:13,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 45 transitions, 244 flow [2022-12-13 02:23:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:23:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:23:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-13 02:23:13,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-13 02:23:13,282 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 99 flow. Second operand 5 states and 45 transitions. [2022-12-13 02:23:13,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 45 transitions, 244 flow [2022-12-13 02:23:13,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 02:23:13,283 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 122 flow [2022-12-13 02:23:13,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2022-12-13 02:23:13,284 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 8 predicate places. [2022-12-13 02:23:13,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,284 INFO L89 Accepts]: Start accepts. Operand has 30 places, 26 transitions, 122 flow [2022-12-13 02:23:13,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-13 02:23:13,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 122 flow [2022-12-13 02:23:13,291 INFO L130 PetriNetUnfolder]: 17/53 cut-off events. [2022-12-13 02:23:13,292 INFO L131 PetriNetUnfolder]: For 23/26 co-relation queries the response was YES. [2022-12-13 02:23:13,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 53 events. 17/53 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 131 event pairs, 2 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 105. Up to 15 conditions per place. [2022-12-13 02:23:13,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 122 flow [2022-12-13 02:23:13,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 02:23:13,293 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:23:13,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 02:23:13,294 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 122 flow [2022-12-13 02:23:13,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:13,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:13,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:13,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 02:23:13,295 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash 552214239, now seen corresponding path program 1 times [2022-12-13 02:23:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:13,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411994875] [2022-12-13 02:23:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:13,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411994875] [2022-12-13 02:23:13,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411994875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:13,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:13,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:23:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974078120] [2022-12-13 02:23:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:13,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:23:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:23:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:23:13,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:23:13,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:13,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:13,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:23:13,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:13,470 INFO L130 PetriNetUnfolder]: 84/167 cut-off events. [2022-12-13 02:23:13,470 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-13 02:23:13,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 167 events. 84/167 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 46 based on Foata normal form. 10/174 useless extension candidates. Maximal degree in co-relation 267. Up to 150 conditions per place. [2022-12-13 02:23:13,471 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 25 selfloop transitions, 2 changer transitions 11/38 dead transitions. [2022-12-13 02:23:13,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 242 flow [2022-12-13 02:23:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:23:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:23:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 02:23:13,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-13 02:23:13,473 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 122 flow. Second operand 4 states and 33 transitions. [2022-12-13 02:23:13,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 242 flow [2022-12-13 02:23:13,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 229 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 02:23:13,476 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 130 flow [2022-12-13 02:23:13,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-12-13 02:23:13,477 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2022-12-13 02:23:13,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:13,478 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 130 flow [2022-12-13 02:23:13,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:13,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:13,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 130 flow [2022-12-13 02:23:13,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 130 flow [2022-12-13 02:23:13,488 INFO L130 PetriNetUnfolder]: 20/59 cut-off events. [2022-12-13 02:23:13,488 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-13 02:23:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 59 events. 20/59 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 154 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 132. Up to 17 conditions per place. [2022-12-13 02:23:13,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 130 flow [2022-12-13 02:23:13,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:23:13,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:13,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-13 02:23:13,823 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 126 flow [2022-12-13 02:23:13,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:13,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:13,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:13,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 02:23:13,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:13,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1761523476, now seen corresponding path program 1 times [2022-12-13 02:23:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:13,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064545637] [2022-12-13 02:23:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:13,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064545637] [2022-12-13 02:23:13,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064545637] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:23:13,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34113656] [2022-12-13 02:23:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:13,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:23:13,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:23:13,875 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 02:23:13,916 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 02:23:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:13,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 02:23:13,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:23:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:14,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:23:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:14,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34113656] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:23:14,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:23:14,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 02:23:14,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519378705] [2022-12-13 02:23:14,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:23:14,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:23:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:23:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:23:14,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 02:23:14,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:14,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:14,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 02:23:14,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:14,197 INFO L130 PetriNetUnfolder]: 109/207 cut-off events. [2022-12-13 02:23:14,198 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 02:23:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 207 events. 109/207 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 682 event pairs, 2 based on Foata normal form. 8/214 useless extension candidates. Maximal degree in co-relation 662. Up to 77 conditions per place. [2022-12-13 02:23:14,199 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 47 selfloop transitions, 15 changer transitions 4/66 dead transitions. [2022-12-13 02:23:14,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 406 flow [2022-12-13 02:23:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:23:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:23:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-12-13 02:23:14,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38011695906432746 [2022-12-13 02:23:14,200 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 126 flow. Second operand 9 states and 65 transitions. [2022-12-13 02:23:14,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 66 transitions, 406 flow [2022-12-13 02:23:14,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 396 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 02:23:14,202 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 218 flow [2022-12-13 02:23:14,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-13 02:23:14,203 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2022-12-13 02:23:14,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:14,203 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 218 flow [2022-12-13 02:23:14,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:14,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:14,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-13 02:23:14,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 218 flow [2022-12-13 02:23:14,209 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2022-12-13 02:23:14,209 INFO L131 PetriNetUnfolder]: For 78/82 co-relation queries the response was YES. [2022-12-13 02:23:14,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 64 events. 19/64 cut-off events. For 78/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 172 event pairs, 2 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 179. Up to 20 conditions per place. [2022-12-13 02:23:14,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 218 flow [2022-12-13 02:23:14,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-13 02:23:14,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:23:14,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:14,543 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:23:14,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 341 [2022-12-13 02:23:14,544 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 224 flow [2022-12-13 02:23:14,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:14,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:14,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:14,549 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 02:23:14,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:23:14,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2005601282, now seen corresponding path program 2 times [2022-12-13 02:23:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:14,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085390022] [2022-12-13 02:23:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:14,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:14,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085390022] [2022-12-13 02:23:14,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085390022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:14,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:14,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:14,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599254419] [2022-12-13 02:23:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:14,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:23:14,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:23:14,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:23:14,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 02:23:14,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:14,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:14,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 02:23:14,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:14,863 INFO L130 PetriNetUnfolder]: 99/176 cut-off events. [2022-12-13 02:23:14,863 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-12-13 02:23:14,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 176 events. 99/176 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 21 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 465. Up to 150 conditions per place. [2022-12-13 02:23:14,864 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 30 selfloop transitions, 4 changer transitions 3/37 dead transitions. [2022-12-13 02:23:14,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 304 flow [2022-12-13 02:23:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:23:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:23:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 02:23:14,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 02:23:14,865 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 224 flow. Second operand 4 states and 32 transitions. [2022-12-13 02:23:14,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 304 flow [2022-12-13 02:23:14,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 276 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 02:23:14,867 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 183 flow [2022-12-13 02:23:14,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-13 02:23:14,867 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2022-12-13 02:23:14,868 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:14,868 INFO L89 Accepts]: Start accepts. Operand has 42 places, 30 transitions, 183 flow [2022-12-13 02:23:14,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:14,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:14,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 183 flow [2022-12-13 02:23:14,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 183 flow [2022-12-13 02:23:14,873 INFO L130 PetriNetUnfolder]: 19/52 cut-off events. [2022-12-13 02:23:14,873 INFO L131 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2022-12-13 02:23:14,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 52 events. 19/52 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 2 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 148. Up to 16 conditions per place. [2022-12-13 02:23:14,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 183 flow [2022-12-13 02:23:14,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 02:23:14,877 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:23:14,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 02:23:14,878 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 183 flow [2022-12-13 02:23:14,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:14,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:14,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:14,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 02:23:14,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2130273651, now seen corresponding path program 1 times [2022-12-13 02:23:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:14,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853042846] [2022-12-13 02:23:14,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:14,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:14,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853042846] [2022-12-13 02:23:14,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853042846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:23:14,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:23:14,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:23:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024045493] [2022-12-13 02:23:14,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:23:14,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:23:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:14,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:23:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:23:14,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 02:23:14,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:14,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:14,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 02:23:14,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:14,993 INFO L130 PetriNetUnfolder]: 101/185 cut-off events. [2022-12-13 02:23:14,994 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-13 02:23:14,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 185 events. 101/185 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 488 event pairs, 50 based on Foata normal form. 10/191 useless extension candidates. Maximal degree in co-relation 530. Up to 171 conditions per place. [2022-12-13 02:23:14,995 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 29 selfloop transitions, 2 changer transitions 8/39 dead transitions. [2022-12-13 02:23:14,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 287 flow [2022-12-13 02:23:14,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:23:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:23:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-13 02:23:14,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2022-12-13 02:23:14,996 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 183 flow. Second operand 4 states and 35 transitions. [2022-12-13 02:23:14,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 287 flow [2022-12-13 02:23:14,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 260 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 02:23:14,998 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 179 flow [2022-12-13 02:23:14,998 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2022-12-13 02:23:14,998 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2022-12-13 02:23:14,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:14,999 INFO L89 Accepts]: Start accepts. Operand has 37 places, 31 transitions, 179 flow [2022-12-13 02:23:14,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:14,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:14,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 179 flow [2022-12-13 02:23:15,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 179 flow [2022-12-13 02:23:15,005 INFO L130 PetriNetUnfolder]: 20/54 cut-off events. [2022-12-13 02:23:15,005 INFO L131 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2022-12-13 02:23:15,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 54 events. 20/54 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 2 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 157. Up to 17 conditions per place. [2022-12-13 02:23:15,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 31 transitions, 179 flow [2022-12-13 02:23:15,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 02:23:16,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:23:16,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1034 [2022-12-13 02:23:16,033 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 175 flow [2022-12-13 02:23:16,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:16,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:16,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:16,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 02:23:16,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash -898511417, now seen corresponding path program 1 times [2022-12-13 02:23:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:16,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43133163] [2022-12-13 02:23:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43133163] [2022-12-13 02:23:17,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43133163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:23:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116903579] [2022-12-13 02:23:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:17,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:23:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:23:17,100 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 02:23:17,119 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 02:23:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:17,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 02:23:17,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:23:17,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 02:23:17,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:23:17,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:23:17,248 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:23:17,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-12-13 02:23:17,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:23:17,301 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 02:23:17,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 02:23:17,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:23:17,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:23:17,626 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 02:23:17,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 02:23:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:17,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:23:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:18,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116903579] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:23:18,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:23:18,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-13 02:23:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179832351] [2022-12-13 02:23:18,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:23:18,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 02:23:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 02:23:18,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=659, Unknown=3, NotChecked=0, Total=756 [2022-12-13 02:23:18,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 02:23:18,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 175 flow. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:18,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:18,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 02:23:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:33,584 INFO L130 PetriNetUnfolder]: 376/671 cut-off events. [2022-12-13 02:23:33,584 INFO L131 PetriNetUnfolder]: For 1000/1000 co-relation queries the response was YES. [2022-12-13 02:23:33,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 671 events. 376/671 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3068 event pairs, 12 based on Foata normal form. 9/674 useless extension candidates. Maximal degree in co-relation 2543. Up to 191 conditions per place. [2022-12-13 02:23:33,590 INFO L137 encePairwiseOnDemand]: 6/22 looper letters, 103 selfloop transitions, 117 changer transitions 16/236 dead transitions. [2022-12-13 02:23:33,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 236 transitions, 1633 flow [2022-12-13 02:23:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 02:23:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-13 02:23:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 224 transitions. [2022-12-13 02:23:33,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23140495867768596 [2022-12-13 02:23:33,593 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 175 flow. Second operand 44 states and 224 transitions. [2022-12-13 02:23:33,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 236 transitions, 1633 flow [2022-12-13 02:23:33,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 236 transitions, 1611 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 02:23:33,601 INFO L231 Difference]: Finished difference. Result has 84 places, 137 transitions, 1123 flow [2022-12-13 02:23:33,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1123, PETRI_PLACES=84, PETRI_TRANSITIONS=137} [2022-12-13 02:23:33,602 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 62 predicate places. [2022-12-13 02:23:33,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:33,602 INFO L89 Accepts]: Start accepts. Operand has 84 places, 137 transitions, 1123 flow [2022-12-13 02:23:33,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:33,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:33,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 137 transitions, 1123 flow [2022-12-13 02:23:33,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 137 transitions, 1123 flow [2022-12-13 02:23:33,639 INFO L130 PetriNetUnfolder]: 98/256 cut-off events. [2022-12-13 02:23:33,640 INFO L131 PetriNetUnfolder]: For 526/533 co-relation queries the response was YES. [2022-12-13 02:23:33,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 256 events. 98/256 cut-off events. For 526/533 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1238 event pairs, 2 based on Foata normal form. 3/253 useless extension candidates. Maximal degree in co-relation 989. Up to 87 conditions per place. [2022-12-13 02:23:33,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 137 transitions, 1123 flow [2022-12-13 02:23:33,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-13 02:23:37,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:38,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:38,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:23:38,515 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:23:39,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [716] L65-1-->L52: Formula: (and (= v_~q1_back~0_151 (+ v_~q1_back~0_152 1)) (not (= (ite (and (<= 0 v_~q1_back~0_152) (< v_~q1_back~0_152 v_~n1~0_104)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|) (= (ite (= v_~j~0_143 (select (select |v_#memory_int_259| v_~q1~0.base_115) (+ (* v_~q1_back~0_152 4) v_~q1~0.offset_115))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (< v_~j~0_143 v_~N~0_102) (= (ite (= (select (select |v_#memory_int_259| v_~q2~0.base_97) (+ v_~q2~0.offset_97 (* 4 v_~q2_back~0_153))) v_~i~0_145) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (not (= (ite (and (< v_~q2_back~0_153 v_~n2~0_110) (<= 0 v_~q2_back~0_153)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69| 0)) (= (+ v_~q2_back~0_153 1) v_~q2_back~0_152) (< v_~i~0_145 v_~N~0_102)) InVars {~j~0=v_~j~0_143, ~q1~0.offset=v_~q1~0.offset_115, ~n2~0=v_~n2~0_110, ~i~0=v_~i~0_145, ~q1_back~0=v_~q1_back~0_152, ~q2~0.offset=v_~q2~0.offset_97, ~n1~0=v_~n1~0_104, ~q1~0.base=v_~q1~0.base_115, #memory_int=|v_#memory_int_259|, ~q2~0.base=v_~q2~0.base_97, ~N~0=v_~N~0_102, ~q2_back~0=v_~q2_back~0_153} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_33|, ~j~0=v_~j~0_143, ~q1~0.offset=v_~q1~0.offset_115, ~n2~0=v_~n2~0_110, ~i~0=v_~i~0_145, ~q2~0.offset=v_~q2~0.offset_97, ~n1~0=v_~n1~0_104, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_34|, ~N~0=v_~N~0_102, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_34|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_69|, ~q1_back~0=v_~q1_back~0_151, ~q1~0.base=v_~q1~0.base_115, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_259|, ~q2~0.base=v_~q2~0.base_97, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_33|, ~q2_back~0=v_~q2_back~0_152} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:23:39,282 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [717] L65-1-->L65-1: Formula: (and (= v_~j~0_145 (+ 1 (select (select |v_#memory_int_261| v_~q2~0.base_99) (+ v_~q2~0.offset_99 (* v_~q2_front~0_130 4))))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_67|) (not (= (ite (= v_~j~0_146 (select (select |v_#memory_int_261| v_~q1~0.base_117) (+ v_~q1~0.offset_117 (* v_~q1_back~0_156 4)))) 1 0) 0)) (< v_~j~0_146 v_~N~0_104) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67| 0)) (not (= (ite (and (< v_~q1_back~0_156 v_~n1~0_106) (<= 0 v_~q1_back~0_156)) 1 0) 0)) (= (+ v_~q1_back~0_156 1) v_~q1_back~0_155) (= (+ v_~q2_front~0_130 1) v_~q2_front~0_129) (= (ite (and (< v_~q2_front~0_130 v_~q2_back~0_156) (<= 0 v_~q2_front~0_130) (< v_~q2_front~0_130 v_~n2~0_112)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_67|)) InVars {~j~0=v_~j~0_146, ~q1~0.offset=v_~q1~0.offset_117, ~n2~0=v_~n2~0_112, ~q1_back~0=v_~q1_back~0_156, ~q2~0.offset=v_~q2~0.offset_99, ~n1~0=v_~n1~0_106, ~q1~0.base=v_~q1~0.base_117, #memory_int=|v_#memory_int_261|, ~q2_front~0=v_~q2_front~0_130, ~q2~0.base=v_~q2~0.base_99, ~N~0=v_~N~0_104, ~q2_back~0=v_~q2_back~0_156} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_42|, ~j~0=v_~j~0_145, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_36|, ~q1~0.offset=v_~q1~0.offset_117, ~n2~0=v_~n2~0_112, ~q2~0.offset=v_~q2~0.offset_99, ~n1~0=v_~n1~0_106, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_67|, ~q2_front~0=v_~q2_front~0_129, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_36|, ~N~0=v_~N~0_104, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_36|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_36|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_67|, ~q1_back~0=v_~q1_back~0_155, ~q1~0.base=v_~q1~0.base_117, #memory_int=|v_#memory_int_261|, ~q2~0.base=v_~q2~0.base_99, ~q2_back~0=v_~q2_back~0_156} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:39,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:40,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:40,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:44,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:45,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:45,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [708] L52-->L52: Formula: (and (= (+ (select (select |v_#memory_int_233| v_~q1~0.base_99) (+ v_~q1~0.offset_99 (* v_~q1_front~0_121 4))) 1) v_~i~0_133) (not (= (ite (and (< v_~q2_back~0_137 v_~n2~0_98) (<= 0 v_~q2_back~0_137)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_233| v_~q2~0.base_85) (+ v_~q2~0.offset_85 (* 4 v_~q2_back~0_137))) v_~i~0_133) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_121) (< v_~q1_front~0_121 v_~q1_back~0_131) (< v_~q1_front~0_121 v_~n1~0_90)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_120 (+ v_~q1_front~0_121 1)) (= (+ v_~q2_back~0_137 1) v_~q2_back~0_136) (< v_~i~0_133 v_~N~0_86)) InVars {~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_121, ~q1_back~0=v_~q1_back~0_131, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, ~q1~0.base=v_~q1~0.base_99, #memory_int=|v_#memory_int_233|, ~q2~0.base=v_~q2~0.base_85, ~N~0=v_~N~0_86, ~q2_back~0=v_~q2_back~0_137} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, ~q1~0.offset=v_~q1~0.offset_99, ~n2~0=v_~n2~0_98, ~q1_front~0=v_~q1_front~0_120, ~i~0=v_~i~0_133, ~q2~0.offset=v_~q2~0.offset_85, ~n1~0=v_~n1~0_90, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_35|, ~N~0=v_~N~0_86, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_59|, ~q1_back~0=v_~q1_back~0_131, ~q1~0.base=v_~q1~0.base_99, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_41|, ~q2~0.base=v_~q2~0.base_85, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_35|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_29|, ~q2_back~0=v_~q2_back~0_136} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:23:45,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:45,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [721] L70-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (not (= (ite (and (< v_~q2_front~0_138 v_~n2~0_120) (< v_~q2_front~0_138 v_~q2_back~0_168) (<= 0 v_~q2_front~0_138)) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_170 v_~n1~0_114) (<= 0 v_~q1_back~0_170)) 1 0) 0)) (= v_~j~0_155 (+ (select (select |v_#memory_int_269| v_~q2~0.base_107) (+ v_~q2~0.offset_107 (* v_~q2_front~0_138 4))) 1)) (= (+ v_~q2_front~0_138 1) v_~q2_front~0_137) (= (+ v_~q1_back~0_170 1) v_~q1_back~0_169) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= (ite (= v_~j~0_155 (select (select |v_#memory_int_269| v_~q1~0.base_125) (+ v_~q1~0.offset_125 (* v_~q1_back~0_170 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (< v_~j~0_155 v_~N~0_112)) InVars {~q1~0.offset=v_~q1~0.offset_125, ~n2~0=v_~n2~0_120, ~q1_back~0=v_~q1_back~0_170, ~n1~0=v_~n1~0_114, ~q2~0.offset=v_~q2~0.offset_107, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_269|, ~q2_front~0=v_~q2_front~0_138, ~q2~0.base=v_~q2~0.base_107, ~N~0=v_~N~0_112, ~q2_back~0=v_~q2_back~0_168} OutVars{~j~0=v_~j~0_155, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_46|, ~q1~0.offset=v_~q1~0.offset_125, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_40|, ~n2~0=v_~n2~0_120, ~n1~0=v_~n1~0_114, ~q2~0.offset=v_~q2~0.offset_107, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~q2_front~0=v_~q2_front~0_137, ~N~0=v_~N~0_112, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, ~q1_back~0=v_~q1_back~0_169, ~q1~0.base=v_~q1~0.base_125, #memory_int=|v_#memory_int_269|, ~q2~0.base=v_~q2~0.base_107, ~q2_back~0=v_~q2_back~0_168} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:45,636 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,636 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,637 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,637 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,637 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,637 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,637 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,637 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:45,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [722] L70-->L47-1: Formula: (and (= (+ (select (select |v_#memory_int_271| v_~q1~0.base_127) (+ (* v_~q1_front~0_149 4) v_~q1~0.offset_127)) 1) v_~i~0_153) (= v_~j~0_157 (+ (select (select |v_#memory_int_271| v_~q2~0.base_109) (+ v_~q2~0.offset_109 (* v_~q2_front~0_142 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= v_~q1_front~0_148 (+ v_~q1_front~0_149 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| 0)) (= (ite (and (< v_~q1_front~0_149 v_~n1~0_116) (< v_~q1_front~0_149 v_~q1_back~0_173) (<= 0 v_~q1_front~0_149)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|) (= (ite (and (< v_~q2_front~0_142 v_~n2~0_122) (< v_~q2_front~0_142 v_~q2_back~0_170) (<= 0 v_~q2_front~0_142)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= (+ v_~q2_front~0_142 1) v_~q2_front~0_141) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|)) InVars {~q1~0.offset=v_~q1~0.offset_127, ~q1_front~0=v_~q1_front~0_149, ~n2~0=v_~n2~0_122, ~q1_back~0=v_~q1_back~0_173, ~n1~0=v_~n1~0_116, ~q2~0.offset=v_~q2~0.offset_109, ~q1~0.base=v_~q1~0.base_127, #memory_int=|v_#memory_int_271|, ~q2_front~0=v_~q2_front~0_142, ~q2~0.base=v_~q2~0.base_109, ~q2_back~0=v_~q2_back~0_170} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_48|, ~j~0=v_~j~0_157, ~q1~0.offset=v_~q1~0.offset_127, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_42|, ~q1_front~0=v_~q1_front~0_148, ~n2~0=v_~n2~0_122, ~i~0=v_~i~0_153, ~n1~0=v_~n1~0_116, ~q2~0.offset=v_~q2~0.offset_109, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, ~q2_front~0=v_~q2_front~0_141, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_42|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_81|, ~q1_back~0=v_~q1_back~0_173, ~q1~0.base=v_~q1~0.base_127, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_53|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_81|, ~q2~0.base=v_~q2~0.base_109, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_47|, ~q2_back~0=v_~q2_back~0_170} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:46,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [705] L65-1-->L52: Formula: (and (= (+ v_~q1_back~0_119 1) v_~q1_back~0_118) (< v_~i~0_121 v_~N~0_76) (= (ite (= (select (select |v_#memory_int_215| v_~q2~0.base_78) (+ v_~q2~0.offset_78 (* 4 v_~q2_back~0_128))) v_~i~0_121) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~q2_back~0_128 1) v_~q2_back~0_127) (= (ite (= v_~j~0_117 (select (select |v_#memory_int_215| v_~q1~0.base_91) (+ v_~q1~0.offset_91 (* v_~q1_back~0_119 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0)) (not (= (ite (and (<= 0 v_~q1_back~0_119) (< v_~q1_back~0_119 v_~n1~0_83)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (< v_~j~0_117 v_~N~0_76) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|) (not (= (ite (and (<= 0 v_~q2_back~0_128) (< v_~q2_back~0_128 v_~n2~0_92)) 1 0) 0))) InVars {~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q1_back~0=v_~q1_back~0_119, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_91, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, ~N~0=v_~N~0_76, ~q2_back~0=v_~q2_back~0_128} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, ~j~0=v_~j~0_117, ~q1~0.offset=v_~q1~0.offset_91, ~n2~0=v_~n2~0_92, ~i~0=v_~i~0_121, ~q2~0.offset=v_~q2~0.offset_78, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_21|, ~N~0=v_~N~0_76, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_51|, ~q1_back~0=v_~q1_back~0_118, ~q1~0.base=v_~q1~0.base_91, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, #memory_int=|v_#memory_int_215|, ~q2~0.base=v_~q2~0.base_78, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~q2_back~0=v_~q2_back~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:47,300 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,300 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,300 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,300 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,301 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,301 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,301 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,301 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:47,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [741] L70-->L70: Formula: (and (< v_~j~0_191 v_~N~0_144) (= v_~q1_back~0_225 (+ v_~q1_back~0_226 1)) (= v_~j~0_191 (+ (select (select |v_#memory_int_319| v_~q2~0.base_141) (+ v_~q2~0.offset_141 (* v_~q2_front~0_182 4))) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_226) (< v_~q1_back~0_226 v_~n1~0_150)) 1 0) 0)) (not (= (ite (and (< v_~q2_front~0_182 v_~n2~0_152) (<= 0 v_~q2_front~0_182) (< v_~q2_front~0_182 v_~q2_back~0_216)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| 0)) (= (+ v_~q2_front~0_182 1) v_~q2_front~0_181) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite (= v_~j~0_191 (select (select |v_#memory_int_319| v_~q1~0.base_161) (+ (* v_~q1_back~0_226 4) v_~q1~0.offset_161))) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_161, ~n2~0=v_~n2~0_152, ~q1_back~0=v_~q1_back~0_226, ~n1~0=v_~n1~0_150, ~q2~0.offset=v_~q2~0.offset_141, ~q1~0.base=v_~q1~0.base_161, #memory_int=|v_#memory_int_319|, ~q2_front~0=v_~q2_front~0_182, ~q2~0.base=v_~q2~0.base_141, ~N~0=v_~N~0_144, ~q2_back~0=v_~q2_back~0_216} OutVars{~j~0=v_~j~0_191, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_66|, ~q1~0.offset=v_~q1~0.offset_161, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_60|, ~n2~0=v_~n2~0_152, ~n1~0=v_~n1~0_150, ~q2~0.offset=v_~q2~0.offset_141, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_62|, ~q2_front~0=v_~q2_front~0_181, ~N~0=v_~N~0_144, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_62|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_60|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|, ~q1_back~0=v_~q1_back~0_225, ~q1~0.base=v_~q1~0.base_161, #memory_int=|v_#memory_int_319|, ~q2~0.base=v_~q2~0.base_141, ~q2_back~0=v_~q2_back~0_216} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:48,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:48,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [713] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_251| v_~q1~0.base_111))) (and (not (= (ite (and (<= 0 v_~q1_back~0_144) (< v_~q1_back~0_144 v_~n1~0_100)) 1 0) 0)) (= (ite (= v_~j~0_137 (select .cse0 (+ (* v_~q1_back~0_144 4) v_~q1~0.offset_111))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (= (+ v_~q1_back~0_144 1) v_~q1_back~0_143) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (< v_~q1_front~0_133 v_~n1~0_100) (< v_~q1_front~0_133 v_~q1_back~0_143) (<= 0 v_~q1_front~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_65| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65|) (< v_~j~0_137 v_~N~0_96) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_65| 0)) (= v_~i~0_141 (+ (select .cse0 (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_111)) 1)))) InVars {~j~0=v_~j~0_137, ~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_144, ~n1~0=v_~n1~0_100, ~q1~0.base=v_~q1~0.base_111, #memory_int=|v_#memory_int_251|, ~N~0=v_~N~0_96} OutVars{~j~0=v_~j~0_137, ~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_132, ~i~0=v_~i~0_141, ~n1~0=v_~n1~0_100, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_30|, ~N~0=v_~N~0_96, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_30|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_65|, ~q1_back~0=v_~q1_back~0_143, ~q1~0.base=v_~q1~0.base_111, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_45|, #memory_int=|v_#memory_int_251|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_65|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 02:23:48,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 02:23:48,820 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:48,820 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:48,820 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:48,820 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,129 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,130 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,130 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,130 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [732] L96-4-->L47-1: Formula: (and (= (ite (and (<= 0 v_~q1_front~0_177) (< v_~q1_front~0_177 v_~q1_back~0_195) (< v_~q1_front~0_177 v_~n1~0_134)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= |v_#pthreadsForks_61| (+ |v_#pthreadsForks_62| 1)) (= (+ (select (select |v_#memory_int_299| v_~q1~0.base_145) (+ v_~q1~0.offset_145 (* v_~q1_front~0_177 4))) 1) v_~i~0_173) (= |v_#pthreadsForks_62| |v_ULTIMATE.start_main_#t~pre20#1_59|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|) (= (store |v_#memory_int_300| |v_ULTIMATE.start_main_~#t2~0#1.base_55| (store (select |v_#memory_int_300| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) |v_ULTIMATE.start_main_~#t2~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre20#1_59|)) |v_#memory_int_299|) (= (+ v_~q1_front~0_177 1) v_~q1_front~0_176)) InVars {~q1~0.offset=v_~q1~0.offset_145, ~q1_front~0=v_~q1_front~0_177, #pthreadsForks=|v_#pthreadsForks_62|, ~q1_back~0=v_~q1_back~0_195, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, ~n1~0=v_~n1~0_134, ~q1~0.base=v_~q1~0.base_145, #memory_int=|v_#memory_int_300|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_59|, ~q1~0.offset=v_~q1~0.offset_145, ~q1_front~0=v_~q1_front~0_176, ~i~0=v_~i~0_173, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_55|, ~n1~0=v_~n1~0_134, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_99|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_59|, #pthreadsForks=|v_#pthreadsForks_61|, ~q1_back~0=v_~q1_back~0_195, ~q1~0.base=v_~q1~0.base_145, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_65|, #memory_int=|v_#memory_int_299|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_59|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, ~q1_front~0, #pthreadsForks, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 02:23:49,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [733] L96-4-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_181) (< v_~q1_front~0_181 v_~q1_back~0_197) (< v_~q1_front~0_181 v_~n1~0_136)) 1 0) 0)) (= (+ (select (select |v_#memory_int_303| v_~q1~0.base_147) (+ (* v_~q1_front~0_181 4) v_~q1~0.offset_147)) 1) v_~i~0_175) (not (= (ite (and (< v_~q2_back~0_193 v_~n2~0_138) (<= 0 v_~q2_back~0_193)) 1 0) 0)) (< v_~i~0_175 v_~N~0_130) (= |v_#pthreadsForks_65| (+ |v_#pthreadsForks_66| 1)) (= (+ v_~q2_back~0_193 1) v_~q2_back~0_192) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|) (= |v_#pthreadsForks_66| |v_ULTIMATE.start_main_#t~pre20#1_61|) (= |v_#memory_int_303| (store |v_#memory_int_304| |v_ULTIMATE.start_main_~#t2~0#1.base_57| (store (select |v_#memory_int_304| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) |v_ULTIMATE.start_main_~#t2~0#1.offset_57| |v_ULTIMATE.start_main_#t~pre20#1_61|))) (= (ite (= v_~i~0_175 (select (select |v_#memory_int_303| v_~q2~0.base_127) (+ v_~q2~0.offset_127 (* 4 v_~q2_back~0_193)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|) (= (+ v_~q1_front~0_181 1) v_~q1_front~0_180) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0))) InVars {~q1~0.offset=v_~q1~0.offset_147, ~n2~0=v_~n2~0_138, ~q1_front~0=v_~q1_front~0_181, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_57|, ~q2~0.offset=v_~q2~0.offset_127, ~n1~0=v_~n1~0_136, ~N~0=v_~N~0_130, #pthreadsForks=|v_#pthreadsForks_66|, ~q1_back~0=v_~q1_back~0_197, ~q1~0.base=v_~q1~0.base_147, #memory_int=|v_#memory_int_304|, ~q2~0.base=v_~q2~0.base_127, ~q2_back~0=v_~q2_back~0_193, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_61|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_45|, ~q1_front~0=v_~q1_front~0_180, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_57|, ~q2~0.offset=v_~q2~0.offset_127, ~n1~0=v_~n1~0_136, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_61|, #pthreadsForks=|v_#pthreadsForks_65|, ~q1_back~0=v_~q1_back~0_197, ~q1~0.base=v_~q1~0.base_147, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_67|, ~q2~0.base=v_~q2~0.base_127, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_61|, ~q2_back~0=v_~q2_back~0_192, ~q1~0.offset=v_~q1~0.offset_147, ~n2~0=v_~n2~0_138, ~i~0=v_~i~0_175, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_61|, ~N~0=v_~N~0_130, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_101|, #memory_int=|v_#memory_int_303|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_45|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_45|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, #memory_int, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:23:49,907 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,907 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,908 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:49,908 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 02:23:50,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [712] L65-1-->L65-1: Formula: (and (< v_~j~0_134 v_~N~0_94) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (not (= (ite (= v_~j~0_134 (select (select |v_#memory_int_249| v_~q1~0.base_109) (+ (* v_~q1_back~0_140 4) v_~q1~0.offset_109))) 1 0) 0)) (= v_~q1_back~0_139 (+ v_~q1_back~0_140 1)) (not (= 0 (ite (and (<= 0 v_~q1_back~0_140) (< v_~q1_back~0_140 v_~n1~0_98)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0)) (= (+ v_~q2_front~0_122 1) v_~q2_front~0_121) (= (ite (and (<= 0 v_~q2_front~0_122) (< v_~q2_front~0_122 v_~q2_back~0_144) (< v_~q2_front~0_122 v_~n2~0_104)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|) (= v_~j~0_133 (+ (select (select |v_#memory_int_249| v_~q2~0.base_91) (+ v_~q2~0.offset_91 (* v_~q2_front~0_122 4))) 1))) InVars {~j~0=v_~j~0_134, ~q1~0.offset=v_~q1~0.offset_109, ~n2~0=v_~n2~0_104, ~q1_back~0=v_~q1_back~0_140, ~q2~0.offset=v_~q2~0.offset_91, ~n1~0=v_~n1~0_98, ~q1~0.base=v_~q1~0.base_109, #memory_int=|v_#memory_int_249|, ~q2_front~0=v_~q2_front~0_122, ~q2~0.base=v_~q2~0.base_91, ~N~0=v_~N~0_94, ~q2_back~0=v_~q2_back~0_144} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_38|, ~j~0=v_~j~0_133, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_32|, ~q1~0.offset=v_~q1~0.offset_109, ~n2~0=v_~n2~0_104, ~q2~0.offset=v_~q2~0.offset_91, ~n1~0=v_~n1~0_98, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~q2_front~0=v_~q2_front~0_121, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_28|, ~N~0=v_~N~0_94, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_28|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_32|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|, ~q1_back~0=v_~q1_back~0_139, ~q1~0.base=v_~q1~0.base_109, #memory_int=|v_#memory_int_249|, ~q2~0.base=v_~q2~0.base_91, ~q2_back~0=v_~q2_back~0_144} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:50,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:50,939 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,939 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,939 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,939 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,939 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,939 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,940 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,940 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,940 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:50,940 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,329 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,330 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,331 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,760 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,760 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,760 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,761 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,761 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,761 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,761 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,761 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,761 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:51,761 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_307| v_~q1~0.base_149))) (and (= (ite (and (< v_~q1_front~0_185 v_~n1~0_138) (< v_~q1_front~0_185 v_~q1_back~0_199) (<= 0 v_~q1_front~0_185)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (not (= (ite (and (<= 0 v_~q1_back~0_200) (< v_~q1_back~0_200 v_~n1~0_138)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_back~0_197) (< v_~q2_back~0_197 v_~n2~0_140)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91| 0)) (= v_~q1_front~0_184 (+ v_~q1_front~0_185 1)) (not (= (ite (= (select (select |v_#memory_int_307| v_~q2~0.base_129) (+ v_~q2~0.offset_129 (* 4 v_~q2_back~0_197))) v_~i~0_178) 1 0) 0)) (= (+ v_~q2_back~0_197 1) v_~q2_back~0_196) (< v_~i~0_178 v_~N~0_132) (= (+ v_~q1_back~0_200 1) v_~q1_back~0_199) (< v_~j~0_173 v_~N~0_132) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_103|) (= v_~i~0_177 (+ (select .cse0 (+ v_~q1~0.offset_149 (* v_~q1_front~0_185 4))) 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_103| 0)) (= (ite (= v_~j~0_173 (select .cse0 (+ (* v_~q1_back~0_200 4) v_~q1~0.offset_149))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|))) InVars {~j~0=v_~j~0_173, ~q1~0.offset=v_~q1~0.offset_149, ~q1_front~0=v_~q1_front~0_185, ~n2~0=v_~n2~0_140, ~i~0=v_~i~0_178, ~n1~0=v_~n1~0_138, ~q2~0.offset=v_~q2~0.offset_129, ~N~0=v_~N~0_132, ~q1_back~0=v_~q1_back~0_200, ~q1~0.base=v_~q1~0.base_149, #memory_int=|v_#memory_int_307|, ~q2~0.base=v_~q2~0.base_129, ~q2_back~0=v_~q2_back~0_197} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_47|, ~j~0=v_~j~0_173, ~q1~0.offset=v_~q1~0.offset_149, ~q1_front~0=v_~q1_front~0_184, ~n2~0=v_~n2~0_140, ~i~0=v_~i~0_177, ~n1~0=v_~n1~0_138, ~q2~0.offset=v_~q2~0.offset_129, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_48|, ~N~0=v_~N~0_132, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, ~q1_back~0=v_~q1_back~0_199, ~q1~0.base=v_~q1~0.base_149, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_69|, #memory_int=|v_#memory_int_307|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_103|, ~q2~0.base=v_~q2~0.base_129, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_63|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_47|, ~q2_back~0=v_~q2_back~0_196} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:52,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [743] L65-1-->thread1EXIT: Formula: (let ((.cse0 (select |v_#memory_int_323| v_~q1~0.base_165))) (and (< v_~j~0_197 v_~N~0_148) (not (= (ite (and (< v_~q1_back~0_234 v_~n1~0_154) (<= 0 v_~q1_back~0_234)) 1 0) 0)) (not (< v_~i~0_193 v_~N~0_148)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_117| 0)) (= (+ (select .cse0 (+ (* v_~q1_front~0_193 4) v_~q1~0.offset_165)) 1) v_~i~0_193) (= (ite (and (<= 0 v_~q1_front~0_193) (< v_~q1_front~0_193 v_~q1_back~0_233) (< v_~q1_front~0_193 v_~n1~0_154)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|) (= (+ v_~q2_back~0_223 1) v_~q2_back~0_222) (= v_~q1_front~0_192 (+ v_~q1_front~0_193 1)) (< v_~i~0_194 v_~N~0_148) (not (= (ite (and (< v_~q2_back~0_223 v_~n2~0_156) (<= 0 v_~q2_back~0_223)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_23| 0) (not (= (ite (= (select (select |v_#memory_int_323| v_~q2~0.base_145) (+ (* 4 v_~q2_back~0_223) v_~q2~0.offset_145)) v_~i~0_194) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (= v_~j~0_197 (select .cse0 (+ (* v_~q1_back~0_234 4) v_~q1~0.offset_165))) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_117|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_23| 0) (= (+ v_~q1_back~0_234 1) v_~q1_back~0_233))) InVars {~j~0=v_~j~0_197, ~q1~0.offset=v_~q1~0.offset_165, ~q1_front~0=v_~q1_front~0_193, ~n2~0=v_~n2~0_156, ~i~0=v_~i~0_194, ~n1~0=v_~n1~0_154, ~q2~0.offset=v_~q2~0.offset_145, ~N~0=v_~N~0_148, ~q1_back~0=v_~q1_back~0_234, ~q1~0.base=v_~q1~0.base_165, #memory_int=|v_#memory_int_323|, ~q2~0.base=v_~q2~0.base_145, ~q2_back~0=v_~q2_back~0_223} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_57|, ~j~0=v_~j~0_197, ~q1_front~0=v_~q1_front~0_192, ~n1~0=v_~n1~0_154, ~q2~0.offset=v_~q2~0.offset_145, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121|, ~q1_back~0=v_~q1_back~0_233, ~q1~0.base=v_~q1~0.base_165, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_73|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_117|, ~q2~0.base=v_~q2~0.base_145, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_67|, ~q2_back~0=v_~q2_back~0_222, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_23|, ~q1~0.offset=v_~q1~0.offset_165, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_23|, ~n2~0=v_~n2~0_156, ~i~0=v_~i~0_193, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_67|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_66|, ~N~0=v_~N~0_148, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_66|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_117|, #memory_int=|v_#memory_int_323|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, thread1Thread1of1ForFork0_#res#1.offset, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0, thread1Thread1of1ForFork0_#res#1.base] and [740] L70-->L70: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (= v_~j~0_189 (select (select |v_#memory_int_317| v_~q1~0.base_159) (+ v_~q1~0.offset_159 (* v_~q1_back~0_222 4)))) 1 0)) (< v_~j~0_189 v_~N~0_142) (= v_~j~0_189 (+ (select (select |v_#memory_int_317| v_~q2~0.base_139) (+ v_~q2~0.offset_139 (* v_~q2_front~0_178 4))) 1)) (not (= (ite (and (< v_~q2_front~0_178 v_~n2~0_150) (<= 0 v_~q2_front~0_178) (< v_~q2_front~0_178 v_~q2_back~0_214)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109| 0)) (= (+ v_~q1_back~0_222 1) v_~q1_back~0_221) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109|) (= v_~q2_front~0_177 (+ v_~q2_front~0_178 1)) (not (= (ite (and (<= 0 v_~q1_back~0_222) (< v_~q1_back~0_222 v_~n1~0_148)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_159, ~n2~0=v_~n2~0_150, ~q1_back~0=v_~q1_back~0_222, ~n1~0=v_~n1~0_148, ~q2~0.offset=v_~q2~0.offset_139, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_317|, ~q2_front~0=v_~q2_front~0_178, ~q2~0.base=v_~q2~0.base_139, ~N~0=v_~N~0_142, ~q2_back~0=v_~q2_back~0_214} OutVars{~j~0=v_~j~0_189, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_64|, ~q1~0.offset=v_~q1~0.offset_159, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_58|, ~n2~0=v_~n2~0_150, ~n1~0=v_~n1~0_148, ~q2~0.offset=v_~q2~0.offset_139, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_60|, ~q2_front~0=v_~q2_front~0_177, ~N~0=v_~N~0_142, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_60|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109|, ~q1_back~0=v_~q1_back~0_221, ~q1~0.base=v_~q1~0.base_159, #memory_int=|v_#memory_int_317|, ~q2~0.base=v_~q2~0.base_139, ~q2_back~0=v_~q2_back~0_214} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:52,613 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,613 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,613 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,613 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,613 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,614 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,614 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,614 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,614 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:52,614 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:53,518 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:53,518 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:53,518 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:53,518 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:53,518 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:53,518 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:53,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] L65-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_311| v_~q1~0.base_153)) (.cse2 (* v_~q1_back~0_209 4)) (.cse0 (select |v_#memory_int_311| v_~q2~0.base_133))) (and (< v_~j~0_179 v_~N~0_136) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| (ite (= v_~i~0_183 (select .cse0 (+ (* 4 v_~q2_back~0_205) v_~q2~0.offset_133))) 1 0)) (not (= (ite (and (< v_~q1_back~0_209 v_~n1~0_142) (<= 0 v_~q1_back~0_209)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_109| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= (ite (= v_~j~0_179 (select .cse1 (+ .cse2 v_~q1~0.offset_153 4))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|) (not (= (ite (= v_~j~0_180 (select .cse1 (+ .cse2 v_~q1~0.offset_153))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_back~0_205) (< v_~q2_back~0_205 v_~n2~0_144)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_109|) (= v_~j~0_179 (+ (select .cse0 (+ (* v_~q2_front~0_166 4) v_~q2~0.offset_133)) 1)) (< v_~i~0_183 v_~N~0_136) (not (= (ite (let ((.cse3 (+ v_~q1_back~0_209 1))) (and (< .cse3 v_~n1~0_142) (<= 0 .cse3))) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_front~0_166) (< v_~q2_front~0_166 v_~q2_back~0_204) (< v_~q2_front~0_166 v_~n2~0_144)) 1 0) 0)) (= (+ v_~q2_back~0_205 1) v_~q2_back~0_204) (= (+ v_~q2_front~0_166 1) v_~q2_front~0_165) (< v_~j~0_180 v_~N~0_136) (= (+ 2 v_~q1_back~0_209) v_~q1_back~0_207))) InVars {~j~0=v_~j~0_180, ~q1~0.offset=v_~q1~0.offset_153, ~n2~0=v_~n2~0_144, ~i~0=v_~i~0_183, ~n1~0=v_~n1~0_142, ~q2~0.offset=v_~q2~0.offset_133, ~q2_front~0=v_~q2_front~0_166, ~N~0=v_~N~0_136, ~q1_back~0=v_~q1_back~0_209, ~q1~0.base=v_~q1~0.base_153, #memory_int=|v_#memory_int_311|, ~q2~0.base=v_~q2~0.base_133, ~q2_back~0=v_~q2_back~0_205} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_51|, ~j~0=v_~j~0_179, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_58|, ~q1~0.offset=v_~q1~0.offset_153, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_52|, ~n2~0=v_~n2~0_144, ~i~0=v_~i~0_183, ~n1~0=v_~n1~0_142, ~q2~0.offset=v_~q2~0.offset_133, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_52|, ~q2_front~0=v_~q2_front~0_165, ~N~0=v_~N~0_136, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_52|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_52|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, ~q1_back~0=v_~q1_back~0_207, ~q1~0.base=v_~q1~0.base_153, #memory_int=|v_#memory_int_311|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_109|, ~q2~0.base=v_~q2~0.base_133, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_51|, ~q2_back~0=v_~q2_back~0_204} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:23:54,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [756] L47-1-->L47-1: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_145| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_261) (< v_~q2_back~0_261 v_~n2~0_174)) 1 0) 0)) (= (+ v_~q1_front~0_221 1) v_~q1_front~0_220) (not (= (ite (= (select (select |v_#memory_int_346| v_~q2~0.base_163) (+ v_~q2~0.offset_163 (* 4 v_~q2_back~0_261))) v_~i~0_224) 1 0) 0)) (= (+ (select (select |v_#memory_int_345| v_~q1~0.base_183) (+ v_~q1~0.offset_183 (* v_~q1_front~0_221 4))) 1) v_~i~0_223) (< v_~i~0_224 v_~N~0_168) (= |v_#pthreadsForks_74| |v_ULTIMATE.start_main_#t~pre20#1_65|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_145|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| (ite (and (< v_~q1_front~0_221 v_~q1_back~0_267) (<= 0 v_~q1_front~0_221) (< v_~q1_front~0_221 v_~n1~0_172)) 1 0)) (= |v_#pthreadsForks_73| (+ |v_#pthreadsForks_74| 1)) (= (+ v_~q2_back~0_261 1) v_~q2_back~0_260) (= (store |v_#memory_int_346| |v_ULTIMATE.start_main_~#t2~0#1.base_61| (store (select |v_#memory_int_346| |v_ULTIMATE.start_main_~#t2~0#1.base_61|) |v_ULTIMATE.start_main_~#t2~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre20#1_65|)) |v_#memory_int_345|)) InVars {~q1~0.offset=v_~q1~0.offset_183, ~q1_front~0=v_~q1_front~0_221, ~n2~0=v_~n2~0_174, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ~i~0=v_~i~0_224, ~n1~0=v_~n1~0_172, ~q2~0.offset=v_~q2~0.offset_163, ~N~0=v_~N~0_168, #pthreadsForks=|v_#pthreadsForks_74|, ~q1_back~0=v_~q1_back~0_267, ~q1~0.base=v_~q1~0.base_183, #memory_int=|v_#memory_int_346|, ~q2~0.base=v_~q2~0.base_163, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|, ~q2_back~0=v_~q2_back~0_261} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_65|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_77|, ~q1_front~0=v_~q1_front~0_220, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_61|, ~n1~0=v_~n1~0_172, ~q2~0.offset=v_~q2~0.offset_163, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_65|, #pthreadsForks=|v_#pthreadsForks_73|, ~q1_back~0=v_~q1_back~0_267, ~q1~0.base=v_~q1~0.base_183, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_145|, ~q2~0.base=v_~q2~0.base_163, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_81|, ~q2_back~0=v_~q2_back~0_260, ~q1~0.offset=v_~q1~0.offset_183, ~n2~0=v_~n2~0_174, ~i~0=v_~i~0_223, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_81|, ~N~0=v_~N~0_168, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|, #memory_int=|v_#memory_int_345|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_49|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_77|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 02:23:54,398 INFO L241 LiptonReduction]: Total number of compositions: 24 [2022-12-13 02:23:54,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20797 [2022-12-13 02:23:54,399 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 129 transitions, 1278 flow [2022-12-13 02:23:54,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:54,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:23:54,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:23:54,405 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 02:23:54,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 02:23:54,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:23:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:23:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1458206323, now seen corresponding path program 1 times [2022-12-13 02:23:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:23:54,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890933854] [2022-12-13 02:23:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:23:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:23:55,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890933854] [2022-12-13 02:23:55,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890933854] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:23:55,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734387042] [2022-12-13 02:23:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:23:55,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:23:55,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:23:55,544 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 02:23:55,548 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 02:23:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:23:55,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 02:23:55,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:23:55,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:23:55,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:23:55,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:23:55,709 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:23:55,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-13 02:23:55,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 02:23:55,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:23:55,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-13 02:23:55,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:23:55,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2022-12-13 02:23:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:55,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:23:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:23:56,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734387042] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:23:56,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:23:56,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 02:23:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329496905] [2022-12-13 02:23:56,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:23:56,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 02:23:56,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:23:56,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 02:23:56,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=124, Unknown=1, NotChecked=0, Total=182 [2022-12-13 02:23:56,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:23:56,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 129 transitions, 1278 flow. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:23:56,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:23:56,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:23:56,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:23:58,273 INFO L130 PetriNetUnfolder]: 310/547 cut-off events. [2022-12-13 02:23:58,274 INFO L131 PetriNetUnfolder]: For 2193/2193 co-relation queries the response was YES. [2022-12-13 02:23:58,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 547 events. 310/547 cut-off events. For 2193/2193 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2408 event pairs, 31 based on Foata normal form. 8/545 useless extension candidates. Maximal degree in co-relation 2691. Up to 323 conditions per place. [2022-12-13 02:23:58,278 INFO L137 encePairwiseOnDemand]: 17/60 looper letters, 82 selfloop transitions, 66 changer transitions 8/156 dead transitions. [2022-12-13 02:23:58,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 156 transitions, 1578 flow [2022-12-13 02:23:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:23:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:23:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 123 transitions. [2022-12-13 02:23:58,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14642857142857144 [2022-12-13 02:23:58,281 INFO L175 Difference]: Start difference. First operand has 73 places, 129 transitions, 1278 flow. Second operand 14 states and 123 transitions. [2022-12-13 02:23:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 156 transitions, 1578 flow [2022-12-13 02:23:58,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 156 transitions, 1239 flow, removed 132 selfloop flow, removed 9 redundant places. [2022-12-13 02:23:58,295 INFO L231 Difference]: Finished difference. Result has 74 places, 114 transitions, 918 flow [2022-12-13 02:23:58,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=918, PETRI_PLACES=74, PETRI_TRANSITIONS=114} [2022-12-13 02:23:58,296 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 52 predicate places. [2022-12-13 02:23:58,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:23:58,296 INFO L89 Accepts]: Start accepts. Operand has 74 places, 114 transitions, 918 flow [2022-12-13 02:23:58,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:23:58,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:23:58,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 114 transitions, 918 flow [2022-12-13 02:23:58,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 114 transitions, 918 flow [2022-12-13 02:23:58,315 INFO L130 PetriNetUnfolder]: 86/218 cut-off events. [2022-12-13 02:23:58,315 INFO L131 PetriNetUnfolder]: For 333/333 co-relation queries the response was YES. [2022-12-13 02:23:58,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 218 events. 86/218 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1013 event pairs, 5 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 769. Up to 57 conditions per place. [2022-12-13 02:23:58,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 114 transitions, 918 flow [2022-12-13 02:23:58,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 02:23:58,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] L65-1-->L52: Formula: (let ((.cse0 (select |v_#memory_int_325| v_~q2~0.base_147)) (.cse1 (* 4 v_~q2_back~0_228)) (.cse2 (select |v_#memory_int_325| v_~q1~0.base_167))) (and (not (= (ite (and (< v_~q2_back~0_228 v_~n2~0_158) (<= 0 v_~q2_back~0_228)) 1 0) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~q2~0.offset_147)) v_~i~0_198) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_238 v_~n1~0_156) (<= 0 v_~q1_back~0_238)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| (ite (= v_~j~0_199 (select .cse2 (+ v_~q1~0.offset_167 (* v_~q1_back~0_238 4)))) 1 0)) (< v_~j~0_199 v_~N~0_150) (< v_~i~0_197 v_~N~0_150) (< v_~i~0_198 v_~N~0_150) (= (+ v_~q1_back~0_238 1) v_~q1_back~0_237) (= v_~q2_back~0_226 (+ 2 v_~q2_back~0_228)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121| (ite (= (select .cse0 (+ .cse1 v_~q2~0.offset_147 4)) v_~i~0_197) 1 0)) (not (= (ite (and (<= 0 v_~q1_front~0_197) (< v_~q1_front~0_197 v_~n1~0_156) (< v_~q1_front~0_197 v_~q1_back~0_237)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_121|) (= (+ (select .cse2 (+ (* v_~q1_front~0_197 4) v_~q1~0.offset_167)) 1) v_~i~0_197) (= (+ v_~q1_front~0_197 1) v_~q1_front~0_196) (not (= (ite (let ((.cse3 (+ v_~q2_back~0_228 1))) (and (< .cse3 v_~n2~0_158) (<= 0 .cse3))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_121| 0)))) InVars {~j~0=v_~j~0_199, ~q1~0.offset=v_~q1~0.offset_167, ~n2~0=v_~n2~0_158, ~q1_front~0=v_~q1_front~0_197, ~i~0=v_~i~0_198, ~q2~0.offset=v_~q2~0.offset_147, ~n1~0=v_~n1~0_156, ~N~0=v_~N~0_150, ~q1_back~0=v_~q1_back~0_238, ~q1~0.base=v_~q1~0.base_167, #memory_int=|v_#memory_int_325|, ~q2~0.base=v_~q2~0.base_147, ~q2_back~0=v_~q2_back~0_228} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_59|, ~j~0=v_~j~0_199, ~q1~0.offset=v_~q1~0.offset_167, ~n2~0=v_~n2~0_158, ~q1_front~0=v_~q1_front~0_196, ~i~0=v_~i~0_197, ~q2~0.offset=v_~q2~0.offset_147, ~n1~0=v_~n1~0_156, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_68|, ~N~0=v_~N~0_150, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_68|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_121|, ~q1_back~0=v_~q1_back~0_237, ~q1~0.base=v_~q1~0.base_167, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_121|, #memory_int=|v_#memory_int_325|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_75|, ~q2~0.base=v_~q2~0.base_147, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_69|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_59|, ~q2_back~0=v_~q2_back~0_226} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:58,683 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:58,684 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:58,684 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:58,684 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:58,684 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:58,684 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,005 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,006 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] L47-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_335| v_~q1~0.base_177))) (and (not (= (ite (and (<= 0 v_~q2_back~0_241) (< v_~q2_back~0_241 v_~n2~0_166)) 1 0) 0)) (< v_~j~0_213 v_~N~0_160) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| (ite (= v_~j~0_213 (select .cse0 (+ v_~q1~0.offset_177 (* v_~q1_back~0_258 4)))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137| 0)) (= v_~i~0_209 (+ (select .cse0 (+ v_~q1~0.offset_177 (* v_~q1_front~0_209 4))) 1)) (= (+ v_~q1_front~0_209 1) v_~q1_front~0_208) (not (= (ite (= v_~i~0_210 (select (select |v_#memory_int_335| v_~q2~0.base_155) (+ v_~q2~0.offset_155 (* 4 v_~q2_back~0_241)))) 1 0) 0)) (= (+ v_~q2_back~0_241 1) v_~q2_back~0_240) (= (ite (and (< v_~q1_front~0_209 v_~q1_back~0_257) (<= 0 v_~q1_front~0_209) (< v_~q1_front~0_209 v_~n1~0_166)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| 0)) (not (= (ite (and (< v_~q1_back~0_258 v_~n1~0_166) (<= 0 v_~q1_back~0_258)) 1 0) 0)) (< v_~i~0_210 v_~N~0_160) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|) (= v_~q1_back~0_257 (+ v_~q1_back~0_258 1)))) InVars {~j~0=v_~j~0_213, ~q1~0.offset=v_~q1~0.offset_177, ~q1_front~0=v_~q1_front~0_209, ~n2~0=v_~n2~0_166, ~i~0=v_~i~0_210, ~n1~0=v_~n1~0_166, ~q2~0.offset=v_~q2~0.offset_155, ~N~0=v_~N~0_160, ~q1_back~0=v_~q1_back~0_258, ~q1~0.base=v_~q1~0.base_177, #memory_int=|v_#memory_int_335|, ~q2~0.base=v_~q2~0.base_155, ~q2_back~0=v_~q2_back~0_241} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_65|, ~j~0=v_~j~0_213, ~q1~0.offset=v_~q1~0.offset_177, ~q1_front~0=v_~q1_front~0_208, ~n2~0=v_~n2~0_166, ~i~0=v_~i~0_209, ~n1~0=v_~n1~0_166, ~q2~0.offset=v_~q2~0.offset_155, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_75|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_78|, ~N~0=v_~N~0_160, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_78|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|, ~q1_back~0=v_~q1_back~0_257, ~q1~0.base=v_~q1~0.base_177, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_81|, #memory_int=|v_#memory_int_335|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, ~q2~0.base=v_~q2~0.base_155, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_75|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_65|, ~q2_back~0=v_~q2_back~0_240} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,550 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,551 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:23:59,810 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [762] L47-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_359| v_~q2~0.base_173))) (and (not (= (ite (= v_~j~0_224 (select (select |v_#memory_int_359| v_~q1~0.base_193) (+ v_~q1~0.offset_193 (* v_~q1_back~0_282 4)))) 1 0) 0)) (= v_~q2_back~0_282 (+ v_~q2_back~0_283 1)) (not (= (ite (and (<= 0 v_~q1_back~0_282) (< v_~q1_back~0_282 v_~n1~0_182)) 1 0) 0)) (= (+ v_~q1_back~0_282 1) v_~q1_back~0_281) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| 0)) (< v_~i~0_241 v_~N~0_178) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163| (ite (= v_~i~0_241 (select .cse0 (+ v_~q2~0.offset_173 (* 4 v_~q2_back~0_283)))) 1 0)) (< v_~j~0_224 v_~N~0_178) (= v_~j~0_223 (+ (select .cse0 (+ v_~q2~0.offset_173 (* v_~q2_front~0_206 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_145| (ite (and (< v_~q2_front~0_206 v_~q2_back~0_282) (<= 0 v_~q2_front~0_206) (< v_~q2_front~0_206 v_~n2~0_184)) 1 0)) (= v_~q2_front~0_205 (+ v_~q2_front~0_206 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_145| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|) (not (= (ite (and (< v_~q2_back~0_283 v_~n2~0_184) (<= 0 v_~q2_back~0_283)) 1 0) 0)))) InVars {~j~0=v_~j~0_224, ~q1~0.offset=v_~q1~0.offset_193, ~n2~0=v_~n2~0_184, ~i~0=v_~i~0_241, ~q2~0.offset=v_~q2~0.offset_173, ~n1~0=v_~n1~0_182, ~q2_front~0=v_~q2_front~0_206, ~N~0=v_~N~0_178, ~q1_back~0=v_~q1_back~0_282, ~q1~0.base=v_~q1~0.base_193, #memory_int=|v_#memory_int_359|, ~q2~0.base=v_~q2~0.base_173, ~q2_back~0=v_~q2_back~0_283} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_89|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_78|, ~j~0=v_~j~0_223, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_72|, ~q1~0.offset=v_~q1~0.offset_193, ~n2~0=v_~n2~0_184, ~i~0=v_~i~0_241, ~q2~0.offset=v_~q2~0.offset_173, ~n1~0=v_~n1~0_182, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_145|, ~q2_front~0=v_~q2_front~0_205, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_86|, ~N~0=v_~N~0_178, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_86|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_72|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_163|, ~q1_back~0=v_~q1_back~0_281, ~q1~0.base=v_~q1~0.base_193, #memory_int=|v_#memory_int_359|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|, ~q2~0.base=v_~q2~0.base_173, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_89|, ~q2_back~0=v_~q2_back~0_282} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:00,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] L47-1-->L52: Formula: (let ((.cse1 (select |v_#memory_int_390| v_~q2~0.base_195)) (.cse0 (select |v_#memory_int_390| v_~q1~0.base_217))) (and (= (+ (select .cse0 (+ (* v_~q1_front~0_282 4) v_~q1~0.offset_217)) 1) v_~i~0_289) (not (= (ite (and (<= 0 v_~q1_back~0_331) (< v_~q1_back~0_331 v_~n1~0_206)) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_335 v_~n2~0_206) (<= 0 v_~q2_back~0_335)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ v_~q2~0.offset_195 (* 4 v_~q2_back~0_335))) v_~i~0_290) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_199| 0)) (= (+ 2 v_~q2_back~0_335) v_~q2_back~0_333) (not (= (ite (and (< v_~q1_front~0_282 v_~q1_back~0_330) (<= 0 v_~q1_front~0_282) (< v_~q1_front~0_282 v_~n1~0_206)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_199| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_199|) (< v_~i~0_289 v_~N~0_200) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_179| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= (+ v_~q1_back~0_331 1) v_~q1_back~0_330) (not (= (ite (and (< v_~q2_back~0_333 (+ v_~n2~0_206 1)) (<= 1 v_~q2_back~0_333)) 1 0) 0)) (= (+ v_~q1_front~0_282 1) v_~q1_front~0_281) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< v_~j~0_263 v_~N~0_200) (= (ite (= (select .cse1 (+ v_~q2~0.offset_195 (- 4) (* 4 v_~q2_back~0_333))) v_~i~0_289) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_199|) (< v_~i~0_290 v_~N~0_200) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_179| (ite (= v_~j~0_263 (select .cse0 (+ v_~q1~0.offset_217 (* v_~q1_back~0_331 4)))) 1 0)))) InVars {~j~0=v_~j~0_263, ~q1~0.offset=v_~q1~0.offset_217, ~n2~0=v_~n2~0_206, ~q1_front~0=v_~q1_front~0_282, ~i~0=v_~i~0_290, ~q2~0.offset=v_~q2~0.offset_195, ~n1~0=v_~n1~0_206, ~N~0=v_~N~0_200, ~q1_back~0=v_~q1_back~0_331, ~q1~0.base=v_~q1~0.base_217, #memory_int=|v_#memory_int_390|, ~q2~0.base=v_~q2~0.base_195, ~q2_back~0=v_~q2_back~0_335} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_119|, ~j~0=v_~j~0_263, ~q1~0.offset=v_~q1~0.offset_217, ~n2~0=v_~n2~0_206, ~q1_front~0=v_~q1_front~0_281, ~i~0=v_~i~0_289, ~q2~0.offset=v_~q2~0.offset_195, ~n1~0=v_~n1~0_206, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_179|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_112|, ~N~0=v_~N~0_200, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_112|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_199|, ~q1_back~0=v_~q1_back~0_330, ~q1~0.base=v_~q1~0.base_217, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_199|, #memory_int=|v_#memory_int_390|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_121|, ~q2~0.base=v_~q2~0.base_195, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_115|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_119|, ~q2_back~0=v_~q2_back~0_333} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:24:00,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,257 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,258 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,258 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:01,258 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,219 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,220 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,220 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,220 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,220 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,220 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,220 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,221 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,221 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,221 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,221 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:02,221 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:03,009 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 02:24:03,009 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4713 [2022-12-13 02:24:03,010 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 111 transitions, 938 flow [2022-12-13 02:24:03,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:24:03,010 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:03,010 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:03,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 02:24:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:24:03,215 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:24:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash -437050511, now seen corresponding path program 1 times [2022-12-13 02:24:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:03,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450593610] [2022-12-13 02:24:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:04,108 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 02:24:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450593610] [2022-12-13 02:24:04,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450593610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:24:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739797336] [2022-12-13 02:24:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:24:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:24:04,111 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 02:24:04,112 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 02:24:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:04,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 02:24:04,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:24:04,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:04,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:04,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 02:24:04,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:04,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-13 02:24:04,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:04,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:04,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 02:24:04,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 02:24:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:04,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 02:24:04,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 02:24:04,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:04,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 02:24:04,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-12-13 02:24:04,792 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 02:24:04,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:24:05,199 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 02:24:05,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739797336] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:24:05,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:24:05,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 02:24:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826297089] [2022-12-13 02:24:05,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:24:05,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:24:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:05,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:24:05,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2022-12-13 02:24:05,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 02:24:05,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 111 transitions, 938 flow. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:24:05,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:05,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 02:24:05,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:08,662 INFO L130 PetriNetUnfolder]: 349/648 cut-off events. [2022-12-13 02:24:08,662 INFO L131 PetriNetUnfolder]: For 1755/1755 co-relation queries the response was YES. [2022-12-13 02:24:08,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2956 conditions, 648 events. 349/648 cut-off events. For 1755/1755 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3150 event pairs, 35 based on Foata normal form. 47/687 useless extension candidates. Maximal degree in co-relation 2667. Up to 263 conditions per place. [2022-12-13 02:24:08,668 INFO L137 encePairwiseOnDemand]: 8/46 looper letters, 83 selfloop transitions, 82 changer transitions 6/171 dead transitions. [2022-12-13 02:24:08,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 171 transitions, 1556 flow [2022-12-13 02:24:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 02:24:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 02:24:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 131 transitions. [2022-12-13 02:24:08,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15821256038647344 [2022-12-13 02:24:08,669 INFO L175 Difference]: Start difference. First operand has 64 places, 111 transitions, 938 flow. Second operand 18 states and 131 transitions. [2022-12-13 02:24:08,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 171 transitions, 1556 flow [2022-12-13 02:24:08,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 171 transitions, 1504 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:08,680 INFO L231 Difference]: Finished difference. Result has 79 places, 121 transitions, 1153 flow [2022-12-13 02:24:08,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1153, PETRI_PLACES=79, PETRI_TRANSITIONS=121} [2022-12-13 02:24:08,680 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 57 predicate places. [2022-12-13 02:24:08,681 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:08,681 INFO L89 Accepts]: Start accepts. Operand has 79 places, 121 transitions, 1153 flow [2022-12-13 02:24:08,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:08,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:08,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 121 transitions, 1153 flow [2022-12-13 02:24:08,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 121 transitions, 1153 flow [2022-12-13 02:24:08,711 INFO L130 PetriNetUnfolder]: 92/261 cut-off events. [2022-12-13 02:24:08,711 INFO L131 PetriNetUnfolder]: For 545/545 co-relation queries the response was YES. [2022-12-13 02:24:08,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 261 events. 92/261 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1375 event pairs, 8 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 1060. Up to 62 conditions per place. [2022-12-13 02:24:08,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 121 transitions, 1153 flow [2022-12-13 02:24:08,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 02:24:08,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L65-1-->L65-1: Formula: (and (= (+ v_~q2_front~0_150 1) v_~q2_front~0_149) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| 0)) (not (= (ite (= v_~j~0_162 (select (select |v_#memory_int_279| v_~q1~0.base_135) (+ v_~q1~0.offset_135 (* v_~q1_back~0_182 4)))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (< v_~j~0_162 v_~N~0_118) (= (ite (and (< v_~q2_front~0_150 v_~n2~0_128) (< v_~q2_front~0_150 v_~q2_back~0_178) (<= 0 v_~q2_front~0_150)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (= (+ v_~q1_back~0_182 1) v_~q1_back~0_181) (not (= (ite (and (< v_~q1_back~0_182 v_~n1~0_124) (<= 0 v_~q1_back~0_182)) 1 0) 0)) (= v_~j~0_161 (+ (select (select |v_#memory_int_279| v_~q2~0.base_115) (+ v_~q2~0.offset_115 (* v_~q2_front~0_150 4))) 1))) InVars {~j~0=v_~j~0_162, ~q1~0.offset=v_~q1~0.offset_135, ~n2~0=v_~n2~0_128, ~q1_back~0=v_~q1_back~0_182, ~q2~0.offset=v_~q2~0.offset_115, ~n1~0=v_~n1~0_124, ~q1~0.base=v_~q1~0.base_135, #memory_int=|v_#memory_int_279|, ~q2_front~0=v_~q2_front~0_150, ~q2~0.base=v_~q2~0.base_115, ~N~0=v_~N~0_118, ~q2_back~0=v_~q2_back~0_178} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_52|, ~j~0=v_~j~0_161, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_46|, ~q1~0.offset=v_~q1~0.offset_135, ~n2~0=v_~n2~0_128, ~q2~0.offset=v_~q2~0.offset_115, ~n1~0=v_~n1~0_124, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, ~q2_front~0=v_~q2_front~0_149, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_44|, ~N~0=v_~N~0_118, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_44|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_46|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, ~q1_back~0=v_~q1_back~0_181, ~q1~0.base=v_~q1~0.base_135, #memory_int=|v_#memory_int_279|, ~q2~0.base=v_~q2~0.base_115, ~q2_back~0=v_~q2_back~0_178} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:08,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:24:09,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:09,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:09,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [711] L65-1-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_17| 0) (= (+ v_~q1_front~0_129 1) v_~q1_front~0_128) (not (< v_~j~0_131 v_~N~0_92)) (= (ite (and (<= 0 v_~q1_front~0_129) (< v_~q1_front~0_129 v_~q1_back~0_137) (< v_~q1_front~0_129 v_~n1~0_96)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_17|) (= (+ (select (select |v_#memory_int_247| v_~q1~0.base_107) (+ v_~q1~0.offset_107 (* v_~q1_front~0_129 4))) 1) v_~i~0_139)) InVars {~j~0=v_~j~0_131, ~q1~0.offset=v_~q1~0.offset_107, ~q1_front~0=v_~q1_front~0_129, ~q1_back~0=v_~q1_back~0_137, ~n1~0=v_~n1~0_96, ~q1~0.base=v_~q1~0.base_107, #memory_int=|v_#memory_int_247|, ~N~0=v_~N~0_92} OutVars{~j~0=v_~j~0_131, ~q1~0.offset=v_~q1~0.offset_107, ~q1_front~0=v_~q1_front~0_128, ~i~0=v_~i~0_139, ~n1~0=v_~n1~0_96, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_37|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_17|, ~N~0=v_~N~0_92, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_17|, ~q1_back~0=v_~q1_back~0_137, ~q1~0.base=v_~q1~0.base_107, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_43|, #memory_int=|v_#memory_int_247|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_37|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:09,705 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:24:09,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1024 [2022-12-13 02:24:09,706 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 118 transitions, 1154 flow [2022-12-13 02:24:09,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:24:09,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:09,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:09,710 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 02:24:09,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:24:09,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:24:09,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash 178590780, now seen corresponding path program 1 times [2022-12-13 02:24:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:09,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974870364] [2022-12-13 02:24:09,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974870364] [2022-12-13 02:24:11,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974870364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:24:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149214592] [2022-12-13 02:24:11,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:24:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:24:11,259 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 02:24:11,265 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 02:24:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:11,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 02:24:11,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:24:11,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2022-12-13 02:24:11,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 02:24:11,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:24:11,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:24:11,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:24:11,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:24:11,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 02:24:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:11,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:24:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:24:12,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149214592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:24:12,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:24:12,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 02:24:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586264714] [2022-12-13 02:24:12,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:24:12,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:24:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:24:12,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=185, Unknown=7, NotChecked=0, Total=240 [2022-12-13 02:24:12,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:24:12,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 118 transitions, 1154 flow. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:24:12,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:12,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:24:12,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:28,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:24:29,154 INFO L130 PetriNetUnfolder]: 495/910 cut-off events. [2022-12-13 02:24:29,154 INFO L131 PetriNetUnfolder]: For 3095/3095 co-relation queries the response was YES. [2022-12-13 02:24:29,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 910 events. 495/910 cut-off events. For 3095/3095 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4759 event pairs, 51 based on Foata normal form. 27/924 useless extension candidates. Maximal degree in co-relation 4424. Up to 400 conditions per place. [2022-12-13 02:24:29,160 INFO L137 encePairwiseOnDemand]: 8/42 looper letters, 112 selfloop transitions, 109 changer transitions 5/226 dead transitions. [2022-12-13 02:24:29,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 226 transitions, 2366 flow [2022-12-13 02:24:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 02:24:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 02:24:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 154 transitions. [2022-12-13 02:24:29,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-13 02:24:29,162 INFO L175 Difference]: Start difference. First operand has 74 places, 118 transitions, 1154 flow. Second operand 18 states and 154 transitions. [2022-12-13 02:24:29,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 226 transitions, 2366 flow [2022-12-13 02:24:29,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 226 transitions, 2209 flow, removed 46 selfloop flow, removed 8 redundant places. [2022-12-13 02:24:29,176 INFO L231 Difference]: Finished difference. Result has 91 places, 167 transitions, 1937 flow [2022-12-13 02:24:29,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1937, PETRI_PLACES=91, PETRI_TRANSITIONS=167} [2022-12-13 02:24:29,177 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 69 predicate places. [2022-12-13 02:24:29,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:29,177 INFO L89 Accepts]: Start accepts. Operand has 91 places, 167 transitions, 1937 flow [2022-12-13 02:24:29,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:29,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:29,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 167 transitions, 1937 flow [2022-12-13 02:24:29,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 167 transitions, 1937 flow [2022-12-13 02:24:29,208 INFO L130 PetriNetUnfolder]: 129/365 cut-off events. [2022-12-13 02:24:29,208 INFO L131 PetriNetUnfolder]: For 965/966 co-relation queries the response was YES. [2022-12-13 02:24:29,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 365 events. 129/365 cut-off events. For 965/966 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2140 event pairs, 12 based on Foata normal form. 1/356 useless extension candidates. Maximal degree in co-relation 1690. Up to 94 conditions per place. [2022-12-13 02:24:29,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 167 transitions, 1937 flow [2022-12-13 02:24:29,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-13 02:24:29,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:24:29,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [796] L65-1-->L47-1: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_238| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_238|) (not (< v_~j~0_301 v_~N~0_224)) (= (ite (and (< v_~q1_front~0_323 v_~q1_back~0_377) (< v_~q1_front~0_323 v_~n1~0_228) (<= 0 v_~q1_front~0_323)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_23|) (= v_~i~0_334 (+ (select (select |v_#memory_int_417| v_~q1~0.base_239) (+ (* v_~q1_front~0_323 4) v_~q1~0.offset_239)) 1)) (= (+ v_~q1_front~0_323 1) v_~q1_front~0_322) (= |v_thread2Thread1of1ForFork1_#res#1.offset_23| 0)) InVars {~j~0=v_~j~0_301, ~q1~0.offset=v_~q1~0.offset_239, ~q1_front~0=v_~q1_front~0_323, ~q1_back~0=v_~q1_back~0_377, ~n1~0=v_~n1~0_228, ~q1~0.base=v_~q1~0.base_239, #memory_int=|v_#memory_int_417|, ~N~0=v_~N~0_224} OutVars{~j~0=v_~j~0_301, ~q1~0.offset=v_~q1~0.offset_239, ~q1_front~0=v_~q1_front~0_322, ~i~0=v_~i~0_334, ~n1~0=v_~n1~0_228, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_139|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_23|, ~N~0=v_~N~0_224, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_23|, ~q1_back~0=v_~q1_back~0_377, ~q1~0.base=v_~q1~0.base_239, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_145|, #memory_int=|v_#memory_int_417|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_238|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_139|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:30,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_321| v_~q2~0.base_143))) (and (= (+ v_~q2_front~0_186 1) v_~q2_front~0_185) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115| (ite (= (select .cse0 (+ v_~q2~0.offset_143 (* 4 v_~q2_back~0_219))) v_~i~0_191) 1 0)) (not (= 0 (ite (and (< v_~q1_back~0_230 v_~n1~0_152) (<= 0 v_~q1_back~0_230)) 1 0))) (= (+ v_~q1_back~0_230 1) v_~q1_back~0_229) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (not (= (ite (and (< v_~q2_back~0_219 v_~n2~0_154) (<= 0 v_~q2_back~0_219)) 1 0) 0)) (= (+ v_~q2_back~0_219 1) v_~q2_back~0_218) (= v_~j~0_193 (+ (select .cse0 (+ v_~q2~0.offset_143 (* v_~q2_front~0_186 4))) 1)) (not (= (ite (= v_~j~0_194 (select (select |v_#memory_int_321| v_~q1~0.base_163) (+ v_~q1~0.offset_163 (* v_~q1_back~0_230 4)))) 1 0) 0)) (< v_~j~0_194 v_~N~0_146) (= (ite (and (<= 0 v_~q2_front~0_186) (< v_~q2_front~0_186 v_~q2_back~0_218) (< v_~q2_front~0_186 v_~n2~0_154)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| 0)) (< v_~i~0_191 v_~N~0_146))) InVars {~j~0=v_~j~0_194, ~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, ~i~0=v_~i~0_191, ~q2~0.offset=v_~q2~0.offset_143, ~n1~0=v_~n1~0_152, ~q2_front~0=v_~q2_front~0_186, ~N~0=v_~N~0_146, ~q1_back~0=v_~q1_back~0_230, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_321|, ~q2~0.base=v_~q2~0.base_143, ~q2_back~0=v_~q2_back~0_219} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_55|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_68|, ~j~0=v_~j~0_193, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_62|, ~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, ~i~0=v_~i~0_191, ~q2~0.offset=v_~q2~0.offset_143, ~n1~0=v_~n1~0_152, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|, ~q2_front~0=v_~q2_front~0_185, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_64|, ~N~0=v_~N~0_146, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_64|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|, ~q1_back~0=v_~q1_back~0_229, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_321|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, ~q2~0.base=v_~q2~0.base_143, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_55|, ~q2_back~0=v_~q2_back~0_218} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:30,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_321| v_~q2~0.base_143))) (and (= (+ v_~q2_front~0_186 1) v_~q2_front~0_185) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115| (ite (= (select .cse0 (+ v_~q2~0.offset_143 (* 4 v_~q2_back~0_219))) v_~i~0_191) 1 0)) (not (= 0 (ite (and (< v_~q1_back~0_230 v_~n1~0_152) (<= 0 v_~q1_back~0_230)) 1 0))) (= (+ v_~q1_back~0_230 1) v_~q1_back~0_229) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (not (= (ite (and (< v_~q2_back~0_219 v_~n2~0_154) (<= 0 v_~q2_back~0_219)) 1 0) 0)) (= (+ v_~q2_back~0_219 1) v_~q2_back~0_218) (= v_~j~0_193 (+ (select .cse0 (+ v_~q2~0.offset_143 (* v_~q2_front~0_186 4))) 1)) (not (= (ite (= v_~j~0_194 (select (select |v_#memory_int_321| v_~q1~0.base_163) (+ v_~q1~0.offset_163 (* v_~q1_back~0_230 4)))) 1 0) 0)) (< v_~j~0_194 v_~N~0_146) (= (ite (and (<= 0 v_~q2_front~0_186) (< v_~q2_front~0_186 v_~q2_back~0_218) (< v_~q2_front~0_186 v_~n2~0_154)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| 0)) (< v_~i~0_191 v_~N~0_146))) InVars {~j~0=v_~j~0_194, ~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, ~i~0=v_~i~0_191, ~q2~0.offset=v_~q2~0.offset_143, ~n1~0=v_~n1~0_152, ~q2_front~0=v_~q2_front~0_186, ~N~0=v_~N~0_146, ~q1_back~0=v_~q1_back~0_230, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_321|, ~q2~0.base=v_~q2~0.base_143, ~q2_back~0=v_~q2_back~0_219} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_55|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_68|, ~j~0=v_~j~0_193, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_62|, ~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, ~i~0=v_~i~0_191, ~q2~0.offset=v_~q2~0.offset_143, ~n1~0=v_~n1~0_152, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|, ~q2_front~0=v_~q2_front~0_185, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_64|, ~N~0=v_~N~0_146, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_64|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|, ~q1_back~0=v_~q1_back~0_229, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_321|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, ~q2~0.base=v_~q2~0.base_143, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_55|, ~q2_back~0=v_~q2_back~0_218} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:31,078 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 02:24:44,498 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 02:24:44,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15321 [2022-12-13 02:24:44,499 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 164 transitions, 1949 flow [2022-12-13 02:24:44,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:24:44,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:44,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:44,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 02:24:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 02:24:44,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:24:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1663549503, now seen corresponding path program 1 times [2022-12-13 02:24:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651477323] [2022-12-13 02:24:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:45,405 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 02:24:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:24:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651477323] [2022-12-13 02:24:45,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651477323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:24:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765345450] [2022-12-13 02:24:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:45,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:24:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:24:45,407 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 02:24:45,408 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 02:24:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:24:45,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 02:24:45,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:24:45,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:45,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:45,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-13 02:24:45,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:45,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:45,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 02:24:45,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-13 02:24:45,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 02:24:45,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:45,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 02:24:45,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 02:24:45,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:24:45,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 02:24:45,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 20 [2022-12-13 02:24:46,059 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 02:24:46,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:24:46,685 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 02:24:46,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765345450] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:24:46,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:24:46,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:24:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716591999] [2022-12-13 02:24:46,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:24:46,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:24:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:24:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:24:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-12-13 02:24:46,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 02:24:46,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 164 transitions, 1949 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:24:46,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:24:46,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 02:24:46,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:24:50,534 INFO L130 PetriNetUnfolder]: 599/1109 cut-off events. [2022-12-13 02:24:50,534 INFO L131 PetriNetUnfolder]: For 5060/5060 co-relation queries the response was YES. [2022-12-13 02:24:50,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6238 conditions, 1109 events. 599/1109 cut-off events. For 5060/5060 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6137 event pairs, 46 based on Foata normal form. 14/1107 useless extension candidates. Maximal degree in co-relation 6058. Up to 443 conditions per place. [2022-12-13 02:24:50,540 INFO L137 encePairwiseOnDemand]: 7/52 looper letters, 86 selfloop transitions, 182 changer transitions 33/301 dead transitions. [2022-12-13 02:24:50,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 301 transitions, 3572 flow [2022-12-13 02:24:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 02:24:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-13 02:24:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 199 transitions. [2022-12-13 02:24:50,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1319628647214854 [2022-12-13 02:24:50,543 INFO L175 Difference]: Start difference. First operand has 87 places, 164 transitions, 1949 flow. Second operand 29 states and 199 transitions. [2022-12-13 02:24:50,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 301 transitions, 3572 flow [2022-12-13 02:24:50,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 301 transitions, 3496 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-13 02:24:50,563 INFO L231 Difference]: Finished difference. Result has 125 places, 220 transitions, 3225 flow [2022-12-13 02:24:50,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3225, PETRI_PLACES=125, PETRI_TRANSITIONS=220} [2022-12-13 02:24:50,564 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 103 predicate places. [2022-12-13 02:24:50,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:24:50,564 INFO L89 Accepts]: Start accepts. Operand has 125 places, 220 transitions, 3225 flow [2022-12-13 02:24:50,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:24:50,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:24:50,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 220 transitions, 3225 flow [2022-12-13 02:24:50,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 220 transitions, 3225 flow [2022-12-13 02:24:50,604 INFO L130 PetriNetUnfolder]: 149/405 cut-off events. [2022-12-13 02:24:50,604 INFO L131 PetriNetUnfolder]: For 2699/2704 co-relation queries the response was YES. [2022-12-13 02:24:50,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 405 events. 149/405 cut-off events. For 2699/2704 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2393 event pairs, 8 based on Foata normal form. 2/394 useless extension candidates. Maximal degree in co-relation 2541. Up to 116 conditions per place. [2022-12-13 02:24:50,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 220 transitions, 3225 flow [2022-12-13 02:24:50,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 02:24:50,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [770] L65-1-->L65-1: Formula: (let ((.cse1 (select |v_#memory_int_371| v_~q2~0.base_181)) (.cse0 (select |v_#memory_int_371| v_~q1~0.base_203))) (and (< v_~i~0_260 v_~N~0_186) (= v_~q1_front~0_254 (+ v_~q1_front~0_255 1)) (= (+ v_~q2_front~0_214 1) v_~q2_front~0_213) (= (+ v_~q2_back~0_305 1) v_~q2_back~0_304) (< v_~j~0_236 v_~N~0_186) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_179| 0)) (= (+ v_~q1_back~0_300 1) v_~q1_back~0_299) (not (= 0 (ite (= v_~j~0_236 (select .cse0 (+ (* v_~q1_back~0_300 4) v_~q1~0.offset_203))) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179| (ite (and (<= 0 v_~q1_front~0_255) (< v_~q1_front~0_255 v_~n1~0_192) (< v_~q1_front~0_255 v_~q1_back~0_299)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| (ite (and (< v_~q2_front~0_214 v_~n2~0_192) (<= 0 v_~q2_front~0_214) (< v_~q2_front~0_214 v_~q2_back~0_304)) 1 0)) (= v_~j~0_235 (+ (select .cse1 (+ v_~q2~0.offset_181 (* v_~q2_front~0_214 4))) 1)) (not (= (ite (and (<= 0 v_~q2_back~0_305) (< v_~q2_back~0_305 v_~n2~0_192)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ v_~q2~0.offset_181 (* 4 v_~q2_back~0_305))) v_~i~0_260) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155| 0)) (not (= (ite (and (< v_~q1_back~0_300 v_~n1~0_192) (<= 0 v_~q1_back~0_300)) 1 0) 0)) (= (+ (select .cse0 (+ (* v_~q1_front~0_255 4) v_~q1~0.offset_203)) 1) v_~i~0_259) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_179|))) InVars {~j~0=v_~j~0_236, ~q1~0.offset=v_~q1~0.offset_203, ~n2~0=v_~n2~0_192, ~q1_front~0=v_~q1_front~0_255, ~i~0=v_~i~0_260, ~q2~0.offset=v_~q2~0.offset_181, ~n1~0=v_~n1~0_192, ~q2_front~0=v_~q2_front~0_214, ~N~0=v_~N~0_186, ~q1_back~0=v_~q1_back~0_300, ~q1~0.base=v_~q1~0.base_203, #memory_int=|v_#memory_int_371|, ~q2~0.base=v_~q2~0.base_181, ~q2_back~0=v_~q2_back~0_305} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_103|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_82|, ~j~0=v_~j~0_235, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_76|, ~q1_front~0=v_~q1_front~0_254, ~q2~0.offset=v_~q2~0.offset_181, ~n1~0=v_~n1~0_192, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_76|, ~q1_back~0=v_~q1_back~0_299, ~q1~0.base=v_~q1~0.base_203, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_105|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_179|, ~q2~0.base=v_~q2~0.base_181, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_99|, ~q2_back~0=v_~q2_back~0_304, ~q1~0.offset=v_~q1~0.offset_203, ~n2~0=v_~n2~0_192, ~i~0=v_~i~0_259, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_99|, ~q2_front~0=v_~q2_front~0_213, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_94|, ~N~0=v_~N~0_186, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_94|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_179|, #memory_int=|v_#memory_int_371|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_103|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [798] L47-1-->L47-1: Formula: (and (= (ite (and (< v_~q1_front~0_331 v_~q1_back~0_381) (<= 0 v_~q1_front~0_331) (< v_~q1_front~0_331 v_~n1~0_232)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|) (= (+ v_~q2_back~0_387 1) v_~q2_back~0_386) (not (= (ite (= (select (select |v_#memory_int_421| v_~q2~0.base_219) (+ v_~q2~0.offset_219 (* 4 v_~q2_back~0_387))) v_~i~0_339) 1 0) 0)) (not (= (ite (and (<= 0 v_~q2_back~0_387) (< v_~q2_back~0_387 v_~n2~0_230)) 1 0) 0)) (= (+ (select (select |v_#memory_int_421| v_~q1~0.base_243) (+ (* v_~q1_front~0_331 4) v_~q1~0.offset_243)) 1) v_~i~0_338) (= (+ v_~q1_front~0_331 1) v_~q1_front~0_330) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_242|) (< v_~i~0_339 v_~N~0_228) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_242| 0))) InVars {~q1~0.offset=v_~q1~0.offset_243, ~q1_front~0=v_~q1_front~0_331, ~n2~0=v_~n2~0_230, ~q1_back~0=v_~q1_back~0_381, ~i~0=v_~i~0_339, ~n1~0=v_~n1~0_232, ~q2~0.offset=v_~q2~0.offset_219, ~q1~0.base=v_~q1~0.base_243, #memory_int=|v_#memory_int_421|, ~q2~0.base=v_~q2~0.base_219, ~N~0=v_~N~0_228, ~q2_back~0=v_~q2_back~0_387} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_149|, ~q1~0.offset=v_~q1~0.offset_243, ~q1_front~0=v_~q1_front~0_330, ~n2~0=v_~n2~0_230, ~i~0=v_~i~0_338, ~n1~0=v_~n1~0_232, ~q2~0.offset=v_~q2~0.offset_219, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_143|, ~N~0=v_~N~0_228, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|, ~q1_back~0=v_~q1_back~0_381, ~q1~0.base=v_~q1~0.base_243, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_149|, #memory_int=|v_#memory_int_421|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_242|, ~q2~0.base=v_~q2~0.base_219, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_143|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_149|, ~q2_back~0=v_~q2_back~0_386} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:24:50,616 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,616 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,616 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,616 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,616 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,616 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,616 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,617 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,617 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,617 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,617 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:50,617 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:51,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_281| v_~q1~0.base_137))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| 0)) (= v_~q1_front~0_164 (+ v_~q1_front~0_165 1)) (= (+ (select .cse0 (+ v_~q1~0.offset_137 (* v_~q1_front~0_165 4))) 1) v_~i~0_161) (< v_~j~0_165 v_~N~0_120) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| 0)) (= (+ v_~q1_back~0_186 1) v_~q1_back~0_185) (= (ite (and (<= 0 v_~q1_front~0_165) (< v_~q1_front~0_165 v_~n1~0_126) (< v_~q1_front~0_165 v_~q1_back~0_185)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (= (ite (= v_~j~0_165 (select .cse0 (+ v_~q1~0.offset_137 (* v_~q1_back~0_186 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (not (= (ite (and (<= 0 v_~q1_back~0_186) (< v_~q1_back~0_186 v_~n1~0_126)) 1 0) 0)))) InVars {~j~0=v_~j~0_165, ~q1~0.offset=v_~q1~0.offset_137, ~q1_front~0=v_~q1_front~0_165, ~q1_back~0=v_~q1_back~0_186, ~n1~0=v_~n1~0_126, ~q1~0.base=v_~q1~0.base_137, #memory_int=|v_#memory_int_281|, ~N~0=v_~N~0_120} OutVars{~j~0=v_~j~0_165, ~q1~0.offset=v_~q1~0.offset_137, ~q1_front~0=v_~q1_front~0_164, ~i~0=v_~i~0_161, ~n1~0=v_~n1~0_126, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_46|, ~N~0=v_~N~0_120, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_46|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, ~q1_back~0=v_~q1_back~0_185, ~q1~0.base=v_~q1~0.base_137, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_61|, #memory_int=|v_#memory_int_281|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_91|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_55|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:24:52,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [814] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_477| v_~q1~0.base_275))) (and (= v_~q1_front~0_370 (+ v_~q1_front~0_371 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_234| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_234|) (= (ite (and (<= 0 v_~q1_front~0_371) (< v_~q1_front~0_371 v_~n1~0_262) (< v_~q1_front~0_371 v_~q1_back~0_427)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277|) (= v_~j~0_344 (+ (select (select |v_#memory_int_477| v_~q2~0.base_250) (+ v_~q2~0.offset_250 (* v_~q2_front~0_300 4))) 1)) (= (+ v_~q1_back~0_428 1) v_~q1_back~0_427) (= (+ 1 (select .cse0 (+ (* v_~q1_front~0_371 4) v_~q1~0.offset_275))) v_~i~0_381) (< v_~j~0_345 v_~N~0_258) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_234| 0)) (= (+ v_~q2_front~0_300 1) v_~q2_front~0_299) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_277| 0)) (not (= (ite (= v_~j~0_345 (select .cse0 (+ v_~q1~0.offset_275 (* v_~q1_back~0_428 4)))) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_428 v_~n1~0_262) (<= 0 v_~q1_back~0_428)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_234| (ite (and (< v_~q2_front~0_300 v_~n2~0_258) (< v_~q2_front~0_300 v_~q2_back~0_434) (<= 0 v_~q2_front~0_300)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_277|))) InVars {~j~0=v_~j~0_345, ~q1~0.offset=v_~q1~0.offset_275, ~n2~0=v_~n2~0_258, ~q1_front~0=v_~q1_front~0_371, ~q2~0.offset=v_~q2~0.offset_250, ~n1~0=v_~n1~0_262, ~q2_front~0=v_~q2_front~0_300, ~N~0=v_~N~0_258, ~q1_back~0=v_~q1_back~0_428, ~q1~0.base=v_~q1~0.base_275, #memory_int=|v_#memory_int_477|, ~q2~0.base=v_~q2~0.base_250, ~q2_back~0=v_~q2_back~0_434} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_128|, ~j~0=v_~j~0_344, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_122|, ~q1_front~0=v_~q1_front~0_370, ~q2~0.offset=v_~q2~0.offset_250, ~n1~0=v_~n1~0_262, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_234|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_122|, ~q1_back~0=v_~q1_back~0_427, ~q1~0.base=v_~q1~0.base_275, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_169|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_277|, ~q2~0.base=v_~q2~0.base_250, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_163|, ~q2_back~0=v_~q2_back~0_434, ~q1~0.offset=v_~q1~0.offset_275, ~n2~0=v_~n2~0_258, ~i~0=v_~i~0_381, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_163|, ~q2_front~0=v_~q2_front~0_299, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_156|, ~N~0=v_~N~0_258, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_156|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_234|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_277|, #memory_int=|v_#memory_int_477|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:24:52,545 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:52,546 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:52,546 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:52,546 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:52,546 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:52,546 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:52,546 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:52,546 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:53,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [818] L65-1-->L70: Formula: (let ((.cse0 (+ v_~q1_front~0_383 1)) (.cse1 (select |v_#memory_int_483| v_~q1~0.base_281))) (and (= .cse0 v_~q1_front~0_382) (not (= (ite (and (< v_~q1_back~0_439 (+ v_~n1~0_268 1)) (<= 1 v_~q1_back~0_439)) 1 0) 0)) (< v_~j~0_357 v_~N~0_264) (= (ite (and (< .cse0 v_~q1_back~0_439) (<= 0 v_~q1_front~0_383) (< v_~q1_front~0_383 v_~n1~0_268)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|) (< v_~j~0_356 v_~N~0_264) (not (= (ite (= v_~j~0_357 (select .cse1 (+ (* v_~q1_back~0_441 4) v_~q1~0.offset_281))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_244| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_244|) (= v_~j~0_356 (+ (select (select |v_#memory_int_483| v_~q2~0.base_256) (+ v_~q2~0.offset_256 (* v_~q2_front~0_312 4))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_244| 0)) (not (= (ite (and (<= 0 v_~q2_front~0_312) (< v_~q2_front~0_312 v_~q2_back~0_444) (< v_~q2_front~0_312 v_~n2~0_264)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_244| (ite (= v_~j~0_356 (select .cse1 (+ v_~q1~0.offset_281 (- 4) (* v_~q1_back~0_439 4)))) 1 0)) (= (+ 2 v_~q1_back~0_441) v_~q1_back~0_439) (= (+ v_~q2_front~0_312 1) v_~q2_front~0_311) (= (+ (select .cse1 (+ v_~q1~0.offset_281 (* v_~q1_front~0_383 4))) 1) v_~i~0_387) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|))) InVars {~j~0=v_~j~0_357, ~q1~0.offset=v_~q1~0.offset_281, ~q1_front~0=v_~q1_front~0_383, ~n2~0=v_~n2~0_264, ~n1~0=v_~n1~0_268, ~q2~0.offset=v_~q2~0.offset_256, ~q2_front~0=v_~q2_front~0_312, ~N~0=v_~N~0_264, ~q1_back~0=v_~q1_back~0_441, ~q1~0.base=v_~q1~0.base_281, #memory_int=|v_#memory_int_483|, ~q2~0.base=v_~q2~0.base_256, ~q2_back~0=v_~q2_back~0_444} OutVars{~j~0=v_~j~0_356, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_134|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_128|, ~q1_front~0=v_~q1_front~0_382, ~n1~0=v_~n1~0_268, ~q2~0.offset=v_~q2~0.offset_256, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_244|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_128|, ~q1_back~0=v_~q1_back~0_439, ~q1~0.base=v_~q1~0.base_281, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|, ~q2~0.base=v_~q2~0.base_256, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_169|, ~q2_back~0=v_~q2_back~0_444, ~q1~0.offset=v_~q1~0.offset_281, ~n2~0=v_~n2~0_264, ~i~0=v_~i~0_387, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_169|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_162|, ~q2_front~0=v_~q2_front~0_311, ~N~0=v_~N~0_264, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_162|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_244|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|, #memory_int=|v_#memory_int_483|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:24:53,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [818] L65-1-->L70: Formula: (let ((.cse0 (+ v_~q1_front~0_383 1)) (.cse1 (select |v_#memory_int_483| v_~q1~0.base_281))) (and (= .cse0 v_~q1_front~0_382) (not (= (ite (and (< v_~q1_back~0_439 (+ v_~n1~0_268 1)) (<= 1 v_~q1_back~0_439)) 1 0) 0)) (< v_~j~0_357 v_~N~0_264) (= (ite (and (< .cse0 v_~q1_back~0_439) (<= 0 v_~q1_front~0_383) (< v_~q1_front~0_383 v_~n1~0_268)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|) (< v_~j~0_356 v_~N~0_264) (not (= (ite (= v_~j~0_357 (select .cse1 (+ (* v_~q1_back~0_441 4) v_~q1~0.offset_281))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_244| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_244|) (= v_~j~0_356 (+ (select (select |v_#memory_int_483| v_~q2~0.base_256) (+ v_~q2~0.offset_256 (* v_~q2_front~0_312 4))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_244| 0)) (not (= (ite (and (<= 0 v_~q2_front~0_312) (< v_~q2_front~0_312 v_~q2_back~0_444) (< v_~q2_front~0_312 v_~n2~0_264)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_244| (ite (= v_~j~0_356 (select .cse1 (+ v_~q1~0.offset_281 (- 4) (* v_~q1_back~0_439 4)))) 1 0)) (= (+ 2 v_~q1_back~0_441) v_~q1_back~0_439) (= (+ v_~q2_front~0_312 1) v_~q2_front~0_311) (= (+ (select .cse1 (+ v_~q1~0.offset_281 (* v_~q1_front~0_383 4))) 1) v_~i~0_387) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|))) InVars {~j~0=v_~j~0_357, ~q1~0.offset=v_~q1~0.offset_281, ~q1_front~0=v_~q1_front~0_383, ~n2~0=v_~n2~0_264, ~n1~0=v_~n1~0_268, ~q2~0.offset=v_~q2~0.offset_256, ~q2_front~0=v_~q2_front~0_312, ~N~0=v_~N~0_264, ~q1_back~0=v_~q1_back~0_441, ~q1~0.base=v_~q1~0.base_281, #memory_int=|v_#memory_int_483|, ~q2~0.base=v_~q2~0.base_256, ~q2_back~0=v_~q2_back~0_444} OutVars{~j~0=v_~j~0_356, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_134|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_128|, ~q1_front~0=v_~q1_front~0_382, ~n1~0=v_~n1~0_268, ~q2~0.offset=v_~q2~0.offset_256, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_244|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_128|, ~q1_back~0=v_~q1_back~0_439, ~q1~0.base=v_~q1~0.base_281, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_287|, ~q2~0.base=v_~q2~0.base_256, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_169|, ~q2_back~0=v_~q2_back~0_444, ~q1~0.offset=v_~q1~0.offset_281, ~n2~0=v_~n2~0_264, ~i~0=v_~i~0_387, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_169|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_162|, ~q2_front~0=v_~q2_front~0_311, ~N~0=v_~N~0_264, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_162|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_244|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_287|, #memory_int=|v_#memory_int_483|} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] and [706] L47-1-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= v_~j~0_119 (+ (select (select |v_#memory_int_217| v_~q2~0.base_80) (+ (* v_~q2_front~0_111 4) v_~q2~0.offset_80)) 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (ite (and (< v_~q2_front~0_111 v_~q2_back~0_131) (< v_~q2_front~0_111 v_~n2~0_94) (<= 0 v_~q2_front~0_111)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q2_front~0_111 1) v_~q2_front~0_110) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (< v_~i~0_123 v_~N~0_78))) InVars {~n2~0=v_~n2~0_94, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, #memory_int=|v_#memory_int_217|, ~q2_front~0=v_~q2_front~0_111, ~q2~0.base=v_~q2~0.base_80, ~N~0=v_~N~0_78, ~q2_back~0=v_~q2_back~0_131} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_34|, ~j~0=v_~j~0_119, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_28|, ~n2~0=v_~n2~0_94, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, ~q2_front~0=v_~q2_front~0_110, ~N~0=v_~N~0_78, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_28|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, #memory_int=|v_#memory_int_217|, ~q2~0.base=v_~q2~0.base_80, ~q2_back~0=v_~q2_back~0_131, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 02:24:54,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [797] L65-1-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_25| 0) (= (+ v_~q1_front~0_327 1) v_~q1_front~0_326) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_240| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240| 0)) (= (+ (select (select |v_#memory_int_419| v_~q1~0.base_241) (+ v_~q1~0.offset_241 (* v_~q1_front~0_327 4))) 1) v_~i~0_336) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_240| (ite (and (< v_~q1_front~0_327 v_~q1_back~0_379) (<= 0 v_~q1_front~0_327) (< v_~q1_front~0_327 v_~n1~0_230)) 1 0)) (not (< v_~j~0_303 v_~N~0_226)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_25|)) InVars {~j~0=v_~j~0_303, ~q1~0.offset=v_~q1~0.offset_241, ~q1_front~0=v_~q1_front~0_327, ~q1_back~0=v_~q1_back~0_379, ~n1~0=v_~n1~0_230, ~q1~0.base=v_~q1~0.base_241, #memory_int=|v_#memory_int_419|, ~N~0=v_~N~0_226} OutVars{~j~0=v_~j~0_303, ~q1~0.offset=v_~q1~0.offset_241, ~q1_front~0=v_~q1_front~0_326, ~i~0=v_~i~0_336, ~n1~0=v_~n1~0_230, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_141|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_25|, ~N~0=v_~N~0_226, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_240|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_25|, ~q1_back~0=v_~q1_back~0_379, ~q1~0.base=v_~q1~0.base_241, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_147|, #memory_int=|v_#memory_int_419|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_141|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,044 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,045 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,045 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,045 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,045 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L47-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_392| v_~q1~0.base_219)) (.cse1 (select |v_#memory_int_392| v_~q2~0.base_197))) (and (not (= (ite (and (< v_~q1_back~0_335 v_~n1~0_208) (<= 0 v_~q1_back~0_335)) 1 0) 0)) (= (+ v_~q2_back~0_340 1) v_~q2_back~0_339) (= (+ (select .cse0 (+ v_~q1~0.offset_219 (* v_~q1_front~0_286 4))) 1) v_~i~0_293) (< v_~j~0_266 v_~N~0_202) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203| 0)) (= (+ v_~q1_back~0_335 1) v_~q1_back~0_334) (= v_~q2_front~0_236 (+ v_~q2_front~0_237 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| (ite (and (<= 0 v_~q2_front~0_237) (< v_~q2_front~0_237 v_~n2~0_208) (< v_~q2_front~0_237 v_~q2_back~0_339)) 1 0)) (not (= (ite (and (<= 0 v_~q2_back~0_340) (< v_~q2_back~0_340 v_~n2~0_208)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ (* 4 v_~q2_back~0_340) v_~q2~0.offset_197)) v_~i~0_294) 1 0) 0)) (not (= (ite (= v_~j~0_266 (select .cse0 (+ (* v_~q1_back~0_335 4) v_~q1~0.offset_219))) 1 0) 0)) (= (+ v_~q1_front~0_286 1) v_~q1_front~0_285) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203| (ite (and (<= 0 v_~q1_front~0_286) (< v_~q1_front~0_286 v_~n1~0_208) (< v_~q1_front~0_286 v_~q1_back~0_334)) 1 0)) (< v_~i~0_294 v_~N~0_202) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181| 0)) (= v_~j~0_265 (+ (select .cse1 (+ v_~q2~0.offset_197 (* v_~q2_front~0_237 4))) 1)))) InVars {~j~0=v_~j~0_266, ~q1~0.offset=v_~q1~0.offset_219, ~n2~0=v_~n2~0_208, ~q1_front~0=v_~q1_front~0_286, ~i~0=v_~i~0_294, ~q2~0.offset=v_~q2~0.offset_197, ~n1~0=v_~n1~0_208, ~q2_front~0=v_~q2_front~0_237, ~N~0=v_~N~0_202, ~q1_back~0=v_~q1_back~0_335, ~q1~0.base=v_~q1~0.base_219, #memory_int=|v_#memory_int_392|, ~q2~0.base=v_~q2~0.base_197, ~q2_back~0=v_~q2_back~0_340} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_123|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_96|, ~j~0=v_~j~0_265, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_90|, ~q1_front~0=v_~q1_front~0_285, ~q2~0.offset=v_~q2~0.offset_197, ~n1~0=v_~n1~0_208, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_90|, ~q1_back~0=v_~q1_back~0_334, ~q1~0.base=v_~q1~0.base_219, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|, ~q2~0.base=v_~q2~0.base_197, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_117|, ~q2_back~0=v_~q2_back~0_339, ~q1~0.offset=v_~q1~0.offset_219, ~n2~0=v_~n2~0_208, ~i~0=v_~i~0_293, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_117|, ~q2_front~0=v_~q2_front~0_236, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_114|, ~N~0=v_~N~0_202, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_114|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203|, #memory_int=|v_#memory_int_392|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_123|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,887 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,888 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:55,888 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L47-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_392| v_~q1~0.base_219)) (.cse1 (select |v_#memory_int_392| v_~q2~0.base_197))) (and (not (= (ite (and (< v_~q1_back~0_335 v_~n1~0_208) (<= 0 v_~q1_back~0_335)) 1 0) 0)) (= (+ v_~q2_back~0_340 1) v_~q2_back~0_339) (= (+ (select .cse0 (+ v_~q1~0.offset_219 (* v_~q1_front~0_286 4))) 1) v_~i~0_293) (< v_~j~0_266 v_~N~0_202) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203| 0)) (= (+ v_~q1_back~0_335 1) v_~q1_back~0_334) (= v_~q2_front~0_236 (+ v_~q2_front~0_237 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| (ite (and (<= 0 v_~q2_front~0_237) (< v_~q2_front~0_237 v_~n2~0_208) (< v_~q2_front~0_237 v_~q2_back~0_339)) 1 0)) (not (= (ite (and (<= 0 v_~q2_back~0_340) (< v_~q2_back~0_340 v_~n2~0_208)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ (* 4 v_~q2_back~0_340) v_~q2~0.offset_197)) v_~i~0_294) 1 0) 0)) (not (= (ite (= v_~j~0_266 (select .cse0 (+ (* v_~q1_back~0_335 4) v_~q1~0.offset_219))) 1 0) 0)) (= (+ v_~q1_front~0_286 1) v_~q1_front~0_285) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203| (ite (and (<= 0 v_~q1_front~0_286) (< v_~q1_front~0_286 v_~n1~0_208) (< v_~q1_front~0_286 v_~q1_back~0_334)) 1 0)) (< v_~i~0_294 v_~N~0_202) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181| 0)) (= v_~j~0_265 (+ (select .cse1 (+ v_~q2~0.offset_197 (* v_~q2_front~0_237 4))) 1)))) InVars {~j~0=v_~j~0_266, ~q1~0.offset=v_~q1~0.offset_219, ~n2~0=v_~n2~0_208, ~q1_front~0=v_~q1_front~0_286, ~i~0=v_~i~0_294, ~q2~0.offset=v_~q2~0.offset_197, ~n1~0=v_~n1~0_208, ~q2_front~0=v_~q2_front~0_237, ~N~0=v_~N~0_202, ~q1_back~0=v_~q1_back~0_335, ~q1~0.base=v_~q1~0.base_219, #memory_int=|v_#memory_int_392|, ~q2~0.base=v_~q2~0.base_197, ~q2_back~0=v_~q2_back~0_340} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_123|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_96|, ~j~0=v_~j~0_265, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_90|, ~q1_front~0=v_~q1_front~0_285, ~q2~0.offset=v_~q2~0.offset_197, ~n1~0=v_~n1~0_208, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_90|, ~q1_back~0=v_~q1_back~0_334, ~q1~0.base=v_~q1~0.base_219, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|, ~q2~0.base=v_~q2~0.base_197, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_117|, ~q2_back~0=v_~q2_back~0_339, ~q1~0.offset=v_~q1~0.offset_219, ~n2~0=v_~n2~0_208, ~i~0=v_~i~0_293, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_117|, ~q2_front~0=v_~q2_front~0_236, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_114|, ~N~0=v_~N~0_202, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_114|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203|, #memory_int=|v_#memory_int_392|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_123|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [822] L47-1-->L47-1: Formula: (and (= (+ v_~q1_front~0_399 1) v_~q1_front~0_398) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| (ite (and (<= 0 v_~q1_front~0_399) (< v_~q1_front~0_399 v_~n1~0_276) (< v_~q1_front~0_399 v_~q1_back~0_457)) 1 0)) (not (= (ite (= v_~i~0_396 (select (select |v_#memory_int_491| v_~q2~0.base_264) (+ v_~q2~0.offset_264 (* 4 v_~q2_back~0_455)))) 1 0) 0)) (= (+ (select (select |v_#memory_int_491| v_~q1~0.base_289) (+ v_~q1~0.offset_289 (* v_~q1_front~0_399 4))) 1) v_~i~0_395) (= (+ v_~q2_back~0_455 1) v_~q2_back~0_454) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_297|) (< v_~i~0_396 v_~N~0_272) (not (= (ite (and (< v_~q2_back~0_455 v_~n2~0_272) (<= 0 v_~q2_back~0_455)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_297| 0))) InVars {~q1~0.offset=v_~q1~0.offset_289, ~q1_front~0=v_~q1_front~0_399, ~n2~0=v_~n2~0_272, ~q1_back~0=v_~q1_back~0_457, ~i~0=v_~i~0_396, ~n1~0=v_~n1~0_276, ~q2~0.offset=v_~q2~0.offset_264, ~q1~0.base=v_~q1~0.base_289, #memory_int=|v_#memory_int_491|, ~q2~0.base=v_~q2~0.base_264, ~N~0=v_~N~0_272, ~q2_back~0=v_~q2_back~0_455} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_177|, ~q1~0.offset=v_~q1~0.offset_289, ~q1_front~0=v_~q1_front~0_398, ~n2~0=v_~n2~0_272, ~i~0=v_~i~0_395, ~n1~0=v_~n1~0_276, ~q2~0.offset=v_~q2~0.offset_264, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_177|, ~N~0=v_~N~0_272, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_297|, ~q1_back~0=v_~q1_back~0_457, ~q1~0.base=v_~q1~0.base_289, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_183|, #memory_int=|v_#memory_int_491|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_297|, ~q2~0.base=v_~q2~0.base_264, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_177|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_177|, ~q2_back~0=v_~q2_back~0_454} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,612 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:56,613 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L47-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_392| v_~q1~0.base_219)) (.cse1 (select |v_#memory_int_392| v_~q2~0.base_197))) (and (not (= (ite (and (< v_~q1_back~0_335 v_~n1~0_208) (<= 0 v_~q1_back~0_335)) 1 0) 0)) (= (+ v_~q2_back~0_340 1) v_~q2_back~0_339) (= (+ (select .cse0 (+ v_~q1~0.offset_219 (* v_~q1_front~0_286 4))) 1) v_~i~0_293) (< v_~j~0_266 v_~N~0_202) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203| 0)) (= (+ v_~q1_back~0_335 1) v_~q1_back~0_334) (= v_~q2_front~0_236 (+ v_~q2_front~0_237 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| (ite (and (<= 0 v_~q2_front~0_237) (< v_~q2_front~0_237 v_~n2~0_208) (< v_~q2_front~0_237 v_~q2_back~0_339)) 1 0)) (not (= (ite (and (<= 0 v_~q2_back~0_340) (< v_~q2_back~0_340 v_~n2~0_208)) 1 0) 0)) (not (= (ite (= (select .cse1 (+ (* 4 v_~q2_back~0_340) v_~q2~0.offset_197)) v_~i~0_294) 1 0) 0)) (not (= (ite (= v_~j~0_266 (select .cse0 (+ (* v_~q1_back~0_335 4) v_~q1~0.offset_219))) 1 0) 0)) (= (+ v_~q1_front~0_286 1) v_~q1_front~0_285) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203| (ite (and (<= 0 v_~q1_front~0_286) (< v_~q1_front~0_286 v_~n1~0_208) (< v_~q1_front~0_286 v_~q1_back~0_334)) 1 0)) (< v_~i~0_294 v_~N~0_202) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181| 0)) (= v_~j~0_265 (+ (select .cse1 (+ v_~q2~0.offset_197 (* v_~q2_front~0_237 4))) 1)))) InVars {~j~0=v_~j~0_266, ~q1~0.offset=v_~q1~0.offset_219, ~n2~0=v_~n2~0_208, ~q1_front~0=v_~q1_front~0_286, ~i~0=v_~i~0_294, ~q2~0.offset=v_~q2~0.offset_197, ~n1~0=v_~n1~0_208, ~q2_front~0=v_~q2_front~0_237, ~N~0=v_~N~0_202, ~q1_back~0=v_~q1_back~0_335, ~q1~0.base=v_~q1~0.base_219, #memory_int=|v_#memory_int_392|, ~q2~0.base=v_~q2~0.base_197, ~q2_back~0=v_~q2_back~0_340} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_123|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_96|, ~j~0=v_~j~0_265, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_90|, ~q1_front~0=v_~q1_front~0_285, ~q2~0.offset=v_~q2~0.offset_197, ~n1~0=v_~n1~0_208, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_90|, ~q1_back~0=v_~q1_back~0_334, ~q1~0.base=v_~q1~0.base_219, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_203|, ~q2~0.base=v_~q2~0.base_197, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_117|, ~q2_back~0=v_~q2_back~0_339, ~q1~0.offset=v_~q1~0.offset_219, ~n2~0=v_~n2~0_208, ~i~0=v_~i~0_293, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_117|, ~q2_front~0=v_~q2_front~0_236, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_114|, ~N~0=v_~N~0_202, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_114|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_203|, #memory_int=|v_#memory_int_392|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_123|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [823] L47-1-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_35| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_35|) (= (ite (and (<= 0 v_~q1_front~0_403) (< v_~q1_front~0_403 v_~q1_back~0_459) (< v_~q1_front~0_403 v_~n1~0_278)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301|) (= v_~q1_front~0_402 (+ v_~q1_front~0_403 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301| 0)) (< v_~i~0_400 v_~N~0_274) (= (+ v_~q2_back~0_459 1) v_~q2_back~0_458) (not (= (ite (and (<= 0 v_~q2_back~0_459) (< v_~q2_back~0_459 v_~n2~0_274)) 1 0) 0)) (= (+ (select (select |v_#memory_int_493| v_~q1~0.base_291) (+ v_~q1~0.offset_291 (* v_~q1_front~0_403 4))) 1) v_~i~0_399) (not (= (ite (= (select (select |v_#memory_int_493| v_~q2~0.base_266) (+ v_~q2~0.offset_266 (* 4 v_~q2_back~0_459))) v_~i~0_400) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|) (not (< v_~j~0_376 v_~N~0_274))) InVars {~j~0=v_~j~0_376, ~q1~0.offset=v_~q1~0.offset_291, ~q1_front~0=v_~q1_front~0_403, ~n2~0=v_~n2~0_274, ~i~0=v_~i~0_400, ~n1~0=v_~n1~0_278, ~q2~0.offset=v_~q2~0.offset_266, ~N~0=v_~N~0_274, ~q1_back~0=v_~q1_back~0_459, ~q1~0.base=v_~q1~0.base_291, #memory_int=|v_#memory_int_493|, ~q2~0.base=v_~q2~0.base_266, ~q2_back~0=v_~q2_back~0_459} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_179|, ~j~0=v_~j~0_376, ~q1~0.offset=v_~q1~0.offset_291, ~q1_front~0=v_~q1_front~0_402, ~n2~0=v_~n2~0_274, ~i~0=v_~i~0_399, ~n1~0=v_~n1~0_278, ~q2~0.offset=v_~q2~0.offset_266, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_179|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_35|, ~N~0=v_~N~0_274, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_301|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_35|, ~q1_back~0=v_~q1_back~0_459, ~q1~0.base=v_~q1~0.base_291, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_185|, #memory_int=|v_#memory_int_493|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_301|, ~q2~0.base=v_~q2~0.base_266, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_179|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_179|, ~q2_back~0=v_~q2_back~0_458} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:24:57,622 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,622 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:57,623 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:24:58,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [797] L65-1-->L47-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_25| 0) (= (+ v_~q1_front~0_327 1) v_~q1_front~0_326) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_240| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240| 0)) (= (+ (select (select |v_#memory_int_419| v_~q1~0.base_241) (+ v_~q1~0.offset_241 (* v_~q1_front~0_327 4))) 1) v_~i~0_336) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_240| (ite (and (< v_~q1_front~0_327 v_~q1_back~0_379) (<= 0 v_~q1_front~0_327) (< v_~q1_front~0_327 v_~n1~0_230)) 1 0)) (not (< v_~j~0_303 v_~N~0_226)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_25|)) InVars {~j~0=v_~j~0_303, ~q1~0.offset=v_~q1~0.offset_241, ~q1_front~0=v_~q1_front~0_327, ~q1_back~0=v_~q1_back~0_379, ~n1~0=v_~n1~0_230, ~q1~0.base=v_~q1~0.base_241, #memory_int=|v_#memory_int_419|, ~N~0=v_~N~0_226} OutVars{~j~0=v_~j~0_303, ~q1~0.offset=v_~q1~0.offset_241, ~q1_front~0=v_~q1_front~0_326, ~i~0=v_~i~0_336, ~n1~0=v_~n1~0_230, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_141|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_25|, ~N~0=v_~N~0_226, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_240|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_25|, ~q1_back~0=v_~q1_back~0_379, ~q1~0.base=v_~q1~0.base_241, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_147|, #memory_int=|v_#memory_int_419|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_240|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_141|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:58,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:24:58,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [763] L96-4-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_165|) (= (ite (and (< v_~q1_front~0_237 v_~n1~0_184) (< v_~q1_front~0_237 v_~q1_back~0_285) (<= 0 v_~q1_front~0_237)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|) (= (+ (select (select |v_#memory_int_361| v_~q1~0.base_195) (+ (* v_~q1_front~0_237 4) v_~q1~0.offset_195)) 1) v_~i~0_243) (= |v_#pthreadsForks_82| |v_ULTIMATE.start_main_#t~pre20#1_69|) (= (store |v_#memory_int_362| |v_ULTIMATE.start_main_~#t2~0#1.base_65| (store (select |v_#memory_int_362| |v_ULTIMATE.start_main_~#t2~0#1.base_65|) |v_ULTIMATE.start_main_~#t2~0#1.offset_65| |v_ULTIMATE.start_main_#t~pre20#1_69|)) |v_#memory_int_361|) (= |v_#pthreadsForks_81| (+ |v_#pthreadsForks_82| 1)) (= (+ v_~q1_front~0_237 1) v_~q1_front~0_236) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_165| 0))) InVars {~q1~0.offset=v_~q1~0.offset_195, ~q1_front~0=v_~q1_front~0_237, #pthreadsForks=|v_#pthreadsForks_82|, ~q1_back~0=v_~q1_back~0_285, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_65|, ~n1~0=v_~n1~0_184, ~q1~0.base=v_~q1~0.base_195, #memory_int=|v_#memory_int_362|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_69|, ~q1~0.offset=v_~q1~0.offset_195, ~q1_front~0=v_~q1_front~0_236, ~i~0=v_~i~0_243, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_65|, ~n1~0=v_~n1~0_184, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_89|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_165|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_69|, #pthreadsForks=|v_#pthreadsForks_81|, ~q1_back~0=v_~q1_back~0_285, ~q1~0.base=v_~q1~0.base_195, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_95|, #memory_int=|v_#memory_int_361|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_165|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_89|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_53|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_65|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, ~q1_front~0, #pthreadsForks, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 02:24:59,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 02:24:59,290 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 02:24:59,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8727 [2022-12-13 02:24:59,291 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 215 transitions, 3256 flow [2022-12-13 02:24:59,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:24:59,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:24:59,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:24:59,296 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 02:24:59,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:24:59,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:24:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:24:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1591825014, now seen corresponding path program 1 times [2022-12-13 02:24:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:24:59,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164363148] [2022-12-13 02:24:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:24:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:24:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:00,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164363148] [2022-12-13 02:25:00,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164363148] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:00,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836999219] [2022-12-13 02:25:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:00,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:00,468 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 02:25:00,470 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 02:25:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:00,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:25:00,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:00,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:00,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2022-12-13 02:25:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:00,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:00,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:00,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 126 [2022-12-13 02:25:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:01,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836999219] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:01,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:01,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-13 02:25:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85403414] [2022-12-13 02:25:01,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:01,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:25:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:01,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:25:01,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:25:01,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 02:25:01,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 215 transitions, 3256 flow. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:01,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:01,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 02:25:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:03,269 INFO L130 PetriNetUnfolder]: 490/888 cut-off events. [2022-12-13 02:25:03,270 INFO L131 PetriNetUnfolder]: For 8951/8951 co-relation queries the response was YES. [2022-12-13 02:25:03,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6513 conditions, 888 events. 490/888 cut-off events. For 8951/8951 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4529 event pairs, 44 based on Foata normal form. 14/887 useless extension candidates. Maximal degree in co-relation 6371. Up to 510 conditions per place. [2022-12-13 02:25:03,277 INFO L137 encePairwiseOnDemand]: 18/57 looper letters, 116 selfloop transitions, 120 changer transitions 7/243 dead transitions. [2022-12-13 02:25:03,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 243 transitions, 3683 flow [2022-12-13 02:25:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:25:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:25:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2022-12-13 02:25:03,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19838056680161945 [2022-12-13 02:25:03,278 INFO L175 Difference]: Start difference. First operand has 113 places, 215 transitions, 3256 flow. Second operand 13 states and 147 transitions. [2022-12-13 02:25:03,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 243 transitions, 3683 flow [2022-12-13 02:25:03,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 243 transitions, 3114 flow, removed 134 selfloop flow, removed 12 redundant places. [2022-12-13 02:25:03,310 INFO L231 Difference]: Finished difference. Result has 118 places, 187 transitions, 2782 flow [2022-12-13 02:25:03,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1964, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2782, PETRI_PLACES=118, PETRI_TRANSITIONS=187} [2022-12-13 02:25:03,311 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 96 predicate places. [2022-12-13 02:25:03,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:03,311 INFO L89 Accepts]: Start accepts. Operand has 118 places, 187 transitions, 2782 flow [2022-12-13 02:25:03,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:03,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:03,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 187 transitions, 2782 flow [2022-12-13 02:25:03,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 187 transitions, 2782 flow [2022-12-13 02:25:03,349 INFO L130 PetriNetUnfolder]: 129/341 cut-off events. [2022-12-13 02:25:03,349 INFO L131 PetriNetUnfolder]: For 1686/1687 co-relation queries the response was YES. [2022-12-13 02:25:03,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 341 events. 129/341 cut-off events. For 1686/1687 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1886 event pairs, 7 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 2014. Up to 103 conditions per place. [2022-12-13 02:25:03,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 187 transitions, 2782 flow [2022-12-13 02:25:03,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,679 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,680 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,680 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:03,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L65-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_321| v_~q2~0.base_143))) (and (= (+ v_~q2_front~0_186 1) v_~q2_front~0_185) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115| (ite (= (select .cse0 (+ v_~q2~0.offset_143 (* 4 v_~q2_back~0_219))) v_~i~0_191) 1 0)) (not (= 0 (ite (and (< v_~q1_back~0_230 v_~n1~0_152) (<= 0 v_~q1_back~0_230)) 1 0))) (= (+ v_~q1_back~0_230 1) v_~q1_back~0_229) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (not (= (ite (and (< v_~q2_back~0_219 v_~n2~0_154) (<= 0 v_~q2_back~0_219)) 1 0) 0)) (= (+ v_~q2_back~0_219 1) v_~q2_back~0_218) (= v_~j~0_193 (+ (select .cse0 (+ v_~q2~0.offset_143 (* v_~q2_front~0_186 4))) 1)) (not (= (ite (= v_~j~0_194 (select (select |v_#memory_int_321| v_~q1~0.base_163) (+ v_~q1~0.offset_163 (* v_~q1_back~0_230 4)))) 1 0) 0)) (< v_~j~0_194 v_~N~0_146) (= (ite (and (<= 0 v_~q2_front~0_186) (< v_~q2_front~0_186 v_~q2_back~0_218) (< v_~q2_front~0_186 v_~n2~0_154)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| 0)) (< v_~i~0_191 v_~N~0_146))) InVars {~j~0=v_~j~0_194, ~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, ~i~0=v_~i~0_191, ~q2~0.offset=v_~q2~0.offset_143, ~n1~0=v_~n1~0_152, ~q2_front~0=v_~q2_front~0_186, ~N~0=v_~N~0_146, ~q1_back~0=v_~q1_back~0_230, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_321|, ~q2~0.base=v_~q2~0.base_143, ~q2_back~0=v_~q2_back~0_219} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_55|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_68|, ~j~0=v_~j~0_193, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_62|, ~q1~0.offset=v_~q1~0.offset_163, ~n2~0=v_~n2~0_154, ~i~0=v_~i~0_191, ~q2~0.offset=v_~q2~0.offset_143, ~n1~0=v_~n1~0_152, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|, ~q2_front~0=v_~q2_front~0_185, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_64|, ~N~0=v_~N~0_146, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_64|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_62|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|, ~q1_back~0=v_~q1_back~0_229, ~q1~0.base=v_~q1~0.base_163, #memory_int=|v_#memory_int_321|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, ~q2~0.base=v_~q2~0.base_143, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_55|, ~q2_back~0=v_~q2_back~0_218} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:25:04,313 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:04,314 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:04,314 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:04,314 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:04,314 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:04,314 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:04,314 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:04,314 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:05,027 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 02:25:05,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1717 [2022-12-13 02:25:05,028 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 186 transitions, 2811 flow [2022-12-13 02:25:05,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:05,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:05,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:05,037 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 02:25:05,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:05,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -226844015, now seen corresponding path program 1 times [2022-12-13 02:25:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834233860] [2022-12-13 02:25:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834233860] [2022-12-13 02:25:05,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834233860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:05,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:05,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849640942] [2022-12-13 02:25:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:05,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:05,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 02:25:05,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 186 transitions, 2811 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:05,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:05,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 02:25:05,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:05,735 INFO L130 PetriNetUnfolder]: 658/1205 cut-off events. [2022-12-13 02:25:05,735 INFO L131 PetriNetUnfolder]: For 9609/9609 co-relation queries the response was YES. [2022-12-13 02:25:05,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7966 conditions, 1205 events. 658/1205 cut-off events. For 9609/9609 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6574 event pairs, 201 based on Foata normal form. 32/1230 useless extension candidates. Maximal degree in co-relation 7327. Up to 587 conditions per place. [2022-12-13 02:25:05,744 INFO L137 encePairwiseOnDemand]: 31/50 looper letters, 207 selfloop transitions, 35 changer transitions 1/243 dead transitions. [2022-12-13 02:25:05,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 243 transitions, 3982 flow [2022-12-13 02:25:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 02:25:05,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.405 [2022-12-13 02:25:05,746 INFO L175 Difference]: Start difference. First operand has 112 places, 186 transitions, 2811 flow. Second operand 4 states and 81 transitions. [2022-12-13 02:25:05,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 243 transitions, 3982 flow [2022-12-13 02:25:05,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 243 transitions, 3827 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:05,785 INFO L231 Difference]: Finished difference. Result has 113 places, 189 transitions, 2823 flow [2022-12-13 02:25:05,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2823, PETRI_PLACES=113, PETRI_TRANSITIONS=189} [2022-12-13 02:25:05,787 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 91 predicate places. [2022-12-13 02:25:05,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:05,787 INFO L89 Accepts]: Start accepts. Operand has 113 places, 189 transitions, 2823 flow [2022-12-13 02:25:05,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:05,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:05,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 189 transitions, 2823 flow [2022-12-13 02:25:05,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 189 transitions, 2823 flow [2022-12-13 02:25:05,835 INFO L130 PetriNetUnfolder]: 162/462 cut-off events. [2022-12-13 02:25:05,835 INFO L131 PetriNetUnfolder]: For 2235/2237 co-relation queries the response was YES. [2022-12-13 02:25:05,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 462 events. 162/462 cut-off events. For 2235/2237 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2900 event pairs, 10 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 2517. Up to 124 conditions per place. [2022-12-13 02:25:05,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 189 transitions, 2823 flow [2022-12-13 02:25:05,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 02:25:05,840 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:05,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 02:25:05,841 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 189 transitions, 2823 flow [2022-12-13 02:25:05,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:05,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:05,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:05,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 02:25:05,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2145183364, now seen corresponding path program 1 times [2022-12-13 02:25:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862600790] [2022-12-13 02:25:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:05,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862600790] [2022-12-13 02:25:05,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862600790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:05,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477987744] [2022-12-13 02:25:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:05,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:05,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:05,907 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 02:25:05,910 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 02:25:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:05,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:25:05,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 02:25:06,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:25:06,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477987744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:06,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:25:06,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 02:25:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346246473] [2022-12-13 02:25:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:06,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:06,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:06,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:06,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:25:06,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 189 transitions, 2823 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:06,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:06,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:25:06,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:06,365 INFO L130 PetriNetUnfolder]: 570/1058 cut-off events. [2022-12-13 02:25:06,366 INFO L131 PetriNetUnfolder]: For 7713/7713 co-relation queries the response was YES. [2022-12-13 02:25:06,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7046 conditions, 1058 events. 570/1058 cut-off events. For 7713/7713 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5603 event pairs, 265 based on Foata normal form. 12/1065 useless extension candidates. Maximal degree in co-relation 6911. Up to 996 conditions per place. [2022-12-13 02:25:06,375 INFO L137 encePairwiseOnDemand]: 40/47 looper letters, 169 selfloop transitions, 2 changer transitions 1/172 dead transitions. [2022-12-13 02:25:06,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 172 transitions, 2814 flow [2022-12-13 02:25:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 02:25:06,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30319148936170215 [2022-12-13 02:25:06,376 INFO L175 Difference]: Start difference. First operand has 112 places, 189 transitions, 2823 flow. Second operand 4 states and 57 transitions. [2022-12-13 02:25:06,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 172 transitions, 2814 flow [2022-12-13 02:25:06,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 172 transitions, 2730 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 02:25:06,403 INFO L231 Difference]: Finished difference. Result has 107 places, 161 transitions, 2304 flow [2022-12-13 02:25:06,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2318, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2304, PETRI_PLACES=107, PETRI_TRANSITIONS=161} [2022-12-13 02:25:06,404 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 85 predicate places. [2022-12-13 02:25:06,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:06,404 INFO L89 Accepts]: Start accepts. Operand has 107 places, 161 transitions, 2304 flow [2022-12-13 02:25:06,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:06,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:06,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 161 transitions, 2304 flow [2022-12-13 02:25:06,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 161 transitions, 2304 flow [2022-12-13 02:25:06,441 INFO L130 PetriNetUnfolder]: 137/399 cut-off events. [2022-12-13 02:25:06,441 INFO L131 PetriNetUnfolder]: For 1774/1777 co-relation queries the response was YES. [2022-12-13 02:25:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 399 events. 137/399 cut-off events. For 1774/1777 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2421 event pairs, 9 based on Foata normal form. 3/392 useless extension candidates. Maximal degree in co-relation 2170. Up to 98 conditions per place. [2022-12-13 02:25:06,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 161 transitions, 2304 flow [2022-12-13 02:25:06,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 02:25:06,445 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:06,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 02:25:06,446 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 161 transitions, 2304 flow [2022-12-13 02:25:06,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:06,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:06,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:06,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:06,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 02:25:06,654 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash 185945926, now seen corresponding path program 1 times [2022-12-13 02:25:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:06,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218437398] [2022-12-13 02:25:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:07,516 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 02:25:07,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:07,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218437398] [2022-12-13 02:25:07,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218437398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:07,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669533171] [2022-12-13 02:25:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:07,518 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 02:25:07,520 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 02:25:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:07,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 02:25:07,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:07,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:07,699 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-13 02:25:07,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-12-13 02:25:07,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 02:25:07,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 02:25:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:07,758 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-13 02:25:07,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 32 [2022-12-13 02:25:07,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 02:25:07,791 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:07,792 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2022-12-13 02:25:07,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:07,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 02:25:08,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:25:08,035 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 02:25:08,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2022-12-13 02:25:08,133 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 02:25:08,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:08,531 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 02:25:08,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669533171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:08,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:08,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 02:25:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79454165] [2022-12-13 02:25:08,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:08,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 02:25:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 02:25:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=135, Unknown=1, NotChecked=0, Total=182 [2022-12-13 02:25:08,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:25:08,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 161 transitions, 2304 flow. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:08,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:08,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:25:08,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:10,037 INFO L130 PetriNetUnfolder]: 569/1047 cut-off events. [2022-12-13 02:25:10,037 INFO L131 PetriNetUnfolder]: For 8056/8056 co-relation queries the response was YES. [2022-12-13 02:25:10,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6700 conditions, 1047 events. 569/1047 cut-off events. For 8056/8056 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5545 event pairs, 90 based on Foata normal form. 5/1047 useless extension candidates. Maximal degree in co-relation 6570. Up to 726 conditions per place. [2022-12-13 02:25:10,048 INFO L137 encePairwiseOnDemand]: 11/40 looper letters, 77 selfloop transitions, 96 changer transitions 12/185 dead transitions. [2022-12-13 02:25:10,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 185 transitions, 2807 flow [2022-12-13 02:25:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:25:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:25:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-12-13 02:25:10,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2125 [2022-12-13 02:25:10,049 INFO L175 Difference]: Start difference. First operand has 105 places, 161 transitions, 2304 flow. Second operand 10 states and 85 transitions. [2022-12-13 02:25:10,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 185 transitions, 2807 flow [2022-12-13 02:25:10,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 185 transitions, 2742 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 02:25:10,070 INFO L231 Difference]: Finished difference. Result has 114 places, 161 transitions, 2606 flow [2022-12-13 02:25:10,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2606, PETRI_PLACES=114, PETRI_TRANSITIONS=161} [2022-12-13 02:25:10,071 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 92 predicate places. [2022-12-13 02:25:10,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:10,071 INFO L89 Accepts]: Start accepts. Operand has 114 places, 161 transitions, 2606 flow [2022-12-13 02:25:10,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:10,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:10,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 161 transitions, 2606 flow [2022-12-13 02:25:10,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 161 transitions, 2606 flow [2022-12-13 02:25:10,107 INFO L130 PetriNetUnfolder]: 139/386 cut-off events. [2022-12-13 02:25:10,107 INFO L131 PetriNetUnfolder]: For 2334/2337 co-relation queries the response was YES. [2022-12-13 02:25:10,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 386 events. 139/386 cut-off events. For 2334/2337 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2279 event pairs, 9 based on Foata normal form. 3/379 useless extension candidates. Maximal degree in co-relation 2387. Up to 89 conditions per place. [2022-12-13 02:25:10,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 161 transitions, 2606 flow [2022-12-13 02:25:10,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-13 02:25:10,111 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:10,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 02:25:10,112 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 161 transitions, 2606 flow [2022-12-13 02:25:10,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:10,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:10,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:10,118 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 02:25:10,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 02:25:10,317 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:10,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1246552167, now seen corresponding path program 1 times [2022-12-13 02:25:10,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:10,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605528088] [2022-12-13 02:25:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:10,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:10,419 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 02:25:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:10,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605528088] [2022-12-13 02:25:10,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605528088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:10,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:10,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 02:25:10,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625483313] [2022-12-13 02:25:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:10,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 02:25:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 02:25:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 02:25:10,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 02:25:10,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 161 transitions, 2606 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:10,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:10,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 02:25:10,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:10,598 INFO L130 PetriNetUnfolder]: 308/594 cut-off events. [2022-12-13 02:25:10,598 INFO L131 PetriNetUnfolder]: For 5228/5228 co-relation queries the response was YES. [2022-12-13 02:25:10,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3958 conditions, 594 events. 308/594 cut-off events. For 5228/5228 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2783 event pairs, 78 based on Foata normal form. 39/628 useless extension candidates. Maximal degree in co-relation 3893. Up to 413 conditions per place. [2022-12-13 02:25:10,602 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 95 selfloop transitions, 16 changer transitions 6/117 dead transitions. [2022-12-13 02:25:10,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 1956 flow [2022-12-13 02:25:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 02:25:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 02:25:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 02:25:10,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3963963963963964 [2022-12-13 02:25:10,603 INFO L175 Difference]: Start difference. First operand has 105 places, 161 transitions, 2606 flow. Second operand 3 states and 44 transitions. [2022-12-13 02:25:10,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 1956 flow [2022-12-13 02:25:10,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 1511 flow, removed 23 selfloop flow, removed 21 redundant places. [2022-12-13 02:25:10,617 INFO L231 Difference]: Finished difference. Result has 85 places, 103 transitions, 1193 flow [2022-12-13 02:25:10,617 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1193, PETRI_PLACES=85, PETRI_TRANSITIONS=103} [2022-12-13 02:25:10,618 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 63 predicate places. [2022-12-13 02:25:10,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:10,618 INFO L89 Accepts]: Start accepts. Operand has 85 places, 103 transitions, 1193 flow [2022-12-13 02:25:10,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:10,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:10,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 103 transitions, 1193 flow [2022-12-13 02:25:10,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 103 transitions, 1193 flow [2022-12-13 02:25:10,637 INFO L130 PetriNetUnfolder]: 74/232 cut-off events. [2022-12-13 02:25:10,637 INFO L131 PetriNetUnfolder]: For 599/599 co-relation queries the response was YES. [2022-12-13 02:25:10,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 232 events. 74/232 cut-off events. For 599/599 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1144 event pairs, 7 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 983. Up to 52 conditions per place. [2022-12-13 02:25:10,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 103 transitions, 1193 flow [2022-12-13 02:25:10,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 02:25:10,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:25:10,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 02:25:11,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:25:11,253 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:25:11,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 636 [2022-12-13 02:25:11,254 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 100 transitions, 1177 flow [2022-12-13 02:25:11,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:11,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:11,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:11,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 02:25:11,254 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:11,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1253782266, now seen corresponding path program 1 times [2022-12-13 02:25:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:11,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14447339] [2022-12-13 02:25:11,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14447339] [2022-12-13 02:25:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14447339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327109751] [2022-12-13 02:25:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:12,603 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 02:25:12,609 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 02:25:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:12,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 02:25:12,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:12,888 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 02:25:12,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 02:25:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:12,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:13,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:13,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 124 [2022-12-13 02:25:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:13,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327109751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:13,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:13,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 02:25:13,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678265312] [2022-12-13 02:25:13,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:13,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:25:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:13,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:25:13,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:25:13,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 02:25:13,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 100 transitions, 1177 flow. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:13,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:13,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 02:25:13,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:16,053 INFO L130 PetriNetUnfolder]: 351/680 cut-off events. [2022-12-13 02:25:16,053 INFO L131 PetriNetUnfolder]: For 2636/2636 co-relation queries the response was YES. [2022-12-13 02:25:16,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3532 conditions, 680 events. 351/680 cut-off events. For 2636/2636 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3354 event pairs, 66 based on Foata normal form. 16/691 useless extension candidates. Maximal degree in co-relation 3400. Up to 313 conditions per place. [2022-12-13 02:25:16,058 INFO L137 encePairwiseOnDemand]: 15/34 looper letters, 77 selfloop transitions, 72 changer transitions 17/166 dead transitions. [2022-12-13 02:25:16,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 166 transitions, 1990 flow [2022-12-13 02:25:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:25:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:25:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 107 transitions. [2022-12-13 02:25:16,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19669117647058823 [2022-12-13 02:25:16,060 INFO L175 Difference]: Start difference. First operand has 81 places, 100 transitions, 1177 flow. Second operand 16 states and 107 transitions. [2022-12-13 02:25:16,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 166 transitions, 1990 flow [2022-12-13 02:25:16,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 166 transitions, 1897 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 02:25:16,086 INFO L231 Difference]: Finished difference. Result has 99 places, 123 transitions, 1615 flow [2022-12-13 02:25:16,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1615, PETRI_PLACES=99, PETRI_TRANSITIONS=123} [2022-12-13 02:25:16,087 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 77 predicate places. [2022-12-13 02:25:16,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:16,087 INFO L89 Accepts]: Start accepts. Operand has 99 places, 123 transitions, 1615 flow [2022-12-13 02:25:16,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:16,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:16,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 123 transitions, 1615 flow [2022-12-13 02:25:16,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 123 transitions, 1615 flow [2022-12-13 02:25:16,116 INFO L130 PetriNetUnfolder]: 85/249 cut-off events. [2022-12-13 02:25:16,116 INFO L131 PetriNetUnfolder]: For 926/926 co-relation queries the response was YES. [2022-12-13 02:25:16,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 249 events. 85/249 cut-off events. For 926/926 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1208 event pairs, 6 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 1203. Up to 58 conditions per place. [2022-12-13 02:25:16,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 123 transitions, 1615 flow [2022-12-13 02:25:16,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 02:25:16,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:25:16,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] L65-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_528| v_~q1~0.base_315)) (.cse2 (* v_~q1_back~0_494 4)) (.cse0 (select |v_#memory_int_528| v_~q2~0.base_290))) (and (= (+ v_~q2_back~0_516 1) v_~q2_back~0_515) (= v_~j~0_398 (+ (select .cse0 (+ v_~q2~0.offset_290 (* v_~q2_front~0_349 4))) 1)) (< v_~i~0_455 v_~N~0_298) (not (= 0 (ite (and (< v_~q1_back~0_494 v_~n1~0_302) (<= 0 v_~q1_back~0_494)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|) (not (= (ite (= v_~j~0_399 (select .cse1 (+ .cse2 v_~q1~0.offset_315))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_351| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351|) (not (= (ite (and (< v_~q2_front~0_349 v_~n2~0_298) (<= 0 v_~q2_front~0_349) (< v_~q2_front~0_349 v_~q2_back~0_515)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| (ite (= v_~j~0_398 (select .cse1 (+ .cse2 v_~q1~0.offset_315 4))) 1 0)) (= (+ 2 v_~q1_back~0_494) v_~q1_back~0_492) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351| 0)) (< v_~j~0_399 v_~N~0_298) (< v_~j~0_398 v_~N~0_298) (not (= (ite (and (< v_~q2_back~0_516 v_~n2~0_298) (<= 0 v_~q2_back~0_516)) 1 0) 0)) (= (ite (= (select .cse0 (+ v_~q2~0.offset_290 (* 4 v_~q2_back~0_516))) v_~i~0_455) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_351|) (not (= (ite (let ((.cse3 (+ v_~q1_back~0_494 1))) (and (<= 0 .cse3) (< .cse3 v_~n1~0_302))) 1 0) 0)) (= (+ v_~q2_front~0_349 1) v_~q2_front~0_348) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268| 0)))) InVars {~j~0=v_~j~0_399, ~q1~0.offset=v_~q1~0.offset_315, ~n2~0=v_~n2~0_298, ~i~0=v_~i~0_455, ~n1~0=v_~n1~0_302, ~q2~0.offset=v_~q2~0.offset_290, ~q2_front~0=v_~q2_front~0_349, ~N~0=v_~N~0_298, ~q1_back~0=v_~q1_back~0_494, ~q1~0.base=v_~q1~0.base_315, #memory_int=|v_#memory_int_528|, ~q2~0.base=v_~q2~0.base_290, ~q2_back~0=v_~q2_back~0_516} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_213|, ~j~0=v_~j~0_398, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_156|, ~q1~0.offset=v_~q1~0.offset_315, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_150|, ~n2~0=v_~n2~0_298, ~i~0=v_~i~0_455, ~n1~0=v_~n1~0_302, ~q2~0.offset=v_~q2~0.offset_290, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_182|, ~q2_front~0=v_~q2_front~0_348, ~N~0=v_~N~0_298, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_182|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_150|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_351|, ~q1_back~0=v_~q1_back~0_492, ~q1~0.base=v_~q1~0.base_315, #memory_int=|v_#memory_int_528|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351|, ~q2~0.base=v_~q2~0.base_290, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_213|, ~q2_back~0=v_~q2_back~0_515} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:25:23,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:25:23,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [842] L65-1-->L70: Formula: (let ((.cse1 (select |v_#memory_int_528| v_~q1~0.base_315)) (.cse2 (* v_~q1_back~0_494 4)) (.cse0 (select |v_#memory_int_528| v_~q2~0.base_290))) (and (= (+ v_~q2_back~0_516 1) v_~q2_back~0_515) (= v_~j~0_398 (+ (select .cse0 (+ v_~q2~0.offset_290 (* v_~q2_front~0_349 4))) 1)) (< v_~i~0_455 v_~N~0_298) (not (= 0 (ite (and (< v_~q1_back~0_494 v_~n1~0_302) (<= 0 v_~q1_back~0_494)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|) (not (= (ite (= v_~j~0_399 (select .cse1 (+ .cse2 v_~q1~0.offset_315))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_351| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351|) (not (= (ite (and (< v_~q2_front~0_349 v_~n2~0_298) (<= 0 v_~q2_front~0_349) (< v_~q2_front~0_349 v_~q2_back~0_515)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268| (ite (= v_~j~0_398 (select .cse1 (+ .cse2 v_~q1~0.offset_315 4))) 1 0)) (= (+ 2 v_~q1_back~0_494) v_~q1_back~0_492) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351| 0)) (< v_~j~0_399 v_~N~0_298) (< v_~j~0_398 v_~N~0_298) (not (= (ite (and (< v_~q2_back~0_516 v_~n2~0_298) (<= 0 v_~q2_back~0_516)) 1 0) 0)) (= (ite (= (select .cse0 (+ v_~q2~0.offset_290 (* 4 v_~q2_back~0_516))) v_~i~0_455) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_351|) (not (= (ite (let ((.cse3 (+ v_~q1_back~0_494 1))) (and (<= 0 .cse3) (< .cse3 v_~n1~0_302))) 1 0) 0)) (= (+ v_~q2_front~0_349 1) v_~q2_front~0_348) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268| 0)))) InVars {~j~0=v_~j~0_399, ~q1~0.offset=v_~q1~0.offset_315, ~n2~0=v_~n2~0_298, ~i~0=v_~i~0_455, ~n1~0=v_~n1~0_302, ~q2~0.offset=v_~q2~0.offset_290, ~q2_front~0=v_~q2_front~0_349, ~N~0=v_~N~0_298, ~q1_back~0=v_~q1_back~0_494, ~q1~0.base=v_~q1~0.base_315, #memory_int=|v_#memory_int_528|, ~q2~0.base=v_~q2~0.base_290, ~q2_back~0=v_~q2_back~0_516} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_213|, ~j~0=v_~j~0_398, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_156|, ~q1~0.offset=v_~q1~0.offset_315, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_150|, ~n2~0=v_~n2~0_298, ~i~0=v_~i~0_455, ~n1~0=v_~n1~0_302, ~q2~0.offset=v_~q2~0.offset_290, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_268|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_182|, ~q2_front~0=v_~q2_front~0_348, ~N~0=v_~N~0_298, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_182|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_150|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_268|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_351|, ~q1_back~0=v_~q1_back~0_492, ~q1~0.base=v_~q1~0.base_315, #memory_int=|v_#memory_int_528|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_351|, ~q2~0.base=v_~q2~0.base_290, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_213|, ~q2_back~0=v_~q2_back~0_515} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:25:23,834 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 02:25:23,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7748 [2022-12-13 02:25:23,835 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 120 transitions, 1624 flow [2022-12-13 02:25:23,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:23,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:23,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:23,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 02:25:24,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 02:25:24,042 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1923766669, now seen corresponding path program 1 times [2022-12-13 02:25:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:24,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312136191] [2022-12-13 02:25:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:25,201 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 02:25:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312136191] [2022-12-13 02:25:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312136191] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906482963] [2022-12-13 02:25:25,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:25,203 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 02:25:25,204 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 02:25:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:25,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 02:25:25,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:25,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 02:25:25,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-13 02:25:25,391 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:25:25,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 02:25:25,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 02:25:25,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 02:25:26,053 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 02:25:26,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:26,842 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 02:25:26,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906482963] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:26,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:26,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:25:26,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778939853] [2022-12-13 02:25:26,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:25:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:25:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-12-13 02:25:26,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 02:25:26,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 120 transitions, 1624 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:26,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:26,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 02:25:26,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:32,859 INFO L130 PetriNetUnfolder]: 381/718 cut-off events. [2022-12-13 02:25:32,860 INFO L131 PetriNetUnfolder]: For 3007/3007 co-relation queries the response was YES. [2022-12-13 02:25:32,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4004 conditions, 718 events. 381/718 cut-off events. For 3007/3007 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3503 event pairs, 32 based on Foata normal form. 6/715 useless extension candidates. Maximal degree in co-relation 3842. Up to 378 conditions per place. [2022-12-13 02:25:32,864 INFO L137 encePairwiseOnDemand]: 7/41 looper letters, 52 selfloop transitions, 117 changer transitions 17/186 dead transitions. [2022-12-13 02:25:32,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 186 transitions, 2453 flow [2022-12-13 02:25:32,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 02:25:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 02:25:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions. [2022-12-13 02:25:32,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1902439024390244 [2022-12-13 02:25:32,865 INFO L175 Difference]: Start difference. First operand has 95 places, 120 transitions, 1624 flow. Second operand 15 states and 117 transitions. [2022-12-13 02:25:32,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 186 transitions, 2453 flow [2022-12-13 02:25:32,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 186 transitions, 2356 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 02:25:32,877 INFO L231 Difference]: Finished difference. Result has 113 places, 148 transitions, 2243 flow [2022-12-13 02:25:32,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2243, PETRI_PLACES=113, PETRI_TRANSITIONS=148} [2022-12-13 02:25:32,877 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 91 predicate places. [2022-12-13 02:25:32,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:32,877 INFO L89 Accepts]: Start accepts. Operand has 113 places, 148 transitions, 2243 flow [2022-12-13 02:25:32,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:32,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:32,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 148 transitions, 2243 flow [2022-12-13 02:25:32,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 148 transitions, 2243 flow [2022-12-13 02:25:32,904 INFO L130 PetriNetUnfolder]: 101/281 cut-off events. [2022-12-13 02:25:32,904 INFO L131 PetriNetUnfolder]: For 1404/1408 co-relation queries the response was YES. [2022-12-13 02:25:32,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 281 events. 101/281 cut-off events. For 1404/1408 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1426 event pairs, 7 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 1631. Up to 74 conditions per place. [2022-12-13 02:25:32,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 148 transitions, 2243 flow [2022-12-13 02:25:32,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-13 02:25:32,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_440| v_~q2~0.base_234)) (.cse1 (select |v_#memory_int_440| v_~q1~0.base_257))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|) (< v_~j~0_322 v_~N~0_242) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_223|) (not (= (ite (and (<= 0 v_~q1_back~0_403) (< v_~q1_back~0_403 v_~n1~0_246)) 1 0) 0)) (< v_~i~0_359 v_~N~0_242) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262| (ite (and (< v_~q1_front~0_348 v_~q1_back~0_402) (< v_~q1_front~0_348 v_~n1~0_246) (<= 0 v_~q1_front~0_348)) 1 0)) (= (+ v_~q2_front~0_279 1) v_~q2_front~0_278) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_223| 0)) (= v_~j~0_321 (+ (select .cse0 (+ v_~q2~0.offset_234 (* v_~q2_front~0_279 4))) 1)) (not (= (ite (= v_~j~0_322 (select .cse1 (+ (* v_~q1_back~0_403 4) v_~q1~0.offset_257))) 1 0) 0)) (= (+ v_~q1_front~0_348 1) v_~q1_front~0_347) (= (+ v_~q2_back~0_412 1) v_~q2_back~0_411) (not (= (ite (= (select .cse0 (+ (* 4 v_~q2_back~0_412) v_~q2~0.offset_234)) v_~i~0_359) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262| 0)) (= (+ v_~q1_back~0_403 1) v_~q1_back~0_402) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| (ite (and (< v_~q2_front~0_279 v_~n2~0_244) (<= 0 v_~q2_front~0_279) (< v_~q2_front~0_279 v_~q2_back~0_411)) 1 0)) (= v_~i~0_358 (+ (select .cse1 (+ v_~q1~0.offset_257 (* v_~q1_front~0_348 4))) 1)) (not (= (ite (and (<= 0 v_~q2_back~0_412) (< v_~q2_back~0_412 v_~n2~0_244)) 1 0) 0)))) InVars {~j~0=v_~j~0_322, ~q1~0.offset=v_~q1~0.offset_257, ~q1_front~0=v_~q1_front~0_348, ~n2~0=v_~n2~0_244, ~i~0=v_~i~0_359, ~n1~0=v_~n1~0_246, ~q2~0.offset=v_~q2~0.offset_234, ~q2_front~0=v_~q2_front~0_279, ~N~0=v_~N~0_242, ~q1_back~0=v_~q1_back~0_403, ~q1~0.base=v_~q1~0.base_257, #memory_int=|v_#memory_int_440|, ~q2~0.base=v_~q2~0.base_234, ~q2_back~0=v_~q2_back~0_412} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_161|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_120|, ~j~0=v_~j~0_321, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_114|, ~q1_front~0=v_~q1_front~0_347, ~n1~0=v_~n1~0_246, ~q2~0.offset=v_~q2~0.offset_234, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_114|, ~q1_back~0=v_~q1_back~0_402, ~q1~0.base=v_~q1~0.base_257, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_159|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_262|, ~q2~0.base=v_~q2~0.base_234, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_153|, ~q2_back~0=v_~q2_back~0_411, ~q1~0.offset=v_~q1~0.offset_257, ~n2~0=v_~n2~0_244, ~i~0=v_~i~0_358, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_153|, ~q2_front~0=v_~q2_front~0_278, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_146|, ~N~0=v_~N~0_242, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_146|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_223|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_262|, #memory_int=|v_#memory_int_440|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_161|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [849] L65-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_370|) (not (= (ite (and (<= 0 v_~q2_back~0_541) (< v_~q2_back~0_541 v_~n2~0_310)) 1 0) 0)) (= (+ v_~q2_back~0_541 1) v_~q2_back~0_540) (< v_~i~0_472 v_~N~0_310) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| (ite (= v_~j~0_416 (select (select |v_#memory_int_543| v_~q1~0.base_325) (+ v_~q1~0.offset_325 (* v_~q1_back~0_515 4)))) 1 0)) (not (= (ite (and (< v_~q1_back~0_515 v_~n1~0_312) (<= 0 v_~q1_back~0_515)) 1 0) 0)) (< v_~j~0_416 v_~N~0_310) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|) (= (ite (= v_~i~0_472 (select (select |v_#memory_int_543| v_~q2~0.base_302) (+ v_~q2~0.offset_302 (* 4 v_~q2_back~0_541)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_370| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282| 0)) (= (+ v_~q1_back~0_515 1) v_~q1_back~0_514)) InVars {~j~0=v_~j~0_416, ~q1~0.offset=v_~q1~0.offset_325, ~n2~0=v_~n2~0_310, ~i~0=v_~i~0_472, ~q1_back~0=v_~q1_back~0_515, ~q2~0.offset=v_~q2~0.offset_302, ~n1~0=v_~n1~0_312, ~q1~0.base=v_~q1~0.base_325, #memory_int=|v_#memory_int_543|, ~q2~0.base=v_~q2~0.base_302, ~N~0=v_~N~0_310, ~q2_back~0=v_~q2_back~0_541} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_225|, ~j~0=v_~j~0_416, ~q1~0.offset=v_~q1~0.offset_325, ~n2~0=v_~n2~0_310, ~i~0=v_~i~0_472, ~q2~0.offset=v_~q2~0.offset_302, ~n1~0=v_~n1~0_312, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_194|, ~N~0=v_~N~0_310, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_194|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370|, ~q1_back~0=v_~q1_back~0_514, ~q1~0.base=v_~q1~0.base_325, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_370|, #memory_int=|v_#memory_int_543|, ~q2~0.base=v_~q2~0.base_302, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_225|, ~q2_back~0=v_~q2_back~0_540} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:25:32,916 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,916 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,916 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,916 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,916 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,917 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,917 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,917 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,917 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,917 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,917 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:32,917 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,755 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,755 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:33,756 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] L65-1-->L47-1: Formula: (let ((.cse1 (select |v_#memory_int_442| v_~q2~0.base_236)) (.cse0 (select |v_#memory_int_442| v_~q1~0.base_259))) (and (not (= (ite (= v_~j~0_326 (select .cse0 (+ v_~q1~0.offset_259 (* v_~q1_back~0_407 4)))) 1 0) 0)) (= (ite (and (<= 0 v_~q1_front~0_352) (< v_~q1_front~0_352 v_~q1_back~0_406) (< v_~q1_front~0_352 v_~n1~0_248)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266|) (= (+ v_~q1_front~0_352 1) v_~q1_front~0_351) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|) (= v_~j~0_325 (+ (select .cse1 (+ (* v_~q2_front~0_283 4) v_~q2~0.offset_236)) 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266|) (= (+ v_~q2_front~0_283 1) v_~q2_front~0_282) (= (+ v_~q1_back~0_407 1) v_~q1_back~0_406) (= (ite (and (<= 0 v_~q2_front~0_283) (< v_~q2_front~0_283 v_~q2_back~0_415) (< v_~q2_front~0_283 v_~n2~0_246)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266| 0)) (= (+ v_~q2_back~0_416 1) v_~q2_back~0_415) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225| 0)) (< v_~j~0_326 v_~N~0_244) (not (= (ite (and (< v_~q2_back~0_416 v_~n2~0_246) (<= 0 v_~q2_back~0_416)) 1 0) 0)) (not (= (ite (and (<= 0 v_~q1_back~0_407) (< v_~q1_back~0_407 v_~n1~0_248)) 1 0) 0)) (< v_~i~0_363 v_~N~0_244) (not (= (ite (= v_~i~0_363 (select .cse1 (+ v_~q2~0.offset_236 (* 4 v_~q2_back~0_416)))) 1 0) 0)) (= (+ (select .cse0 (+ v_~q1~0.offset_259 (* v_~q1_front~0_352 4))) 1) v_~i~0_362))) InVars {~j~0=v_~j~0_326, ~q1~0.offset=v_~q1~0.offset_259, ~q1_front~0=v_~q1_front~0_352, ~n2~0=v_~n2~0_246, ~i~0=v_~i~0_363, ~n1~0=v_~n1~0_248, ~q2~0.offset=v_~q2~0.offset_236, ~q2_front~0=v_~q2_front~0_283, ~N~0=v_~N~0_244, ~q1_back~0=v_~q1_back~0_407, ~q1~0.base=v_~q1~0.base_259, #memory_int=|v_#memory_int_442|, ~q2~0.base=v_~q2~0.base_236, ~q2_back~0=v_~q2_back~0_416} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_163|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_122|, ~j~0=v_~j~0_325, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_116|, ~q1_front~0=v_~q1_front~0_351, ~n1~0=v_~n1~0_248, ~q2~0.offset=v_~q2~0.offset_236, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_116|, ~q1_back~0=v_~q1_back~0_406, ~q1~0.base=v_~q1~0.base_259, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266|, ~q2~0.base=v_~q2~0.base_236, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_155|, ~q2_back~0=v_~q2_back~0_415, ~q1~0.offset=v_~q1~0.offset_259, ~n2~0=v_~n2~0_246, ~i~0=v_~i~0_362, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_155|, ~q2_front~0=v_~q2_front~0_282, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_148|, ~N~0=v_~N~0_244, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_148|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_266|, #memory_int=|v_#memory_int_442|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_163|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [849] L65-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_370|) (not (= (ite (and (<= 0 v_~q2_back~0_541) (< v_~q2_back~0_541 v_~n2~0_310)) 1 0) 0)) (= (+ v_~q2_back~0_541 1) v_~q2_back~0_540) (< v_~i~0_472 v_~N~0_310) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| (ite (= v_~j~0_416 (select (select |v_#memory_int_543| v_~q1~0.base_325) (+ v_~q1~0.offset_325 (* v_~q1_back~0_515 4)))) 1 0)) (not (= (ite (and (< v_~q1_back~0_515 v_~n1~0_312) (<= 0 v_~q1_back~0_515)) 1 0) 0)) (< v_~j~0_416 v_~N~0_310) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|) (= (ite (= v_~i~0_472 (select (select |v_#memory_int_543| v_~q2~0.base_302) (+ v_~q2~0.offset_302 (* 4 v_~q2_back~0_541)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_370| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282| 0)) (= (+ v_~q1_back~0_515 1) v_~q1_back~0_514)) InVars {~j~0=v_~j~0_416, ~q1~0.offset=v_~q1~0.offset_325, ~n2~0=v_~n2~0_310, ~i~0=v_~i~0_472, ~q1_back~0=v_~q1_back~0_515, ~q2~0.offset=v_~q2~0.offset_302, ~n1~0=v_~n1~0_312, ~q1~0.base=v_~q1~0.base_325, #memory_int=|v_#memory_int_543|, ~q2~0.base=v_~q2~0.base_302, ~N~0=v_~N~0_310, ~q2_back~0=v_~q2_back~0_541} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_225|, ~j~0=v_~j~0_416, ~q1~0.offset=v_~q1~0.offset_325, ~n2~0=v_~n2~0_310, ~i~0=v_~i~0_472, ~q2~0.offset=v_~q2~0.offset_302, ~n1~0=v_~n1~0_312, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_282|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_194|, ~N~0=v_~N~0_310, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_194|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_282|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_370|, ~q1_back~0=v_~q1_back~0_514, ~q1~0.base=v_~q1~0.base_325, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_370|, #memory_int=|v_#memory_int_543|, ~q2~0.base=v_~q2~0.base_302, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_225|, ~q2_back~0=v_~q2_back~0_540} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:25:34,770 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,770 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,770 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:34,771 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,701 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,701 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,701 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,701 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,701 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,701 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,702 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,702 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,702 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,702 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,702 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:35,702 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:36,427 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:25:36,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3551 [2022-12-13 02:25:36,428 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 146 transitions, 2223 flow [2022-12-13 02:25:36,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:36,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:36,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:36,436 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 02:25:36,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:36,629 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 303225705, now seen corresponding path program 1 times [2022-12-13 02:25:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:36,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797418280] [2022-12-13 02:25:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:37,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797418280] [2022-12-13 02:25:37,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797418280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:37,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421365331] [2022-12-13 02:25:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:37,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:37,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:37,924 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 02:25:37,924 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 02:25:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:38,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 02:25:38,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:38,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:38,097 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-13 02:25:38,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-13 02:25:38,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 02:25:38,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-12-13 02:25:38,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:38,156 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 02:25:38,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 30 [2022-12-13 02:25:38,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 02:25:38,171 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:38,171 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2022-12-13 02:25:38,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:38,408 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 02:25:38,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 123 [2022-12-13 02:25:38,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-12-13 02:25:38,562 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 02:25:38,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2022-12-13 02:25:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:38,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:39,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421365331] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:39,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:39,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-13 02:25:39,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41794256] [2022-12-13 02:25:39,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:39,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:25:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:39,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:25:39,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:25:39,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:25:39,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 146 transitions, 2223 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:39,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:39,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:25:39,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:42,545 INFO L130 PetriNetUnfolder]: 416/765 cut-off events. [2022-12-13 02:25:42,545 INFO L131 PetriNetUnfolder]: For 4744/4744 co-relation queries the response was YES. [2022-12-13 02:25:42,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 765 events. 416/765 cut-off events. For 4744/4744 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3681 event pairs, 31 based on Foata normal form. 9/768 useless extension candidates. Maximal degree in co-relation 4795. Up to 394 conditions per place. [2022-12-13 02:25:42,561 INFO L137 encePairwiseOnDemand]: 7/40 looper letters, 63 selfloop transitions, 127 changer transitions 11/201 dead transitions. [2022-12-13 02:25:42,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 201 transitions, 3034 flow [2022-12-13 02:25:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:25:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:25:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 120 transitions. [2022-12-13 02:25:42,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-13 02:25:42,562 INFO L175 Difference]: Start difference. First operand has 108 places, 146 transitions, 2223 flow. Second operand 16 states and 120 transitions. [2022-12-13 02:25:42,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 201 transitions, 3034 flow [2022-12-13 02:25:42,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 201 transitions, 2939 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 02:25:42,578 INFO L231 Difference]: Finished difference. Result has 122 places, 163 transitions, 2734 flow [2022-12-13 02:25:42,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2734, PETRI_PLACES=122, PETRI_TRANSITIONS=163} [2022-12-13 02:25:42,578 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 100 predicate places. [2022-12-13 02:25:42,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:42,578 INFO L89 Accepts]: Start accepts. Operand has 122 places, 163 transitions, 2734 flow [2022-12-13 02:25:42,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:42,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:42,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 163 transitions, 2734 flow [2022-12-13 02:25:42,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 163 transitions, 2734 flow [2022-12-13 02:25:42,607 INFO L130 PetriNetUnfolder]: 109/303 cut-off events. [2022-12-13 02:25:42,607 INFO L131 PetriNetUnfolder]: For 1931/1941 co-relation queries the response was YES. [2022-12-13 02:25:42,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 303 events. 109/303 cut-off events. For 1931/1941 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1553 event pairs, 7 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 1982. Up to 82 conditions per place. [2022-12-13 02:25:42,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 163 transitions, 2734 flow [2022-12-13 02:25:42,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-13 02:25:42,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [855] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_565| v_~q1~0.base_337))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_380| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_380|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_294| (ite (= v_~j~0_434 (select .cse0 (+ v_~q1~0.offset_337 (* v_~q1_back~0_536 4)))) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_294| 0)) (= (+ v_~q1_front~0_486 1) v_~q1_front~0_485) (not (= (ite (and (< v_~q1_back~0_536 v_~n1~0_324) (<= 0 v_~q1_back~0_536)) 1 0) 0)) (< v_~j~0_434 v_~N~0_322) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_380| (ite (and (<= 0 v_~q1_front~0_486) (< v_~q1_front~0_486 v_~n1~0_324) (< v_~q1_front~0_486 v_~q1_back~0_535)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_380| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_294| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_294|) (= v_~q1_back~0_535 (+ v_~q1_back~0_536 1)) (= v_~i~0_486 (+ (select .cse0 (+ (* v_~q1_front~0_486 4) v_~q1~0.offset_337)) 1)))) InVars {~j~0=v_~j~0_434, ~q1~0.offset=v_~q1~0.offset_337, ~q1_front~0=v_~q1_front~0_486, ~q1_back~0=v_~q1_back~0_536, ~n1~0=v_~n1~0_324, ~q1~0.base=v_~q1~0.base_337, #memory_int=|v_#memory_int_565|, ~N~0=v_~N~0_322} OutVars{~j~0=v_~j~0_434, ~q1~0.offset=v_~q1~0.offset_337, ~q1_front~0=v_~q1_front~0_485, ~i~0=v_~i~0_486, ~n1~0=v_~n1~0_324, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_227|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_294|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_204|, ~N~0=v_~N~0_322, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_294|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_380|, ~q1_back~0=v_~q1_back~0_535, ~q1~0.base=v_~q1~0.base_337, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_233|, #memory_int=|v_#memory_int_565|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_380|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_227|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:25:42,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:25:42,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-13 02:25:42,777 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 163 transitions, 2750 flow [2022-12-13 02:25:42,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:42,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:42,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:42,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 02:25:42,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:42,982 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1757920313, now seen corresponding path program 1 times [2022-12-13 02:25:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:42,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654733466] [2022-12-13 02:25:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:43,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654733466] [2022-12-13 02:25:43,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654733466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:43,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844269483] [2022-12-13 02:25:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:43,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:43,938 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 02:25:43,940 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 02:25:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:44,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 02:25:44,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:44,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:44,110 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-12-13 02:25:44,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 100 [2022-12-13 02:25:44,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 02:25:44,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 02:25:44,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:44,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2022-12-13 02:25:44,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 02:25:44,194 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:44,195 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 106 [2022-12-13 02:25:44,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:25:44,524 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-13 02:25:44,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 143 treesize of output 143 [2022-12-13 02:25:44,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 02:25:44,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:44,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2022-12-13 02:25:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:44,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:45,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844269483] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:45,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:45,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:25:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271896648] [2022-12-13 02:25:45,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:45,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:25:45,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:25:45,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=282, Unknown=5, NotChecked=0, Total=342 [2022-12-13 02:25:45,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 02:25:45,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 163 transitions, 2750 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:45,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:45,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 02:25:45,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:50,965 INFO L130 PetriNetUnfolder]: 465/846 cut-off events. [2022-12-13 02:25:50,965 INFO L131 PetriNetUnfolder]: For 6238/6238 co-relation queries the response was YES. [2022-12-13 02:25:50,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 846 events. 465/846 cut-off events. For 6238/6238 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4226 event pairs, 29 based on Foata normal form. 2/842 useless extension candidates. Maximal degree in co-relation 6031. Up to 429 conditions per place. [2022-12-13 02:25:50,971 INFO L137 encePairwiseOnDemand]: 7/41 looper letters, 68 selfloop transitions, 154 changer transitions 7/229 dead transitions. [2022-12-13 02:25:50,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 229 transitions, 3848 flow [2022-12-13 02:25:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 02:25:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 02:25:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2022-12-13 02:25:50,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15121951219512195 [2022-12-13 02:25:50,980 INFO L175 Difference]: Start difference. First operand has 121 places, 163 transitions, 2750 flow. Second operand 20 states and 124 transitions. [2022-12-13 02:25:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 229 transitions, 3848 flow [2022-12-13 02:25:51,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 229 transitions, 3776 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-13 02:25:51,004 INFO L231 Difference]: Finished difference. Result has 143 places, 192 transitions, 3724 flow [2022-12-13 02:25:51,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2688, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3724, PETRI_PLACES=143, PETRI_TRANSITIONS=192} [2022-12-13 02:25:51,005 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 121 predicate places. [2022-12-13 02:25:51,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:51,005 INFO L89 Accepts]: Start accepts. Operand has 143 places, 192 transitions, 3724 flow [2022-12-13 02:25:51,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:51,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:51,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 192 transitions, 3724 flow [2022-12-13 02:25:51,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 192 transitions, 3724 flow [2022-12-13 02:25:51,040 INFO L130 PetriNetUnfolder]: 124/339 cut-off events. [2022-12-13 02:25:51,041 INFO L131 PetriNetUnfolder]: For 2927/2937 co-relation queries the response was YES. [2022-12-13 02:25:51,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 339 events. 124/339 cut-off events. For 2927/2937 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1855 event pairs, 7 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 2611. Up to 99 conditions per place. [2022-12-13 02:25:51,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 192 transitions, 3724 flow [2022-12-13 02:25:51,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-13 02:25:51,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [856] L65-1-->L65-1: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_540) (< v_~q1_back~0_540 v_~n1~0_326)) 1 0) 0)) (= v_~j~0_436 (+ (select (select |v_#memory_int_567| v_~q2~0.base_315) (+ v_~q2~0.offset_315 (* v_~q2_front~0_379 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_296|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_296| 0)) (not (= (ite (= v_~j~0_437 (select (select |v_#memory_int_567| v_~q1~0.base_339) (+ (* v_~q1_back~0_540 4) v_~q1~0.offset_339))) 1 0) 0)) (< v_~j~0_437 v_~N~0_324) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296| (ite (and (< v_~q2_front~0_379 v_~n2~0_320) (< v_~q2_front~0_379 v_~q2_back~0_555) (<= 0 v_~q2_front~0_379)) 1 0)) (= (+ v_~q1_back~0_540 1) v_~q1_back~0_539) (= (+ v_~q2_front~0_379 1) v_~q2_front~0_378)) InVars {~j~0=v_~j~0_437, ~q1~0.offset=v_~q1~0.offset_339, ~n2~0=v_~n2~0_320, ~q1_back~0=v_~q1_back~0_540, ~q2~0.offset=v_~q2~0.offset_315, ~n1~0=v_~n1~0_326, ~q1~0.base=v_~q1~0.base_339, #memory_int=|v_#memory_int_567|, ~q2_front~0=v_~q2_front~0_379, ~q2~0.base=v_~q2~0.base_315, ~N~0=v_~N~0_324, ~q2_back~0=v_~q2_back~0_555} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_172|, ~j~0=v_~j~0_436, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_166|, ~q1~0.offset=v_~q1~0.offset_339, ~n2~0=v_~n2~0_320, ~q2~0.offset=v_~q2~0.offset_315, ~n1~0=v_~n1~0_326, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_296|, ~q2_front~0=v_~q2_front~0_378, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_206|, ~N~0=v_~N~0_324, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_206|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_166|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_296|, ~q1_back~0=v_~q1_back~0_539, ~q1~0.base=v_~q1~0.base_339, #memory_int=|v_#memory_int_567|, ~q2~0.base=v_~q2~0.base_315, ~q2_back~0=v_~q2_back~0_555} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:25:51,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [869] L65-1-->L52: Formula: (let ((.cse0 (select |v_#memory_int_594| v_~q1~0.base_357))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334| (ite (= v_~j~0_476 (select .cse0 (+ (* v_~q1_back~0_587 4) v_~q1~0.offset_357))) 1 0)) (= (ite (= (select (select |v_#memory_int_594| v_~q2~0.base_333) (+ v_~q2~0.offset_333 (* 4 v_~q2_back~0_595))) v_~i~0_515) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415|) (not (= (ite (and (<= 0 v_~q1_back~0_587) (< v_~q1_back~0_587 v_~n1~0_344)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415| 0)) (not (= (ite (and (<= 0 v_~q1_front~0_521) (< v_~q1_front~0_521 v_~n1~0_344) (< v_~q1_front~0_521 v_~q1_back~0_586)) 1 0) 0)) (< v_~j~0_476 v_~N~0_342) (= v_~q1_front~0_520 (+ v_~q1_front~0_521 1)) (= v_~q1_back~0_586 (+ v_~q1_back~0_587 1)) (= (+ (select .cse0 (+ v_~q1~0.offset_357 (* v_~q1_front~0_521 4))) 1) v_~i~0_515) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|) (not (= (ite (and (< v_~q2_back~0_595 v_~n2~0_338) (<= 0 v_~q2_back~0_595)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334| 0)) (< v_~i~0_515 v_~N~0_342) (= (+ v_~q2_back~0_595 1) v_~q2_back~0_594))) InVars {~j~0=v_~j~0_476, ~q1~0.offset=v_~q1~0.offset_357, ~n2~0=v_~n2~0_338, ~q1_front~0=v_~q1_front~0_521, ~q1_back~0=v_~q1_back~0_587, ~q2~0.offset=v_~q2~0.offset_333, ~n1~0=v_~n1~0_344, ~q1~0.base=v_~q1~0.base_357, #memory_int=|v_#memory_int_594|, ~q2~0.base=v_~q2~0.base_333, ~N~0=v_~N~0_342, ~q2_back~0=v_~q2_back~0_595} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_255|, ~j~0=v_~j~0_476, ~q1~0.offset=v_~q1~0.offset_357, ~n2~0=v_~n2~0_338, ~q1_front~0=v_~q1_front~0_520, ~i~0=v_~i~0_515, ~q2~0.offset=v_~q2~0.offset_333, ~n1~0=v_~n1~0_344, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_249|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_334|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_238|, ~N~0=v_~N~0_342, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_238|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_415|, ~q1_back~0=v_~q1_back~0_586, ~q1~0.base=v_~q1~0.base_357, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_415|, #memory_int=|v_#memory_int_594|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_255|, ~q2~0.base=v_~q2~0.base_333, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_249|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_255|, ~q2_back~0=v_~q2_back~0_594} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:25:51,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L65-1-->thread2EXIT: Formula: (and (not (= (ite (= v_~j~0_473 (select (select |v_#memory_int_592| v_~q1~0.base_355) (+ v_~q1~0.offset_355 (* v_~q1_back~0_583 4)))) 1 0) 0)) (not (= (ite (and (< v_~q1_back~0_583 v_~n1~0_342) (<= 0 v_~q1_back~0_583)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_332| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|) (= v_~j~0_472 (+ (select (select |v_#memory_int_592| v_~q2~0.base_331) (+ v_~q2~0.offset_331 (* v_~q2_front~0_414 4))) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_332| (ite (and (< v_~q2_front~0_414 v_~q2_back~0_592) (< v_~q2_front~0_414 v_~n2~0_336) (<= 0 v_~q2_front~0_414)) 1 0)) (not (< v_~j~0_472 v_~N~0_340)) (< v_~j~0_473 v_~N~0_340) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332| 0)) (= v_~q2_front~0_413 (+ v_~q2_front~0_414 1)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_55|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_55| 0) (= (+ v_~q1_back~0_583 1) v_~q1_back~0_582)) InVars {~j~0=v_~j~0_473, ~q1~0.offset=v_~q1~0.offset_355, ~n2~0=v_~n2~0_336, ~q1_back~0=v_~q1_back~0_583, ~q2~0.offset=v_~q2~0.offset_331, ~n1~0=v_~n1~0_342, ~q1~0.base=v_~q1~0.base_355, #memory_int=|v_#memory_int_592|, ~q2_front~0=v_~q2_front~0_414, ~q2~0.base=v_~q2~0.base_331, ~N~0=v_~N~0_340, ~q2_back~0=v_~q2_back~0_592} OutVars{~j~0=v_~j~0_472, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_194|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_188|, ~q1~0.offset=v_~q1~0.offset_355, ~n2~0=v_~n2~0_336, ~q2~0.offset=v_~q2~0.offset_331, ~n1~0=v_~n1~0_342, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_332|, ~q2_front~0=v_~q2_front~0_413, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_236|, ~N~0=v_~N~0_340, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_236|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_188|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_55|, ~q1_back~0=v_~q1_back~0_582, ~q1~0.base=v_~q1~0.base_355, #memory_int=|v_#memory_int_592|, ~q2~0.base=v_~q2~0.base_331, ~q2_back~0=v_~q2_back~0_592} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:25:52,175 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:25:52,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1170 [2022-12-13 02:25:52,175 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 189 transitions, 3718 flow [2022-12-13 02:25:52,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:52,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:52,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:52,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 02:25:52,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 02:25:52,383 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:52,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1676311906, now seen corresponding path program 1 times [2022-12-13 02:25:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:52,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424597742] [2022-12-13 02:25:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:52,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:52,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424597742] [2022-12-13 02:25:52,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424597742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:52,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:52,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:25:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270567191] [2022-12-13 02:25:52,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:52,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:25:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:52,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:25:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:25:52,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 02:25:52,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 189 transitions, 3718 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:52,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:52,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 02:25:52,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:52,775 INFO L130 PetriNetUnfolder]: 407/777 cut-off events. [2022-12-13 02:25:52,775 INFO L131 PetriNetUnfolder]: For 10235/10235 co-relation queries the response was YES. [2022-12-13 02:25:52,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 777 events. 407/777 cut-off events. For 10235/10235 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3868 event pairs, 143 based on Foata normal form. 64/835 useless extension candidates. Maximal degree in co-relation 6186. Up to 558 conditions per place. [2022-12-13 02:25:52,779 INFO L137 encePairwiseOnDemand]: 31/43 looper letters, 143 selfloop transitions, 6 changer transitions 33/182 dead transitions. [2022-12-13 02:25:52,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 182 transitions, 3710 flow [2022-12-13 02:25:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:25:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:25:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 02:25:52,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2558139534883721 [2022-12-13 02:25:52,781 INFO L175 Difference]: Start difference. First operand has 138 places, 189 transitions, 3718 flow. Second operand 6 states and 66 transitions. [2022-12-13 02:25:52,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 182 transitions, 3710 flow [2022-12-13 02:25:52,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 182 transitions, 3607 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-12-13 02:25:52,810 INFO L231 Difference]: Finished difference. Result has 135 places, 137 transitions, 2566 flow [2022-12-13 02:25:52,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2995, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2566, PETRI_PLACES=135, PETRI_TRANSITIONS=137} [2022-12-13 02:25:52,810 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 113 predicate places. [2022-12-13 02:25:52,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:52,810 INFO L89 Accepts]: Start accepts. Operand has 135 places, 137 transitions, 2566 flow [2022-12-13 02:25:52,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:52,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:52,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 137 transitions, 2566 flow [2022-12-13 02:25:52,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 137 transitions, 2566 flow [2022-12-13 02:25:52,838 INFO L130 PetriNetUnfolder]: 93/275 cut-off events. [2022-12-13 02:25:52,838 INFO L131 PetriNetUnfolder]: For 2603/2608 co-relation queries the response was YES. [2022-12-13 02:25:52,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 275 events. 93/275 cut-off events. For 2603/2608 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1389 event pairs, 5 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 1918. Up to 73 conditions per place. [2022-12-13 02:25:52,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 137 transitions, 2566 flow [2022-12-13 02:25:52,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-13 02:25:53,907 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,907 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,907 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,907 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,907 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,908 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,908 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,908 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,908 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,908 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,908 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:53,908 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:25:54,440 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:25:54,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1630 [2022-12-13 02:25:54,440 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 135 transitions, 2557 flow [2022-12-13 02:25:54,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:54,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 02:25:54,441 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1750664210, now seen corresponding path program 1 times [2022-12-13 02:25:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253882791] [2022-12-13 02:25:54,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:54,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253882791] [2022-12-13 02:25:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253882791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:25:54,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:25:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:25:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131753054] [2022-12-13 02:25:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:25:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:25:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:25:54,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:25:54,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 02:25:54,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 135 transitions, 2557 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:54,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:54,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 02:25:54,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:25:54,877 INFO L130 PetriNetUnfolder]: 307/568 cut-off events. [2022-12-13 02:25:54,877 INFO L131 PetriNetUnfolder]: For 7512/7512 co-relation queries the response was YES. [2022-12-13 02:25:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 568 events. 307/568 cut-off events. For 7512/7512 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2463 event pairs, 127 based on Foata normal form. 12/574 useless extension candidates. Maximal degree in co-relation 4417. Up to 558 conditions per place. [2022-12-13 02:25:54,881 INFO L137 encePairwiseOnDemand]: 36/43 looper letters, 125 selfloop transitions, 0 changer transitions 7/132 dead transitions. [2022-12-13 02:25:54,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 132 transitions, 2651 flow [2022-12-13 02:25:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:25:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:25:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 02:25:54,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2022-12-13 02:25:54,888 INFO L175 Difference]: Start difference. First operand has 128 places, 135 transitions, 2557 flow. Second operand 4 states and 48 transitions. [2022-12-13 02:25:54,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 132 transitions, 2651 flow [2022-12-13 02:25:54,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 132 transitions, 2272 flow, removed 24 selfloop flow, removed 21 redundant places. [2022-12-13 02:25:54,908 INFO L231 Difference]: Finished difference. Result has 109 places, 125 transitions, 1923 flow [2022-12-13 02:25:54,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1923, PETRI_PLACES=109, PETRI_TRANSITIONS=125} [2022-12-13 02:25:54,908 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 87 predicate places. [2022-12-13 02:25:54,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:25:54,909 INFO L89 Accepts]: Start accepts. Operand has 109 places, 125 transitions, 1923 flow [2022-12-13 02:25:54,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:25:54,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:25:54,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 125 transitions, 1923 flow [2022-12-13 02:25:54,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 125 transitions, 1923 flow [2022-12-13 02:25:54,930 INFO L130 PetriNetUnfolder]: 85/233 cut-off events. [2022-12-13 02:25:54,930 INFO L131 PetriNetUnfolder]: For 1182/1185 co-relation queries the response was YES. [2022-12-13 02:25:54,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 233 events. 85/233 cut-off events. For 1182/1185 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1057 event pairs, 5 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 1446. Up to 61 conditions per place. [2022-12-13 02:25:54,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 125 transitions, 1923 flow [2022-12-13 02:25:54,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 02:25:54,933 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:25:54,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 02:25:54,933 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 125 transitions, 1923 flow [2022-12-13 02:25:54,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:25:54,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:25:54,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:25:54,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 02:25:54,934 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:25:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:25:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash 298215724, now seen corresponding path program 1 times [2022-12-13 02:25:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:25:54,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233079957] [2022-12-13 02:25:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:25:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:56,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:25:56,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233079957] [2022-12-13 02:25:56,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233079957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:25:56,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137192623] [2022-12-13 02:25:56,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:25:56,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:25:56,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:25:56,063 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 02:25:56,064 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 02:25:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:25:56,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 02:25:56,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:25:56,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 02:25:56,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-12-13 02:25:56,230 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:25:56,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 02:25:56,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:25:56,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:25:56,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 02:25:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:56,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:25:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:25:59,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137192623] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:25:59,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:25:59,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 02:25:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359272420] [2022-12-13 02:25:59,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:25:59,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 02:25:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:25:59,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 02:25:59,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=383, Unknown=4, NotChecked=0, Total=462 [2022-12-13 02:25:59,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-13 02:25:59,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 125 transitions, 1923 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 02:25:59,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:25:59,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-13 02:25:59,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:01,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:26:04,297 INFO L130 PetriNetUnfolder]: 356/651 cut-off events. [2022-12-13 02:26:04,298 INFO L131 PetriNetUnfolder]: For 4342/4342 co-relation queries the response was YES. [2022-12-13 02:26:04,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 651 events. 356/651 cut-off events. For 4342/4342 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2960 event pairs, 28 based on Foata normal form. 5/654 useless extension candidates. Maximal degree in co-relation 3940. Up to 297 conditions per place. [2022-12-13 02:26:04,301 INFO L137 encePairwiseOnDemand]: 6/36 looper letters, 71 selfloop transitions, 120 changer transitions 11/202 dead transitions. [2022-12-13 02:26:04,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 202 transitions, 2829 flow [2022-12-13 02:26:04,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 02:26:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 02:26:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 152 transitions. [2022-12-13 02:26:04,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15637860082304528 [2022-12-13 02:26:04,312 INFO L175 Difference]: Start difference. First operand has 101 places, 125 transitions, 1923 flow. Second operand 27 states and 152 transitions. [2022-12-13 02:26:04,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 202 transitions, 2829 flow [2022-12-13 02:26:04,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 202 transitions, 2683 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 02:26:04,325 INFO L231 Difference]: Finished difference. Result has 123 places, 151 transitions, 2455 flow [2022-12-13 02:26:04,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2455, PETRI_PLACES=123, PETRI_TRANSITIONS=151} [2022-12-13 02:26:04,326 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 101 predicate places. [2022-12-13 02:26:04,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:04,326 INFO L89 Accepts]: Start accepts. Operand has 123 places, 151 transitions, 2455 flow [2022-12-13 02:26:04,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:04,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:04,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 151 transitions, 2455 flow [2022-12-13 02:26:04,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 151 transitions, 2455 flow [2022-12-13 02:26:04,351 INFO L130 PetriNetUnfolder]: 110/280 cut-off events. [2022-12-13 02:26:04,351 INFO L131 PetriNetUnfolder]: For 1854/1855 co-relation queries the response was YES. [2022-12-13 02:26:04,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 280 events. 110/280 cut-off events. For 1854/1855 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1311 event pairs, 6 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 1889. Up to 81 conditions per place. [2022-12-13 02:26:04,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 151 transitions, 2455 flow [2022-12-13 02:26:04,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 02:26:04,358 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:04,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:04,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:05,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:06,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:06,353 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [886] L47-1-->L65-1: Formula: (let ((.cse0 (select |v_#memory_int_629| v_~q2~0.base_359))) (and (= (+ v_~q2_back~0_636 1) v_~q2_back~0_635) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_369| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_369|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_369| 0)) (not (= (ite (and (< v_~q2_back~0_636 v_~n2~0_364) (<= 0 v_~q2_back~0_636)) 1 0) 0)) (< v_~i~0_552 v_~N~0_372) (= v_~q2_front~0_458 (+ v_~q2_front~0_459 1)) (= v_~j~0_521 (+ (select .cse0 (+ (* v_~q2_front~0_459 4) v_~q2~0.offset_359)) 1)) (= (ite (= (select .cse0 (+ v_~q2~0.offset_359 (* 4 v_~q2_back~0_636))) v_~i~0_552) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_460|) (= (ite (and (< v_~q2_front~0_459 v_~n2~0_364) (< v_~q2_front~0_459 v_~q2_back~0_635) (<= 0 v_~q2_front~0_459)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_369|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_460| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_460| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_460|))) InVars {~n2~0=v_~n2~0_364, ~i~0=v_~i~0_552, ~q2~0.offset=v_~q2~0.offset_359, #memory_int=|v_#memory_int_629|, ~q2_front~0=v_~q2_front~0_459, ~q2~0.base=v_~q2~0.base_359, ~N~0=v_~N~0_372, ~q2_back~0=v_~q2_back~0_636} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_271|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_218|, ~j~0=v_~j~0_521, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_212|, ~n2~0=v_~n2~0_364, ~i~0=v_~i~0_552, ~q2~0.offset=v_~q2~0.offset_359, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_369|, ~q2_front~0=v_~q2_front~0_458, ~N~0=v_~N~0_372, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_212|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_369|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_460|, #memory_int=|v_#memory_int_629|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_460|, ~q2~0.base=v_~q2~0.base_359, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_271|, ~q2_back~0=v_~q2_back~0_635} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:06,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [706] L47-1-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= v_~j~0_119 (+ (select (select |v_#memory_int_217| v_~q2~0.base_80) (+ (* v_~q2_front~0_111 4) v_~q2~0.offset_80)) 1)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= (ite (and (< v_~q2_front~0_111 v_~q2_back~0_131) (< v_~q2_front~0_111 v_~n2~0_94) (<= 0 v_~q2_front~0_111)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= (+ v_~q2_front~0_111 1) v_~q2_front~0_110) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (< v_~i~0_123 v_~N~0_78))) InVars {~n2~0=v_~n2~0_94, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, #memory_int=|v_#memory_int_217|, ~q2_front~0=v_~q2_front~0_111, ~q2~0.base=v_~q2~0.base_80, ~N~0=v_~N~0_78, ~q2_back~0=v_~q2_back~0_131} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_34|, ~j~0=v_~j~0_119, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_28|, ~n2~0=v_~n2~0_94, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~i~0=v_~i~0_123, ~q2~0.offset=v_~q2~0.offset_80, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, ~q2_front~0=v_~q2_front~0_110, ~N~0=v_~N~0_78, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_28|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, #memory_int=|v_#memory_int_217|, ~q2~0.base=v_~q2~0.base_80, ~q2_back~0=v_~q2_back~0_131, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 02:26:06,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [885] L47-1-->L47-1: Formula: (and (= (+ v_~q1_front~0_580 1) v_~q1_front~0_579) (not (= (ite (and (< v_~q2_back~0_632 v_~n2~0_362) (<= 0 v_~q2_back~0_632)) 1 0) 0)) (= (+ (select (select |v_#memory_int_627| v_~q1~0.base_387) (+ v_~q1~0.offset_387 (* v_~q1_front~0_580 4))) 1) v_~i~0_548) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_456| 0)) (= (ite (and (< v_~q1_front~0_580 v_~q1_back~0_637) (<= 0 v_~q1_front~0_580) (< v_~q1_front~0_580 v_~n1~0_374)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_456|) (< v_~i~0_549 v_~N~0_370) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_456| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_456|) (not (= (ite (= v_~i~0_549 (select (select |v_#memory_int_627| v_~q2~0.base_357) (+ (* 4 v_~q2_back~0_632) v_~q2~0.offset_357))) 1 0) 0)) (= (+ v_~q2_back~0_632 1) v_~q2_back~0_631)) InVars {~q1~0.offset=v_~q1~0.offset_387, ~q1_front~0=v_~q1_front~0_580, ~n2~0=v_~n2~0_362, ~q1_back~0=v_~q1_back~0_637, ~i~0=v_~i~0_549, ~n1~0=v_~n1~0_374, ~q2~0.offset=v_~q2~0.offset_357, ~q1~0.base=v_~q1~0.base_387, #memory_int=|v_#memory_int_627|, ~q2~0.base=v_~q2~0.base_357, ~N~0=v_~N~0_370, ~q2_back~0=v_~q2_back~0_632} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_269|, ~q1~0.offset=v_~q1~0.offset_387, ~q1_front~0=v_~q1_front~0_579, ~n2~0=v_~n2~0_362, ~i~0=v_~i~0_548, ~n1~0=v_~n1~0_374, ~q2~0.offset=v_~q2~0.offset_357, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_281|, ~N~0=v_~N~0_370, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_456|, ~q1_back~0=v_~q1_back~0_637, ~q1~0.base=v_~q1~0.base_387, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_287|, #memory_int=|v_#memory_int_627|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_456|, ~q2~0.base=v_~q2~0.base_357, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_281|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_269|, ~q2_back~0=v_~q2_back~0_631} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:26:07,171 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 02:26:07,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2846 [2022-12-13 02:26:07,172 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 147 transitions, 2499 flow [2022-12-13 02:26:07,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 02:26:07,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:07,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:07,178 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 02:26:07,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:07,373 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2092098710, now seen corresponding path program 2 times [2022-12-13 02:26:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:07,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22576660] [2022-12-13 02:26:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22576660] [2022-12-13 02:26:08,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22576660] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593390750] [2022-12-13 02:26:08,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:26:08,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:08,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:08,499 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 02:26:08,501 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 02:26:08,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:26:08,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:26:08,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 02:26:08,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:08,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2022-12-13 02:26:08,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 02:26:08,790 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:26:08,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 02:26:08,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:26:09,287 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-13 02:26:09,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-12-13 02:26:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:09,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:26:10,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593390750] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:26:10,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:26:10,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-13 02:26:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666296292] [2022-12-13 02:26:10,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:26:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 02:26:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:26:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 02:26:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=314, Unknown=4, NotChecked=0, Total=380 [2022-12-13 02:26:10,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 02:26:10,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 147 transitions, 2499 flow. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 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 02:26:10,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:26:10,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 02:26:10,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:26:15,140 INFO L130 PetriNetUnfolder]: 531/933 cut-off events. [2022-12-13 02:26:15,141 INFO L131 PetriNetUnfolder]: For 7733/7733 co-relation queries the response was YES. [2022-12-13 02:26:15,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6915 conditions, 933 events. 531/933 cut-off events. For 7733/7733 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4574 event pairs, 31 based on Foata normal form. 8/940 useless extension candidates. Maximal degree in co-relation 6859. Up to 499 conditions per place. [2022-12-13 02:26:15,147 INFO L137 encePairwiseOnDemand]: 6/41 looper letters, 111 selfloop transitions, 153 changer transitions 14/278 dead transitions. [2022-12-13 02:26:15,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 278 transitions, 4672 flow [2022-12-13 02:26:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 02:26:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 02:26:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 170 transitions. [2022-12-13 02:26:15,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13821138211382114 [2022-12-13 02:26:15,157 INFO L175 Difference]: Start difference. First operand has 118 places, 147 transitions, 2499 flow. Second operand 30 states and 170 transitions. [2022-12-13 02:26:15,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 278 transitions, 4672 flow [2022-12-13 02:26:15,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 278 transitions, 4161 flow, removed 109 selfloop flow, removed 14 redundant places. [2022-12-13 02:26:15,193 INFO L231 Difference]: Finished difference. Result has 148 places, 223 transitions, 3970 flow [2022-12-13 02:26:15,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3970, PETRI_PLACES=148, PETRI_TRANSITIONS=223} [2022-12-13 02:26:15,194 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 126 predicate places. [2022-12-13 02:26:15,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:26:15,194 INFO L89 Accepts]: Start accepts. Operand has 148 places, 223 transitions, 3970 flow [2022-12-13 02:26:15,195 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:26:15,195 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:26:15,195 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 223 transitions, 3970 flow [2022-12-13 02:26:15,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 223 transitions, 3970 flow [2022-12-13 02:26:15,257 INFO L130 PetriNetUnfolder]: 283/594 cut-off events. [2022-12-13 02:26:15,257 INFO L131 PetriNetUnfolder]: For 4883/4885 co-relation queries the response was YES. [2022-12-13 02:26:15,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 594 events. 283/594 cut-off events. For 4883/4885 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3136 event pairs, 9 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 4316. Up to 215 conditions per place. [2022-12-13 02:26:15,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 223 transitions, 3970 flow [2022-12-13 02:26:15,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-13 02:26:15,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:15,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:15,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:15,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:16,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:16,076 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:16,076 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:16,076 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:16,076 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:16,076 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:16,076 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:16,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [881] L65-1-->L65-1: Formula: (and (not (= 0 (ite (and (<= 0 v_~q1_back~0_622) (< v_~q1_back~0_622 v_~n1~0_366)) 1 0))) (= (+ v_~q2_front~0_447 1) v_~q2_front~0_446) (= (+ v_~q1_back~0_622 1) v_~q1_back~0_621) (< v_~j~0_508 v_~N~0_362) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355| (ite (and (< v_~q2_front~0_447 v_~q2_back~0_625) (< v_~q2_front~0_447 v_~n2~0_356) (<= 0 v_~q2_front~0_447)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_355|) (not (= (ite (= v_~j~0_508 (select (select |v_#memory_int_619| v_~q1~0.base_379) (+ v_~q1~0.offset_379 (* v_~q1_back~0_622 4)))) 1 0) 0)) (= v_~j~0_507 (+ (select (select |v_#memory_int_619| v_~q2~0.base_351) (+ v_~q2~0.offset_351 (* v_~q2_front~0_447 4))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_355| 0))) InVars {~j~0=v_~j~0_508, ~q1~0.offset=v_~q1~0.offset_379, ~n2~0=v_~n2~0_356, ~q1_back~0=v_~q1_back~0_622, ~q2~0.offset=v_~q2~0.offset_351, ~n1~0=v_~n1~0_366, ~q1~0.base=v_~q1~0.base_379, #memory_int=|v_#memory_int_619|, ~q2_front~0=v_~q2_front~0_447, ~q2~0.base=v_~q2~0.base_351, ~N~0=v_~N~0_362, ~q2_back~0=v_~q2_back~0_625} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_212|, ~j~0=v_~j~0_507, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_206|, ~q1~0.offset=v_~q1~0.offset_379, ~n2~0=v_~n2~0_356, ~q2~0.offset=v_~q2~0.offset_351, ~n1~0=v_~n1~0_366, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_355|, ~q2_front~0=v_~q2_front~0_446, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_252|, ~N~0=v_~N~0_362, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_252|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_206|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_355|, ~q1_back~0=v_~q1_back~0_621, ~q1~0.base=v_~q1~0.base_379, #memory_int=|v_#memory_int_619|, ~q2~0.base=v_~q2~0.base_351, ~q2_back~0=v_~q2_back~0_625} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-13 02:26:16,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:16,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:17,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_623| v_~q1~0.base_383))) (and (not (= (ite (and (<= 0 v_~q1_back~0_630) (< v_~q1_back~0_630 v_~n1~0_370)) 1 0) 0)) (= (+ (select .cse0 (+ v_~q1~0.offset_383 (* v_~q1_front~0_572 4))) 1) v_~i~0_544) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_452| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_452|) (= (+ v_~q1_front~0_572 1) v_~q1_front~0_571) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_452| (ite (and (<= 0 v_~q1_front~0_572) (< v_~q1_front~0_572 v_~n1~0_370) (< v_~q1_front~0_572 v_~q1_back~0_629)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_452| 0)) (< v_~j~0_515 v_~N~0_366) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_363| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_363| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_363|) (= (+ v_~q1_back~0_630 1) v_~q1_back~0_629) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_363| (ite (= v_~j~0_515 (select .cse0 (+ v_~q1~0.offset_383 (* v_~q1_back~0_630 4)))) 1 0)))) InVars {~j~0=v_~j~0_515, ~q1~0.offset=v_~q1~0.offset_383, ~q1_front~0=v_~q1_front~0_572, ~q1_back~0=v_~q1_back~0_630, ~n1~0=v_~n1~0_370, ~q1~0.base=v_~q1~0.base_383, #memory_int=|v_#memory_int_623|, ~N~0=v_~N~0_366} OutVars{~j~0=v_~j~0_515, ~q1~0.offset=v_~q1~0.offset_383, ~q1_front~0=v_~q1_front~0_571, ~i~0=v_~i~0_544, ~n1~0=v_~n1~0_370, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_277|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_363|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_256|, ~N~0=v_~N~0_366, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_256|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_363|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_452|, ~q1_back~0=v_~q1_back~0_629, ~q1~0.base=v_~q1~0.base_383, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_283|, #memory_int=|v_#memory_int_623|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_452|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_277|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:18,088 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:18,088 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:18,088 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:18,088 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:18,089 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:18,089 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:18,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [850] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_547| v_~q1~0.base_327))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_286| (ite (= v_~j~0_420 (select .cse0 (+ v_~q1~0.offset_327 (* v_~q1_back~0_520 4)))) 1 0)) (< v_~j~0_420 v_~N~0_312) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_374| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374| 0)) (= v_~q1_front~0_473 (+ v_~q1_front~0_474 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_286| 0)) (= (+ v_~q1_back~0_520 1) v_~q1_back~0_519) (not (= (ite (and (<= 0 v_~q1_back~0_520) (< v_~q1_back~0_520 v_~n1~0_314)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_286| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_286|) (= v_~i~0_476 (+ (select .cse0 (+ v_~q1~0.offset_327 (* v_~q1_front~0_474 4))) 1)) (= (ite (and (< v_~q1_front~0_474 v_~q1_back~0_519) (< v_~q1_front~0_474 v_~n1~0_314) (<= 0 v_~q1_front~0_474)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_374|))) InVars {~j~0=v_~j~0_420, ~q1~0.offset=v_~q1~0.offset_327, ~q1_front~0=v_~q1_front~0_474, ~q1_back~0=v_~q1_back~0_520, ~n1~0=v_~n1~0_314, ~q1~0.base=v_~q1~0.base_327, #memory_int=|v_#memory_int_547|, ~N~0=v_~N~0_312} OutVars{~j~0=v_~j~0_420, ~q1~0.offset=v_~q1~0.offset_327, ~q1_front~0=v_~q1_front~0_473, ~i~0=v_~i~0_476, ~n1~0=v_~n1~0_314, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_223|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_286|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_198|, ~N~0=v_~N~0_312, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_198|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_286|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_374|, ~q1_back~0=v_~q1_back~0_519, ~q1~0.base=v_~q1~0.base_327, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_229|, #memory_int=|v_#memory_int_547|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_374|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_223|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:19,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:19,639 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-13 02:26:19,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:26:19,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [895] L97-4-->L65-1: Formula: (and (= v_~j~0_544 (+ (select (select |v_#memory_int_650| v_~q2~0.base_375) (+ (* v_~q2_front~0_484 4) v_~q2~0.offset_375)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_392| (ite (and (< v_~q2_front~0_484 v_~q2_back~0_664) (<= 0 v_~q2_front~0_484) (< v_~q2_front~0_484 v_~n2~0_380)) 1 0)) (= (+ v_~q2_front~0_484 1) v_~q2_front~0_483) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_392| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392| 0)) (= |v_ULTIMATE.start_main_#t~mem22#1_78| (select (select |v_#memory_int_650| |v_ULTIMATE.start_main_~#t1~0#1.base_61|) |v_ULTIMATE.start_main_~#t1~0#1.offset_61|))) InVars {~n2~0=v_~n2~0_380, ~q2~0.offset=v_~q2~0.offset_375, #memory_int=|v_#memory_int_650|, ~q2_front~0=v_~q2_front~0_484, ~q2~0.base=v_~q2~0.base_375, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_61|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_61|, ~q2_back~0=v_~q2_back~0_664} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_232|, ~j~0=v_~j~0_544, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_226|, ~n2~0=v_~n2~0_380, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_61|, ~q2~0.offset=v_~q2~0.offset_375, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_392|, ~q2_front~0=v_~q2_front~0_483, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_61|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_61|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_226|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_392|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_119|, #memory_int=|v_#memory_int_650|, ~q2~0.base=v_~q2~0.base_375, ~q2_back~0=v_~q2_back~0_664, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_78|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, ULTIMATE.start_main_#t~mem22#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:26:20,135 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [896] L97-4-->L47-1: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_479| 0)) (= |v_ULTIMATE.start_main_#t~mem22#1_80| (select (select |v_#memory_int_652| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) |v_ULTIMATE.start_main_~#t1~0#1.offset_63|)) (= (+ (select (select |v_#memory_int_652| v_~q1~0.base_401) (+ (* v_~q1_front~0_597 4) v_~q1~0.offset_401)) 1) v_~i~0_573) (= (ite (and (< v_~q1_front~0_597 v_~q1_back~0_660) (<= 0 v_~q1_front~0_597) (< v_~q1_front~0_597 v_~n1~0_388)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_479|) (= (+ v_~q1_front~0_597 1) v_~q1_front~0_596) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_479| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_479|)) InVars {~q1~0.offset=v_~q1~0.offset_401, ~q1_front~0=v_~q1_front~0_597, ~q1_back~0=v_~q1_back~0_660, ~n1~0=v_~n1~0_388, ~q1~0.base=v_~q1~0.base_401, #memory_int=|v_#memory_int_652|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_63|} OutVars{~q1~0.offset=v_~q1~0.offset_401, ~q1_front~0=v_~q1_front~0_596, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_63|, ~i~0=v_~i~0_573, ~n1~0=v_~n1~0_388, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_291|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_63|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_479|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_121|, ~q1_back~0=v_~q1_back~0_660, ~q1~0.base=v_~q1~0.base_401, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_297|, #memory_int=|v_#memory_int_652|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_479|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_291|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_80|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, ~q1_front~0, ULTIMATE.start_main_#t~nondet21#1, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-13 02:26:20,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [899] L65-1-->L98-1: Formula: (and (= v_~j~0_550 (+ (select (select |v_#memory_int_656| v_~q2~0.base_379) (+ v_~q2~0.offset_379 (* v_~q2_front~0_492 4))) 1)) (not (= (ite (and (<= 0 v_~q1_back~0_669) (< v_~q1_back~0_669 v_~n1~0_392)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_398| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_398|) (= (+ v_~q2_front~0_492 1) v_~q2_front~0_491) (= |v_ULTIMATE.start_main_#t~mem22#1_82| (select (select |v_#memory_int_656| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) |v_ULTIMATE.start_main_~#t1~0#1.offset_65|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_398| (ite (and (< v_~q2_front~0_492 v_~n2~0_384) (<= 0 v_~q2_front~0_492) (< v_~q2_front~0_492 v_~q2_back~0_668)) 1 0)) (< v_~j~0_551 v_~N~0_392) (not (= (ite (= v_~j~0_551 (select (select |v_#memory_int_656| v_~q1~0.base_405) (+ v_~q1~0.offset_405 (* v_~q1_back~0_669 4)))) 1 0) 0)) (= (+ v_~q1_back~0_669 1) v_~q1_back~0_668) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_398| 0))) InVars {~j~0=v_~j~0_551, ~q1~0.offset=v_~q1~0.offset_405, ~n2~0=v_~n2~0_384, ~q2~0.offset=v_~q2~0.offset_379, ~n1~0=v_~n1~0_392, ~q2_front~0=v_~q2_front~0_492, ~N~0=v_~N~0_392, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_65|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_65|, ~q1_back~0=v_~q1_back~0_669, ~q1~0.base=v_~q1~0.base_405, #memory_int=|v_#memory_int_656|, ~q2~0.base=v_~q2~0.base_379, ~q2_back~0=v_~q2_back~0_668} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_236|, ~j~0=v_~j~0_550, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_230|, ~q1~0.offset=v_~q1~0.offset_405, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_65|, ~n2~0=v_~n2~0_384, ~q2~0.offset=v_~q2~0.offset_379, ~n1~0=v_~n1~0_392, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_398|, ~q2_front~0=v_~q2_front~0_491, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_274|, ~N~0=v_~N~0_392, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_65|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_65|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_274|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_230|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_398|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_123|, ~q1_back~0=v_~q1_back~0_668, ~q1~0.base=v_~q1~0.base_405, #memory_int=|v_#memory_int_656|, ~q2~0.base=v_~q2~0.base_379, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_82|, ~q2_back~0=v_~q2_back~0_668} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ULTIMATE.start_main_#t~nondet21#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre20#1, ~q1_back~0, ULTIMATE.start_main_#t~mem22#1] and [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] [2022-12-13 02:26:20,416 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:20,416 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:20,416 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:20,416 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:20,416 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:20,416 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:26:20,642 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 02:26:20,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5448 [2022-12-13 02:26:20,643 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 217 transitions, 4074 flow [2022-12-13 02:26:20,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 19 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 02:26:20,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:26:20,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:26:20,647 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 02:26:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:20,848 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:26:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:26:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 817056949, now seen corresponding path program 1 times [2022-12-13 02:26:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:26:20,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365038965] [2022-12-13 02:26:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:26:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:21,847 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 02:26:21,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:26:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365038965] [2022-12-13 02:26:21,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365038965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:26:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868795352] [2022-12-13 02:26:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:26:21,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:26:21,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:26:21,849 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 02:26:21,850 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 02:26:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:26:21,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 02:26:21,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:26:22,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:26:22,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 02:26:22,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:22,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 02:26:22,380 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 02:26:22,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:26:23,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:23,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 396 [2022-12-13 02:26:23,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:23,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 02:26:23,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:26:23,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 02:27:39,873 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 02:27:39,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868795352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:27:39,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:27:39,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-13 02:27:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764084500] [2022-12-13 02:27:39,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:27:39,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 02:27:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:27:39,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 02:27:39,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-12-13 02:27:39,875 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:27:39,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 217 transitions, 4074 flow. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 02:27:39,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:27:39,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:27:39,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:27:42,987 INFO L130 PetriNetUnfolder]: 639/1116 cut-off events. [2022-12-13 02:27:42,988 INFO L131 PetriNetUnfolder]: For 10993/10993 co-relation queries the response was YES. [2022-12-13 02:27:42,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9402 conditions, 1116 events. 639/1116 cut-off events. For 10993/10993 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 5845 event pairs, 32 based on Foata normal form. 4/1117 useless extension candidates. Maximal degree in co-relation 8829. Up to 529 conditions per place. [2022-12-13 02:27:42,995 INFO L137 encePairwiseOnDemand]: 13/60 looper letters, 80 selfloop transitions, 218 changer transitions 11/309 dead transitions. [2022-12-13 02:27:42,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 309 transitions, 5998 flow [2022-12-13 02:27:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 02:27:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 02:27:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 143 transitions. [2022-12-13 02:27:42,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10833333333333334 [2022-12-13 02:27:42,996 INFO L175 Difference]: Start difference. First operand has 140 places, 217 transitions, 4074 flow. Second operand 22 states and 143 transitions. [2022-12-13 02:27:42,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 309 transitions, 5998 flow [2022-12-13 02:27:43,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 309 transitions, 5786 flow, removed 82 selfloop flow, removed 8 redundant places. [2022-12-13 02:27:43,039 INFO L231 Difference]: Finished difference. Result has 159 places, 265 transitions, 5424 flow [2022-12-13 02:27:43,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3842, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5424, PETRI_PLACES=159, PETRI_TRANSITIONS=265} [2022-12-13 02:27:43,039 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 137 predicate places. [2022-12-13 02:27:43,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:27:43,039 INFO L89 Accepts]: Start accepts. Operand has 159 places, 265 transitions, 5424 flow [2022-12-13 02:27:43,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:27:43,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:27:43,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 265 transitions, 5424 flow [2022-12-13 02:27:43,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 265 transitions, 5424 flow [2022-12-13 02:27:43,115 INFO L130 PetriNetUnfolder]: 320/679 cut-off events. [2022-12-13 02:27:43,116 INFO L131 PetriNetUnfolder]: For 7082/7088 co-relation queries the response was YES. [2022-12-13 02:27:43,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6077 conditions, 679 events. 320/679 cut-off events. For 7082/7088 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 3957 event pairs, 8 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 5988. Up to 243 conditions per place. [2022-12-13 02:27:43,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 265 transitions, 5424 flow [2022-12-13 02:27:43,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 02:27:43,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:27:43,394 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:27:43,539 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [920] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_696| v_~q1~0.base_439))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520| 0)) (not (= (ite (and (< v_~q1_back~0_736 v_~n1~0_426) (<= 0 v_~q1_back~0_736)) 1 0) 0)) (= (+ v_~q1_front~0_652 1) v_~q1_front~0_651) (< v_~j~0_605 v_~N~0_426) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|) (= v_~q1_back~0_735 (+ v_~q1_back~0_736 1)) (= (+ (select .cse0 (+ v_~q1~0.offset_439 (* v_~q1_front~0_652 4))) 1) v_~i~0_606) (= (ite (and (<= 0 v_~q1_front~0_652) (< v_~q1_front~0_652 v_~n1~0_426) (< v_~q1_front~0_652 v_~q1_back~0_735)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453| (ite (= v_~j~0_605 (select .cse0 (+ v_~q1~0.offset_439 (* v_~q1_back~0_736 4)))) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|))) InVars {~j~0=v_~j~0_605, ~q1~0.offset=v_~q1~0.offset_439, ~q1_front~0=v_~q1_front~0_652, ~q1_back~0=v_~q1_back~0_736, ~n1~0=v_~n1~0_426, ~q1~0.base=v_~q1~0.base_439, #memory_int=|v_#memory_int_696|, ~N~0=v_~N~0_426} OutVars{~j~0=v_~j~0_605, ~q1~0.offset=v_~q1~0.offset_439, ~q1_front~0=v_~q1_front~0_651, ~i~0=v_~i~0_606, ~n1~0=v_~n1~0_426, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_321|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_453|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_308|, ~N~0=v_~N~0_426, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_308|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_453|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_520|, ~q1_back~0=v_~q1_back~0_735, ~q1~0.base=v_~q1~0.base_439, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_327|, #memory_int=|v_#memory_int_696|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_520|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_321|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:27:43,748 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:27:43,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 710 [2022-12-13 02:27:43,749 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 263 transitions, 5428 flow [2022-12-13 02:27:43,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 02:27:43,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:27:43,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:27:43,760 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 02:27:43,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 02:27:43,960 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:27:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:27:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash -780977950, now seen corresponding path program 1 times [2022-12-13 02:27:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:27:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568226766] [2022-12-13 02:27:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:27:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:27:44,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568226766] [2022-12-13 02:27:44,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568226766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:27:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530499297] [2022-12-13 02:27:44,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:27:44,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:27:44,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:27:44,685 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 02:27:44,687 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 02:27:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:27:44,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:27:44,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:27:44,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:27:44,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 02:27:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:27:45,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:27:45,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:27:45,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 280 [2022-12-13 02:28:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:01,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530499297] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:01,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:01,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:28:01,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247447584] [2022-12-13 02:28:01,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:01,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:28:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:01,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:28:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 02:28:01,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 02:28:01,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 263 transitions, 5428 flow. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:01,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:01,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 02:28:01,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:05,269 INFO L130 PetriNetUnfolder]: 698/1207 cut-off events. [2022-12-13 02:28:05,269 INFO L131 PetriNetUnfolder]: For 13743/13743 co-relation queries the response was YES. [2022-12-13 02:28:05,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 1207 events. 698/1207 cut-off events. For 13743/13743 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6333 event pairs, 33 based on Foata normal form. 17/1219 useless extension candidates. Maximal degree in co-relation 10649. Up to 549 conditions per place. [2022-12-13 02:28:05,277 INFO L137 encePairwiseOnDemand]: 10/60 looper letters, 105 selfloop transitions, 254 changer transitions 18/377 dead transitions. [2022-12-13 02:28:05,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 377 transitions, 7647 flow [2022-12-13 02:28:05,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 02:28:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 02:28:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 173 transitions. [2022-12-13 02:28:05,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.11089743589743589 [2022-12-13 02:28:05,278 INFO L175 Difference]: Start difference. First operand has 150 places, 263 transitions, 5428 flow. Second operand 26 states and 173 transitions. [2022-12-13 02:28:05,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 377 transitions, 7647 flow [2022-12-13 02:28:05,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 377 transitions, 7486 flow, removed 43 selfloop flow, removed 10 redundant places. [2022-12-13 02:28:05,338 INFO L231 Difference]: Finished difference. Result has 174 places, 319 transitions, 7271 flow [2022-12-13 02:28:05,339 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5291, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=7271, PETRI_PLACES=174, PETRI_TRANSITIONS=319} [2022-12-13 02:28:05,339 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 152 predicate places. [2022-12-13 02:28:05,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:05,339 INFO L89 Accepts]: Start accepts. Operand has 174 places, 319 transitions, 7271 flow [2022-12-13 02:28:05,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:05,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:05,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 319 transitions, 7271 flow [2022-12-13 02:28:05,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 319 transitions, 7271 flow [2022-12-13 02:28:05,424 INFO L130 PetriNetUnfolder]: 337/695 cut-off events. [2022-12-13 02:28:05,424 INFO L131 PetriNetUnfolder]: For 9185/9201 co-relation queries the response was YES. [2022-12-13 02:28:05,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7160 conditions, 695 events. 337/695 cut-off events. For 9185/9201 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 3950 event pairs, 5 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 7058. Up to 262 conditions per place. [2022-12-13 02:28:05,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 319 transitions, 7271 flow [2022-12-13 02:28:05,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-13 02:28:05,554 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:05,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:05,901 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:28:05,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 562 [2022-12-13 02:28:05,901 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 317 transitions, 7275 flow [2022-12-13 02:28:05,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:05,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:05,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:05,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:06,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 02:28:06,113 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -127656624, now seen corresponding path program 1 times [2022-12-13 02:28:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:06,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647284336] [2022-12-13 02:28:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:07,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:07,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647284336] [2022-12-13 02:28:07,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647284336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:07,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924697966] [2022-12-13 02:28:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:07,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:07,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:07,282 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:07,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 02:28:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:07,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 02:28:07,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:07,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 02:28:07,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-12-13 02:28:07,504 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:28:07,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 02:28:07,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:28:07,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:07,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-12-13 02:28:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:07,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:28:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:08,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924697966] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:28:08,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:28:08,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:28:08,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867951037] [2022-12-13 02:28:08,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:28:08,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:28:08,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:08,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:28:08,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=278, Unknown=2, NotChecked=0, Total=342 [2022-12-13 02:28:08,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-13 02:28:08,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 317 transitions, 7275 flow. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:08,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:08,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-13 02:28:08,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:12,343 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q2_front~0 4))) (let ((.cse13 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset .cse5)))) (let ((.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse14 (< (+ .cse13 1) c_~N~0)) (.cse8 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse1 (not (< c_~q1_back~0 c_~n1~0)))) (and (<= 1 c_~N~0) (not (< c_~j~0 c_~N~0)) (<= c_~j~0 c_~N~0) (or .cse0 .cse1 (let ((.cse9 (+ c_~i~0 1)) (.cse6 (* c_~q2_back~0 4))) (and (forall ((v_ArrVal_1383 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1383))) (let ((.cse2 (select .cse7 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse4 (select .cse7 ~q2~0.base))) (or (< (select .cse4 (+ ~q2~0.offset .cse5)) c_~i~0) (not (= (select .cse4 (+ ~q2~0.offset .cse6)) c_~i~0))))) (< (select .cse2 .cse8) .cse9))))) (forall ((v_ArrVal_1383 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1383))) (let ((.cse10 (select .cse12 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse10 .cse3))) (< (select .cse10 .cse8) c_~i~0) (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse11 (select .cse12 ~q2~0.base))) (or (< (select .cse11 (+ ~q2~0.offset .cse5)) .cse9) (not (= (select .cse11 (+ ~q2~0.offset .cse6)) c_~i~0)))))))))))) (or (and (< .cse13 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) .cse14)) (< c_~i~0 c_~N~0)) (let ((.cse15 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse15 .cse3) c_~j~0)) (let ((.cse16 (select .cse15 .cse8))) (and (or (< .cse13 c_~N~0) (< (+ .cse16 1) c_~N~0)) (or (< .cse16 c_~N~0) .cse14))) .cse0 .cse1)) (<= c_~i~0 1))))) is different from false [2022-12-13 02:28:13,844 INFO L130 PetriNetUnfolder]: 722/1259 cut-off events. [2022-12-13 02:28:13,845 INFO L131 PetriNetUnfolder]: For 20615/20615 co-relation queries the response was YES. [2022-12-13 02:28:13,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12656 conditions, 1259 events. 722/1259 cut-off events. For 20615/20615 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6630 event pairs, 26 based on Foata normal form. 22/1278 useless extension candidates. Maximal degree in co-relation 12520. Up to 484 conditions per place. [2022-12-13 02:28:13,854 INFO L137 encePairwiseOnDemand]: 8/63 looper letters, 117 selfloop transitions, 290 changer transitions 21/428 dead transitions. [2022-12-13 02:28:13,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 428 transitions, 9398 flow [2022-12-13 02:28:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 02:28:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 02:28:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 213 transitions. [2022-12-13 02:28:13,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10906298003072197 [2022-12-13 02:28:13,859 INFO L175 Difference]: Start difference. First operand has 169 places, 317 transitions, 7275 flow. Second operand 31 states and 213 transitions. [2022-12-13 02:28:13,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 428 transitions, 9398 flow [2022-12-13 02:28:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 428 transitions, 8703 flow, removed 86 selfloop flow, removed 19 redundant places. [2022-12-13 02:28:13,960 INFO L231 Difference]: Finished difference. Result has 186 places, 362 transitions, 8545 flow [2022-12-13 02:28:13,961 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=6184, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8545, PETRI_PLACES=186, PETRI_TRANSITIONS=362} [2022-12-13 02:28:13,965 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 164 predicate places. [2022-12-13 02:28:13,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:13,965 INFO L89 Accepts]: Start accepts. Operand has 186 places, 362 transitions, 8545 flow [2022-12-13 02:28:13,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:13,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:13,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 362 transitions, 8545 flow [2022-12-13 02:28:13,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 362 transitions, 8545 flow [2022-12-13 02:28:14,067 INFO L130 PetriNetUnfolder]: 354/723 cut-off events. [2022-12-13 02:28:14,067 INFO L131 PetriNetUnfolder]: For 10306/10306 co-relation queries the response was YES. [2022-12-13 02:28:14,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7777 conditions, 723 events. 354/723 cut-off events. For 10306/10306 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 3997 event pairs, 2 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 7603. Up to 263 conditions per place. [2022-12-13 02:28:14,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 362 transitions, 8545 flow [2022-12-13 02:28:14,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-13 02:28:14,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [902] L65-1-->L65-1: Formula: (let ((.cse1 (select |v_#memory_int_662| v_~q2~0.base_383)) (.cse0 (select |v_#memory_int_662| v_~q1~0.base_409))) (and (not (= (ite (= v_~j~0_557 (select .cse0 (+ v_~q1~0.offset_409 (* v_~q1_back~0_675 4)))) 1 0) 0)) (< v_~j~0_557 v_~N~0_394) (= v_~q1_front~0_604 (+ v_~q1_front~0_605 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_483|) (not (= (ite (and (< v_~q1_front~0_605 v_~q1_back~0_674) (< v_~q1_front~0_605 v_~n1~0_396) (<= 0 v_~q1_front~0_605)) 1 0) 0)) (= (+ v_~q1_back~0_675 1) v_~q1_back~0_674) (not (= (ite (and (< v_~q2_back~0_673 v_~n2~0_388) (<= 0 v_~q2_back~0_673)) 1 0) 0)) (= (+ v_~q2_back~0_673 1) v_~q2_back~0_672) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483| (ite (= (select .cse1 (+ v_~q2~0.offset_383 (* 4 v_~q2_back~0_673))) v_~i~0_577) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_402| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_402|) (not (= (ite (and (<= 0 v_~q1_back~0_675) (< v_~q1_back~0_675 v_~n1~0_396)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_402| 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_483| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_402| (ite (and (< v_~q2_front~0_500 v_~n2~0_388) (< v_~q2_front~0_500 v_~q2_back~0_672) (<= 0 v_~q2_front~0_500)) 1 0)) (< v_~i~0_577 v_~N~0_394) (= (+ v_~q2_front~0_500 1) v_~q2_front~0_499) (= v_~j~0_556 (+ (select .cse1 (+ v_~q2~0.offset_383 (* v_~q2_front~0_500 4))) 1)) (= (+ (select .cse0 (+ v_~q1~0.offset_409 (* v_~q1_front~0_605 4))) 1) v_~i~0_577))) InVars {~j~0=v_~j~0_557, ~q1~0.offset=v_~q1~0.offset_409, ~n2~0=v_~n2~0_388, ~q1_front~0=v_~q1_front~0_605, ~q2~0.offset=v_~q2~0.offset_383, ~n1~0=v_~n1~0_396, ~q2_front~0=v_~q2_front~0_500, ~N~0=v_~N~0_394, ~q1_back~0=v_~q1_back~0_675, ~q1~0.base=v_~q1~0.base_409, #memory_int=|v_#memory_int_662|, ~q2~0.base=v_~q2~0.base_383, ~q2_back~0=v_~q2_back~0_673} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_285|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_240|, ~j~0=v_~j~0_556, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_234|, ~q1_front~0=v_~q1_front~0_604, ~q2~0.offset=v_~q2~0.offset_383, ~n1~0=v_~n1~0_396, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_402|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_234|, ~q1_back~0=v_~q1_back~0_674, ~q1~0.base=v_~q1~0.base_409, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_483|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_301|, ~q2~0.base=v_~q2~0.base_383, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_295|, ~q2_back~0=v_~q2_back~0_672, ~q1~0.offset=v_~q1~0.offset_409, ~n2~0=v_~n2~0_388, ~i~0=v_~i~0_577, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_295|, ~q2_front~0=v_~q2_front~0_499, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_276|, ~N~0=v_~N~0_394, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_276|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_402|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_483|, #memory_int=|v_#memory_int_662|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_285|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:14,089 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,228 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,228 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,228 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,229 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [930] L65-1-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_718| v_~q1~0.base_455)) (.cse1 (select |v_#memory_int_718| v_~q2~0.base_421))) (and (not (= (ite (and (<= 0 v_~q1_back~0_770) (< v_~q1_back~0_770 v_~n1~0_442)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_540|) (< v_~i~0_622 v_~N~0_444) (not (= (ite (and (<= 0 v_~q2_back~0_730) (< v_~q2_back~0_730 v_~n2~0_426)) 1 0) 0)) (= v_~i~0_622 (+ (select .cse0 (+ (* v_~q1_front~0_676 4) v_~q1~0.offset_455)) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_484| 0)) (= v_~j~0_636 (+ (select .cse1 (+ (* v_~q2_front~0_567 4) v_~q2~0.offset_421)) 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_83| 0) (not (= (ite (= v_~j~0_637 (select .cse0 (+ (* v_~q1_back~0_770 4) v_~q1~0.offset_455))) 1 0) 0)) (= v_~q2_front~0_566 (+ v_~q2_front~0_567 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| (ite (= (select .cse1 (+ (* 4 v_~q2_back~0_730) v_~q2~0.offset_421)) v_~i~0_622) 1 0)) (< v_~j~0_637 v_~N~0_444) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_540| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_484| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_484|) (not (= (ite (and (< v_~q1_front~0_676 v_~n1~0_442) (< v_~q1_front~0_676 v_~q1_back~0_769) (<= 0 v_~q1_front~0_676)) 1 0) 0)) (= (+ v_~q1_front~0_676 1) v_~q1_front~0_675) (= v_~q2_back~0_729 (+ v_~q2_back~0_730 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_484| (ite (and (<= 0 v_~q2_front~0_567) (< v_~q2_front~0_567 v_~q2_back~0_729) (< v_~q2_front~0_567 v_~n2~0_426)) 1 0)) (= (+ v_~q1_back~0_770 1) v_~q1_back~0_769) (not (< v_~j~0_636 v_~N~0_444)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_83|))) InVars {~j~0=v_~j~0_637, ~q1~0.offset=v_~q1~0.offset_455, ~q1_front~0=v_~q1_front~0_676, ~n2~0=v_~n2~0_426, ~q2~0.offset=v_~q2~0.offset_421, ~n1~0=v_~n1~0_442, ~q2_front~0=v_~q2_front~0_567, ~N~0=v_~N~0_444, ~q1_back~0=v_~q1_back~0_770, ~q1~0.base=v_~q1~0.base_455, #memory_int=|v_#memory_int_718|, ~q2~0.base=v_~q2~0.base_421, ~q2_back~0=v_~q2_back~0_730} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_307|, ~j~0=v_~j~0_636, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_278|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_272|, ~q1_front~0=v_~q1_front~0_675, ~q2~0.offset=v_~q2~0.offset_421, ~n1~0=v_~n1~0_442, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_484|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_272|, ~q1_back~0=v_~q1_back~0_769, ~q1~0.base=v_~q1~0.base_455, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_540|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_343|, ~q2~0.base=v_~q2~0.base_421, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_337|, ~q2_back~0=v_~q2_back~0_729, ~q1~0.offset=v_~q1~0.offset_455, ~n2~0=v_~n2~0_426, ~i~0=v_~i~0_622, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_337|, ~q2_front~0=v_~q2_front~0_566, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_328|, ~N~0=v_~N~0_444, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_328|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_484|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_83|, #memory_int=|v_#memory_int_718|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_307|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE314 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE325 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE312 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE101 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE308 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE307 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE28 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE338 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE16 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,877 WARN L322 ript$VariableManager]: TermVariable LBE87 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,878 WARN L322 ript$VariableManager]: TermVariable LBE42 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:15,878 WARN L322 ript$VariableManager]: TermVariable LBE75 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:28:16,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [930] L65-1-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_718| v_~q1~0.base_455)) (.cse1 (select |v_#memory_int_718| v_~q2~0.base_421))) (and (not (= (ite (and (<= 0 v_~q1_back~0_770) (< v_~q1_back~0_770 v_~n1~0_442)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_540|) (< v_~i~0_622 v_~N~0_444) (not (= (ite (and (<= 0 v_~q2_back~0_730) (< v_~q2_back~0_730 v_~n2~0_426)) 1 0) 0)) (= v_~i~0_622 (+ (select .cse0 (+ (* v_~q1_front~0_676 4) v_~q1~0.offset_455)) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_484| 0)) (= v_~j~0_636 (+ (select .cse1 (+ (* v_~q2_front~0_567 4) v_~q2~0.offset_421)) 1)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_83| 0) (not (= (ite (= v_~j~0_637 (select .cse0 (+ (* v_~q1_back~0_770 4) v_~q1~0.offset_455))) 1 0) 0)) (= v_~q2_front~0_566 (+ v_~q2_front~0_567 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540| (ite (= (select .cse1 (+ (* 4 v_~q2_back~0_730) v_~q2~0.offset_421)) v_~i~0_622) 1 0)) (< v_~j~0_637 v_~N~0_444) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_540| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_484| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_484|) (not (= (ite (and (< v_~q1_front~0_676 v_~n1~0_442) (< v_~q1_front~0_676 v_~q1_back~0_769) (<= 0 v_~q1_front~0_676)) 1 0) 0)) (= (+ v_~q1_front~0_676 1) v_~q1_front~0_675) (= v_~q2_back~0_729 (+ v_~q2_back~0_730 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_484| (ite (and (<= 0 v_~q2_front~0_567) (< v_~q2_front~0_567 v_~q2_back~0_729) (< v_~q2_front~0_567 v_~n2~0_426)) 1 0)) (= (+ v_~q1_back~0_770 1) v_~q1_back~0_769) (not (< v_~j~0_636 v_~N~0_444)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_83|))) InVars {~j~0=v_~j~0_637, ~q1~0.offset=v_~q1~0.offset_455, ~q1_front~0=v_~q1_front~0_676, ~n2~0=v_~n2~0_426, ~q2~0.offset=v_~q2~0.offset_421, ~n1~0=v_~n1~0_442, ~q2_front~0=v_~q2_front~0_567, ~N~0=v_~N~0_444, ~q1_back~0=v_~q1_back~0_770, ~q1~0.base=v_~q1~0.base_455, #memory_int=|v_#memory_int_718|, ~q2~0.base=v_~q2~0.base_421, ~q2_back~0=v_~q2_back~0_730} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_307|, ~j~0=v_~j~0_636, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_278|, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_272|, ~q1_front~0=v_~q1_front~0_675, ~q2~0.offset=v_~q2~0.offset_421, ~n1~0=v_~n1~0_442, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_484|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_272|, ~q1_back~0=v_~q1_back~0_769, ~q1~0.base=v_~q1~0.base_455, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_540|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_343|, ~q2~0.base=v_~q2~0.base_421, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_337|, ~q2_back~0=v_~q2_back~0_729, ~q1~0.offset=v_~q1~0.offset_455, ~n2~0=v_~n2~0_426, ~i~0=v_~i~0_622, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_337|, ~q2_front~0=v_~q2_front~0_566, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_328|, ~N~0=v_~N~0_444, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_328|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_484|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_540|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_83|, #memory_int=|v_#memory_int_718|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_307|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~j~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_front~0, ~i~0, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~q1_back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [684] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_179| |v_ULTIMATE.start_main_~#t1~0#1.base_31|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) |v_ULTIMATE.start_main_#t~mem22#1_20|) InVars {#memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_33|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_17|, #memory_int=|v_#memory_int_179|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_31|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~mem22#1] [2022-12-13 02:28:16,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [695] L47-1-->thread1EXIT: Formula: (and (not (< v_~i~0_In_3 v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {~i~0=v_~i~0_In_3, ~N~0=v_~N~0_In_1} OutVars{~N~0=v_~N~0_In_1, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, ~i~0=v_~i~0_In_3, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [889] L65-1-->L65-1: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_379| (ite (and (<= 0 v_~q2_front~0_471) (< v_~q2_front~0_471 v_~n2~0_370) (< v_~q2_front~0_471 v_~q2_back~0_645)) 1 0)) (= (+ v_~q1_back~0_648 1) v_~q1_back~0_647) (not (= (ite (= (select (select |v_#memory_int_635| v_~q1~0.base_393) (+ v_~q1~0.offset_393 (* v_~q1_back~0_648 4))) v_~j~0_532) 1 0) 0)) (= v_~j~0_531 (+ (select (select |v_#memory_int_635| v_~q2~0.base_365) (+ (* v_~q2_front~0_471 4) v_~q2~0.offset_365)) 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_379| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379|) (not (= (ite (and (<= 0 v_~q1_back~0_648) (< v_~q1_back~0_648 v_~n1~0_380)) 1 0) 0)) (= (+ v_~q2_front~0_471 1) v_~q2_front~0_470) (< v_~j~0_532 v_~N~0_378) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379| 0))) InVars {~j~0=v_~j~0_532, ~q1~0.offset=v_~q1~0.offset_393, ~n2~0=v_~n2~0_370, ~q1_back~0=v_~q1_back~0_648, ~q2~0.offset=v_~q2~0.offset_365, ~n1~0=v_~n1~0_380, ~q1~0.base=v_~q1~0.base_393, #memory_int=|v_#memory_int_635|, ~q2_front~0=v_~q2_front~0_471, ~q2~0.base=v_~q2~0.base_365, ~N~0=v_~N~0_378, ~q2_back~0=v_~q2_back~0_645} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_224|, ~j~0=v_~j~0_531, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_218|, ~q1~0.offset=v_~q1~0.offset_393, ~n2~0=v_~n2~0_370, ~q2~0.offset=v_~q2~0.offset_365, ~n1~0=v_~n1~0_380, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_379|, ~q2_front~0=v_~q2_front~0_470, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_264|, ~N~0=v_~N~0_378, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_264|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_218|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_379|, ~q1_back~0=v_~q1_back~0_647, ~q1~0.base=v_~q1~0.base_393, #memory_int=|v_#memory_int_635|, ~q2~0.base=v_~q2~0.base_365, ~q2_back~0=v_~q2_back~0_645} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:28:17,057 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:28:17,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3092 [2022-12-13 02:28:17,057 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 360 transitions, 8610 flow [2022-12-13 02:28:17,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:17,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:17,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:17,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:17,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 02:28:17,263 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:17,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash 449480897, now seen corresponding path program 1 times [2022-12-13 02:28:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:17,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381815045] [2022-12-13 02:28:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:17,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381815045] [2022-12-13 02:28:17,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381815045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:17,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713660525] [2022-12-13 02:28:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:17,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:17,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:17,336 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:17,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 02:28:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:17,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 02:28:17,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:28:17,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 02:28:17,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713660525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:28:17,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 02:28:17,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 02:28:17,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881257180] [2022-12-13 02:28:17,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:28:17,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:28:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:28:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:28:17,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:28:17,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 02:28:17,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 360 transitions, 8610 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:17,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:28:17,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 02:28:17,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:28:17,952 INFO L130 PetriNetUnfolder]: 427/804 cut-off events. [2022-12-13 02:28:17,952 INFO L131 PetriNetUnfolder]: For 17864/17864 co-relation queries the response was YES. [2022-12-13 02:28:17,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8309 conditions, 804 events. 427/804 cut-off events. For 17864/17864 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4009 event pairs, 94 based on Foata normal form. 118/921 useless extension candidates. Maximal degree in co-relation 8221. Up to 432 conditions per place. [2022-12-13 02:28:17,958 INFO L137 encePairwiseOnDemand]: 33/64 looper letters, 205 selfloop transitions, 15 changer transitions 2/222 dead transitions. [2022-12-13 02:28:17,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 222 transitions, 5229 flow [2022-12-13 02:28:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:28:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:28:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 02:28:17,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33203125 [2022-12-13 02:28:17,958 INFO L175 Difference]: Start difference. First operand has 182 places, 360 transitions, 8610 flow. Second operand 4 states and 85 transitions. [2022-12-13 02:28:17,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 222 transitions, 5229 flow [2022-12-13 02:28:18,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 222 transitions, 4122 flow, removed 139 selfloop flow, removed 36 redundant places. [2022-12-13 02:28:18,015 INFO L231 Difference]: Finished difference. Result has 140 places, 194 transitions, 3401 flow [2022-12-13 02:28:18,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3369, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3401, PETRI_PLACES=140, PETRI_TRANSITIONS=194} [2022-12-13 02:28:18,015 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 118 predicate places. [2022-12-13 02:28:18,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:28:18,015 INFO L89 Accepts]: Start accepts. Operand has 140 places, 194 transitions, 3401 flow [2022-12-13 02:28:18,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:28:18,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:28:18,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 194 transitions, 3401 flow [2022-12-13 02:28:18,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 194 transitions, 3401 flow [2022-12-13 02:28:18,054 INFO L130 PetriNetUnfolder]: 158/404 cut-off events. [2022-12-13 02:28:18,054 INFO L131 PetriNetUnfolder]: For 3200/3200 co-relation queries the response was YES. [2022-12-13 02:28:18,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 404 events. 158/404 cut-off events. For 3200/3200 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2178 event pairs, 6 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 2956. Up to 125 conditions per place. [2022-12-13 02:28:18,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 194 transitions, 3401 flow [2022-12-13 02:28:18,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-13 02:28:18,062 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:28:18,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L65-1-->L65-1: Formula: (and (= v_~q2_front~0_527 (+ v_~q2_front~0_528 1)) (= (+ v_~q1_back~0_709 1) v_~q1_back~0_708) (not (= (ite (and (< v_~q1_back~0_709 v_~n1~0_414) (<= 0 v_~q1_back~0_709)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_432| 0)) (not (= (ite (= v_~j~0_587 (select (select |v_#memory_int_682| v_~q1~0.base_427) (+ (* v_~q1_back~0_709 4) v_~q1~0.offset_427))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_432| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_432|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_432| (ite (and (< v_~q2_front~0_528 v_~n2~0_408) (<= 0 v_~q2_front~0_528) (< v_~q2_front~0_528 v_~q2_back~0_704)) 1 0)) (= v_~j~0_586 (+ (select (select |v_#memory_int_682| v_~q2~0.base_403) (+ v_~q2~0.offset_403 (* v_~q2_front~0_528 4))) 1)) (< v_~j~0_587 v_~N~0_414)) InVars {~j~0=v_~j~0_587, ~q1~0.offset=v_~q1~0.offset_427, ~n2~0=v_~n2~0_408, ~q1_back~0=v_~q1_back~0_709, ~q2~0.offset=v_~q2~0.offset_403, ~n1~0=v_~n1~0_414, ~q1~0.base=v_~q1~0.base_427, #memory_int=|v_#memory_int_682|, ~q2_front~0=v_~q2_front~0_528, ~q2~0.base=v_~q2~0.base_403, ~N~0=v_~N~0_414, ~q2_back~0=v_~q2_back~0_704} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_254|, ~j~0=v_~j~0_586, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_248|, ~q1~0.offset=v_~q1~0.offset_427, ~n2~0=v_~n2~0_408, ~q2~0.offset=v_~q2~0.offset_403, ~n1~0=v_~n1~0_414, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_432|, ~q2_front~0=v_~q2_front~0_527, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_292|, ~N~0=v_~N~0_414, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_292|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_248|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_432|, ~q1_back~0=v_~q1_back~0_708, ~q1~0.base=v_~q1~0.base_427, #memory_int=|v_#memory_int_682|, ~q2~0.base=v_~q2~0.base_403, ~q2_back~0=v_~q2_back~0_704} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:18,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:18,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:18,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:18,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:28:19,033 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:28:19,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1019 [2022-12-13 02:28:19,034 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 192 transitions, 3429 flow [2022-12-13 02:28:19,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:28:19,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:28:19,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:28:19,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 02:28:19,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 02:28:19,240 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:28:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:28:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 893440143, now seen corresponding path program 1 times [2022-12-13 02:28:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:28:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871093272] [2022-12-13 02:28:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:28:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:19,990 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 02:28:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:28:19,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871093272] [2022-12-13 02:28:19,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871093272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:28:19,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714304353] [2022-12-13 02:28:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:28:19,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:28:19,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:28:19,992 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:28:19,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 02:28:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:28:20,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 02:28:20,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:28:20,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:28:20,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 02:28:20,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:20,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 02:28:20,351 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 02:28:20,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:28:20,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:20,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 396 [2022-12-13 02:28:20,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:20,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 02:28:20,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:28:20,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 02:29:57,808 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 02:29:57,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714304353] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:29:57,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:29:57,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 02:29:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335098702] [2022-12-13 02:29:57,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:29:57,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:29:57,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:29:57,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:29:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-13 02:29:57,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 02:29:57,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 192 transitions, 3429 flow. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:57,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:29:57,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 02:29:57,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:29:59,145 INFO L130 PetriNetUnfolder]: 411/773 cut-off events. [2022-12-13 02:29:59,145 INFO L131 PetriNetUnfolder]: For 6614/6614 co-relation queries the response was YES. [2022-12-13 02:29:59,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6442 conditions, 773 events. 411/773 cut-off events. For 6614/6614 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3793 event pairs, 10 based on Foata normal form. 7/776 useless extension candidates. Maximal degree in co-relation 6218. Up to 437 conditions per place. [2022-12-13 02:29:59,149 INFO L137 encePairwiseOnDemand]: 13/57 looper letters, 63 selfloop transitions, 146 changer transitions 8/217 dead transitions. [2022-12-13 02:29:59,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 217 transitions, 4039 flow [2022-12-13 02:29:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 02:29:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 02:29:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 106 transitions. [2022-12-13 02:29:59,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1239766081871345 [2022-12-13 02:29:59,150 INFO L175 Difference]: Start difference. First operand has 137 places, 192 transitions, 3429 flow. Second operand 15 states and 106 transitions. [2022-12-13 02:29:59,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 217 transitions, 4039 flow [2022-12-13 02:29:59,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 217 transitions, 3983 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 02:29:59,196 INFO L231 Difference]: Finished difference. Result has 151 places, 193 transitions, 3801 flow [2022-12-13 02:29:59,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=3311, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3801, PETRI_PLACES=151, PETRI_TRANSITIONS=193} [2022-12-13 02:29:59,197 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 129 predicate places. [2022-12-13 02:29:59,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:29:59,197 INFO L89 Accepts]: Start accepts. Operand has 151 places, 193 transitions, 3801 flow [2022-12-13 02:29:59,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:29:59,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:29:59,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 193 transitions, 3801 flow [2022-12-13 02:29:59,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 193 transitions, 3801 flow [2022-12-13 02:29:59,236 INFO L130 PetriNetUnfolder]: 152/382 cut-off events. [2022-12-13 02:29:59,236 INFO L131 PetriNetUnfolder]: For 3760/3760 co-relation queries the response was YES. [2022-12-13 02:29:59,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3295 conditions, 382 events. 152/382 cut-off events. For 3760/3760 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1957 event pairs, 4 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 3151. Up to 123 conditions per place. [2022-12-13 02:29:59,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 193 transitions, 3801 flow [2022-12-13 02:29:59,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 02:29:59,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:29:59,745 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:29:59,745 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 548 [2022-12-13 02:29:59,745 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 192 transitions, 3791 flow [2022-12-13 02:29:59,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:29:59,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:29:59,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:29:59,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 02:29:59,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:29:59,951 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:29:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:29:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1455095594, now seen corresponding path program 1 times [2022-12-13 02:29:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:29:59,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962692767] [2022-12-13 02:29:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:29:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:29:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:00,018 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 02:30:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:00,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962692767] [2022-12-13 02:30:00,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962692767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:30:00,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:30:00,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:30:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026844037] [2022-12-13 02:30:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:30:00,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:30:00,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:00,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:30:00,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:30:00,020 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 02:30:00,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 192 transitions, 3791 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:00,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:00,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 02:30:00,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:00,355 INFO L130 PetriNetUnfolder]: 363/714 cut-off events. [2022-12-13 02:30:00,356 INFO L131 PetriNetUnfolder]: For 8238/8238 co-relation queries the response was YES. [2022-12-13 02:30:00,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6386 conditions, 714 events. 363/714 cut-off events. For 8238/8238 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3548 event pairs, 73 based on Foata normal form. 61/771 useless extension candidates. Maximal degree in co-relation 6251. Up to 376 conditions per place. [2022-12-13 02:30:00,360 INFO L137 encePairwiseOnDemand]: 41/57 looper letters, 132 selfloop transitions, 18 changer transitions 52/202 dead transitions. [2022-12-13 02:30:00,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 202 transitions, 4060 flow [2022-12-13 02:30:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:30:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:30:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 02:30:00,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3263157894736842 [2022-12-13 02:30:00,361 INFO L175 Difference]: Start difference. First operand has 149 places, 192 transitions, 3791 flow. Second operand 5 states and 93 transitions. [2022-12-13 02:30:00,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 202 transitions, 4060 flow [2022-12-13 02:30:00,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 202 transitions, 3778 flow, removed 16 selfloop flow, removed 11 redundant places. [2022-12-13 02:30:00,390 INFO L231 Difference]: Finished difference. Result has 145 places, 124 transitions, 2230 flow [2022-12-13 02:30:00,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2942, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2230, PETRI_PLACES=145, PETRI_TRANSITIONS=124} [2022-12-13 02:30:00,390 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 123 predicate places. [2022-12-13 02:30:00,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:00,391 INFO L89 Accepts]: Start accepts. Operand has 145 places, 124 transitions, 2230 flow [2022-12-13 02:30:00,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:00,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:00,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 124 transitions, 2230 flow [2022-12-13 02:30:00,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 124 transitions, 2230 flow [2022-12-13 02:30:00,416 INFO L130 PetriNetUnfolder]: 100/268 cut-off events. [2022-12-13 02:30:00,416 INFO L131 PetriNetUnfolder]: For 1831/1831 co-relation queries the response was YES. [2022-12-13 02:30:00,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 268 events. 100/268 cut-off events. For 1831/1831 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1221 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 2056. Up to 76 conditions per place. [2022-12-13 02:30:00,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 124 transitions, 2230 flow [2022-12-13 02:30:00,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-13 02:30:00,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [666] L96-4-->L97-3: Formula: (and (= |v_#pthreadsForks_30| |v_ULTIMATE.start_main_#t~pre20#1_23|) (= (store |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_23|)) |v_#memory_int_155|) (= (+ |v_#pthreadsForks_30| 1) |v_#pthreadsForks_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_156|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_23|, #pthreadsForks=|v_#pthreadsForks_29|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_13|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] [2022-12-13 02:30:00,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [921] L65-1-->L65-1: Formula: (and (< v_~j~0_608 v_~N~0_428) (= (+ v_~q2_front~0_541 1) v_~q2_front~0_540) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_455| (ite (and (<= 0 v_~q2_front~0_541) (< v_~q2_front~0_541 v_~q2_back~0_711) (< v_~q2_front~0_541 v_~n2~0_414)) 1 0)) (not (= (ite (and (< v_~q1_back~0_740 v_~n1~0_428) (<= 0 v_~q1_back~0_740)) 1 0) 0)) (not (= (ite (= v_~j~0_608 (select (select |v_#memory_int_698| v_~q1~0.base_441) (+ (* v_~q1_back~0_740 4) v_~q1~0.offset_441))) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_455| 0)) (= v_~q1_back~0_739 (+ v_~q1_back~0_740 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_455| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_455|) (= v_~j~0_607 (+ (select (select |v_#memory_int_698| v_~q2~0.base_409) (+ v_~q2~0.offset_409 (* v_~q2_front~0_541 4))) 1))) InVars {~j~0=v_~j~0_608, ~q1~0.offset=v_~q1~0.offset_441, ~n2~0=v_~n2~0_414, ~q1_back~0=v_~q1_back~0_740, ~q2~0.offset=v_~q2~0.offset_409, ~n1~0=v_~n1~0_428, ~q1~0.base=v_~q1~0.base_441, #memory_int=|v_#memory_int_698|, ~q2_front~0=v_~q2_front~0_541, ~q2~0.base=v_~q2~0.base_409, ~N~0=v_~N~0_428, ~q2_back~0=v_~q2_back~0_711} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_262|, ~j~0=v_~j~0_607, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_256|, ~q1~0.offset=v_~q1~0.offset_441, ~n2~0=v_~n2~0_414, ~q2~0.offset=v_~q2~0.offset_409, ~n1~0=v_~n1~0_428, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_455|, ~q2_front~0=v_~q2_front~0_540, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_310|, ~N~0=v_~N~0_428, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_310|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_256|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_455|, ~q1_back~0=v_~q1_back~0_739, ~q1~0.base=v_~q1~0.base_441, #memory_int=|v_#memory_int_698|, ~q2~0.base=v_~q2~0.base_409, ~q2_back~0=v_~q2_back~0_711} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:30:00,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [692] L112-14-->L96-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_2| v_~q2~0.base_Out_2) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre18#1_Out_2|)) |v_#memory_int_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_2|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre18#1_Out_2|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_1| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_1|)) (= v_~q2~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_1|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_1|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_1|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_1|, ~q2~0.offset=v_~q2~0.offset_Out_2, ULTIMATE.start_main_#t~ret17#1.base=|v_ULTIMATE.start_main_#t~ret17#1.base_Out_2|, ULTIMATE.start_main_#t~ret17#1.offset=|v_ULTIMATE.start_main_#t~ret17#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, #memory_int=|v_#memory_int_Out_2|, ~q2~0.base=v_~q2~0.base_Out_2} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~q2~0.offset, #memory_int, ULTIMATE.start_main_#t~ret17#1.base, ULTIMATE.start_main_#t~ret17#1.offset, ~q2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] and [946] L47-1-->L97-3: Formula: (and (= (store |v_#memory_int_749| |v_ULTIMATE.start_main_~#t2~0#1.base_91| (store (select |v_#memory_int_749| |v_ULTIMATE.start_main_~#t2~0#1.base_91|) |v_ULTIMATE.start_main_~#t2~0#1.offset_91| |v_ULTIMATE.start_main_#t~pre20#1_147|)) |v_#memory_int_748|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_573| (ite (= (select (select |v_#memory_int_749| v_~q2~0.base_441) (+ (* 4 v_~q2_back~0_765) v_~q2~0.offset_441)) v_~i~0_653) 1 0)) (= (+ |v_#pthreadsForks_136| 1) |v_#pthreadsForks_135|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_573| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_573| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_573|) (= |v_ULTIMATE.start_main_#t~pre20#1_147| |v_#pthreadsForks_136|) (= v_~q2_back~0_764 (+ v_~q2_back~0_765 1)) (< v_~i~0_653 v_~N~0_472) (not (= (ite (and (< v_~q2_back~0_765 v_~n2~0_446) (<= 0 v_~q2_back~0_765)) 1 0) 0))) InVars {#pthreadsForks=|v_#pthreadsForks_136|, ~n2~0=v_~n2~0_446, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_91|, ~i~0=v_~i~0_653, ~q2~0.offset=v_~q2~0.offset_441, #memory_int=|v_#memory_int_749|, ~q2~0.base=v_~q2~0.base_441, ~N~0=v_~N~0_472, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_91|, ~q2_back~0=v_~q2_back~0_765} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_117|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_323|, ~n2~0=v_~n2~0_446, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_91|, ~i~0=v_~i~0_653, ~q2~0.offset=v_~q2~0.offset_441, ~N~0=v_~N~0_472, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_573|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_147|, #pthreadsForks=|v_#pthreadsForks_135|, #memory_int=|v_#memory_int_748|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_573|, ~q2~0.base=v_~q2~0.base_441, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_95|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_323|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_91|, ~q2_back~0=v_~q2_back~0_764} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] [2022-12-13 02:30:01,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [925] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_707| v_~q1~0.base_447))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| (ite (= v_~j~0_623 (select .cse0 (+ (* v_~q1_back~0_753 4) v_~q1~0.offset_447))) 1 0)) (= (+ v_~q1_front~0_661 1) v_~q1_front~0_660) (= (ite (and (< v_~q1_front~0_661 v_~n1~0_434) (<= 0 v_~q1_front~0_661) (< v_~q1_front~0_661 v_~q1_back~0_752)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_529|) (not (= (ite (and (<= 0 v_~q1_back~0_753) (< v_~q1_back~0_753 v_~n1~0_434)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_529| 0)) (= (+ (select .cse0 (+ (* v_~q1_front~0_661 4) v_~q1~0.offset_447)) 1) v_~i~0_613) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_529| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_529|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471| 0)) (= (+ v_~q1_back~0_753 1) v_~q1_back~0_752) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|) (< v_~j~0_623 v_~N~0_436))) InVars {~j~0=v_~j~0_623, ~q1~0.offset=v_~q1~0.offset_447, ~q1_front~0=v_~q1_front~0_661, ~q1_back~0=v_~q1_back~0_753, ~n1~0=v_~n1~0_434, ~q1~0.base=v_~q1~0.base_447, #memory_int=|v_#memory_int_707|, ~N~0=v_~N~0_436} OutVars{~j~0=v_~j~0_623, ~q1~0.offset=v_~q1~0.offset_447, ~q1_front~0=v_~q1_front~0_660, ~i~0=v_~i~0_613, ~n1~0=v_~n1~0_434, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_327|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_471|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_318|, ~N~0=v_~N~0_436, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_318|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_471|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_529|, ~q1_back~0=v_~q1_back~0_752, ~q1~0.base=v_~q1~0.base_447, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_333|, #memory_int=|v_#memory_int_707|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_529|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_327|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:30:01,653 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:30:01,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1262 [2022-12-13 02:30:01,654 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 122 transitions, 2233 flow [2022-12-13 02:30:01,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:01,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:01,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:01,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 02:30:01,654 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 33400947, now seen corresponding path program 1 times [2022-12-13 02:30:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:01,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710618784] [2022-12-13 02:30:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710618784] [2022-12-13 02:30:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710618784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:30:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838124127] [2022-12-13 02:30:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:03,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:03,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:30:03,145 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:30:03,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 02:30:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:03,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 02:30:03,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:30:03,386 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 02:30:03,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 02:30:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:03,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:30:03,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:30:03,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 280 [2022-12-13 02:30:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:27,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838124127] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:30:27,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:30:27,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 02:30:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887741369] [2022-12-13 02:30:27,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:30:27,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:30:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:30:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:30:27,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 02:30:27,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 2233 flow. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:27,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:27,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 02:30:27,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:29,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:30:30,217 INFO L130 PetriNetUnfolder]: 367/686 cut-off events. [2022-12-13 02:30:30,217 INFO L131 PetriNetUnfolder]: For 6996/6996 co-relation queries the response was YES. [2022-12-13 02:30:30,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5991 conditions, 686 events. 367/686 cut-off events. For 6996/6996 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3226 event pairs, 31 based on Foata normal form. 6/687 useless extension candidates. Maximal degree in co-relation 5903. Up to 434 conditions per place. [2022-12-13 02:30:30,221 INFO L137 encePairwiseOnDemand]: 15/44 looper letters, 79 selfloop transitions, 79 changer transitions 12/170 dead transitions. [2022-12-13 02:30:30,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 170 transitions, 3143 flow [2022-12-13 02:30:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 02:30:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 02:30:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2022-12-13 02:30:30,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15454545454545454 [2022-12-13 02:30:30,221 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 2233 flow. Second operand 15 states and 102 transitions. [2022-12-13 02:30:30,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 170 transitions, 3143 flow [2022-12-13 02:30:30,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 170 transitions, 2668 flow, removed 54 selfloop flow, removed 16 redundant places. [2022-12-13 02:30:30,242 INFO L231 Difference]: Finished difference. Result has 118 places, 134 transitions, 2373 flow [2022-12-13 02:30:30,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2373, PETRI_PLACES=118, PETRI_TRANSITIONS=134} [2022-12-13 02:30:30,242 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 96 predicate places. [2022-12-13 02:30:30,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:30,242 INFO L89 Accepts]: Start accepts. Operand has 118 places, 134 transitions, 2373 flow [2022-12-13 02:30:30,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:30,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:30,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 134 transitions, 2373 flow [2022-12-13 02:30:30,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 134 transitions, 2373 flow [2022-12-13 02:30:30,268 INFO L130 PetriNetUnfolder]: 111/289 cut-off events. [2022-12-13 02:30:30,269 INFO L131 PetriNetUnfolder]: For 1896/1896 co-relation queries the response was YES. [2022-12-13 02:30:30,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 289 events. 111/289 cut-off events. For 1896/1896 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1377 event pairs, 5 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 1913. Up to 84 conditions per place. [2022-12-13 02:30:30,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 134 transitions, 2373 flow [2022-12-13 02:30:30,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 02:30:30,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:30:36,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [926] L65-1-->L47-1: Formula: (let ((.cse0 (select |v_#memory_int_709| v_~q1~0.base_449))) (and (= v_~q1_front~0_664 (+ v_~q1_front~0_665 1)) (< v_~j~0_625 v_~N~0_438) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_473|) (= (ite (and (<= 0 v_~q1_front~0_665) (< v_~q1_front~0_665 v_~n1~0_436) (< v_~q1_front~0_665 v_~q1_back~0_756)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_531|) (= (ite (= v_~j~0_625 (select .cse0 (+ v_~q1~0.offset_449 (* v_~q1_back~0_757 4)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473|) (= (+ v_~q1_back~0_757 1) v_~q1_back~0_756) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_531| 0)) (not (= 0 (ite (and (<= 0 v_~q1_back~0_757) (< v_~q1_back~0_757 v_~n1~0_436)) 1 0))) (= (+ (select .cse0 (+ (* v_~q1_front~0_665 4) v_~q1~0.offset_449)) 1) v_~i~0_615) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_473| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_531| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_531|))) InVars {~j~0=v_~j~0_625, ~q1~0.offset=v_~q1~0.offset_449, ~q1_front~0=v_~q1_front~0_665, ~q1_back~0=v_~q1_back~0_757, ~n1~0=v_~n1~0_436, ~q1~0.base=v_~q1~0.base_449, #memory_int=|v_#memory_int_709|, ~N~0=v_~N~0_438} OutVars{~j~0=v_~j~0_625, ~q1~0.offset=v_~q1~0.offset_449, ~q1_front~0=v_~q1_front~0_664, ~i~0=v_~i~0_615, ~n1~0=v_~n1~0_436, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_329|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_473|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_320|, ~N~0=v_~N~0_438, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_320|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_473|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_531|, ~q1_back~0=v_~q1_back~0_756, ~q1~0.base=v_~q1~0.base_449, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_335|, #memory_int=|v_#memory_int_709|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_531|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_329|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, ~q1_back~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_#t~post7#1] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:30:37,363 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:30:37,363 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7121 [2022-12-13 02:30:37,363 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 132 transitions, 2401 flow [2022-12-13 02:30:37,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:37,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:37,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:37,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 02:30:37,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:37,569 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash 635575117, now seen corresponding path program 1 times [2022-12-13 02:30:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:37,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547818490] [2022-12-13 02:30:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:38,085 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 02:30:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547818490] [2022-12-13 02:30:38,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547818490] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:30:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34119893] [2022-12-13 02:30:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:38,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:38,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:30:38,087 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:30:38,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 02:30:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:38,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 02:30:38,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:30:38,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 02:30:38,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-12-13 02:30:38,255 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:30:38,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 02:30:38,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 02:30:38,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2022-12-13 02:30:38,565 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 02:30:38,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:30:38,922 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 02:30:38,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34119893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:30:38,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:30:38,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-13 02:30:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090671937] [2022-12-13 02:30:38,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:30:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:30:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:30:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:30:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:30:38,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 02:30:38,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 132 transitions, 2401 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:38,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:30:38,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 02:30:38,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:30:44,935 INFO L130 PetriNetUnfolder]: 390/727 cut-off events. [2022-12-13 02:30:44,935 INFO L131 PetriNetUnfolder]: For 5808/5808 co-relation queries the response was YES. [2022-12-13 02:30:44,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 727 events. 390/727 cut-off events. For 5808/5808 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3521 event pairs, 22 based on Foata normal form. 7/729 useless extension candidates. Maximal degree in co-relation 5236. Up to 379 conditions per place. [2022-12-13 02:30:44,939 INFO L137 encePairwiseOnDemand]: 10/46 looper letters, 63 selfloop transitions, 111 changer transitions 25/199 dead transitions. [2022-12-13 02:30:44,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 199 transitions, 3611 flow [2022-12-13 02:30:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:30:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:30:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 116 transitions. [2022-12-13 02:30:44,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15760869565217392 [2022-12-13 02:30:44,940 INFO L175 Difference]: Start difference. First operand has 114 places, 132 transitions, 2401 flow. Second operand 16 states and 116 transitions. [2022-12-13 02:30:44,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 199 transitions, 3611 flow [2022-12-13 02:30:44,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 199 transitions, 3556 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 02:30:44,957 INFO L231 Difference]: Finished difference. Result has 131 places, 155 transitions, 3222 flow [2022-12-13 02:30:44,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2355, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3222, PETRI_PLACES=131, PETRI_TRANSITIONS=155} [2022-12-13 02:30:44,958 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 109 predicate places. [2022-12-13 02:30:44,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:30:44,958 INFO L89 Accepts]: Start accepts. Operand has 131 places, 155 transitions, 3222 flow [2022-12-13 02:30:44,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:30:44,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:30:44,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 155 transitions, 3222 flow [2022-12-13 02:30:44,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 155 transitions, 3222 flow [2022-12-13 02:30:44,988 INFO L130 PetriNetUnfolder]: 120/299 cut-off events. [2022-12-13 02:30:44,988 INFO L131 PetriNetUnfolder]: For 2985/2985 co-relation queries the response was YES. [2022-12-13 02:30:44,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 299 events. 120/299 cut-off events. For 2985/2985 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1428 event pairs, 3 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 2564. Up to 91 conditions per place. [2022-12-13 02:30:44,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 155 transitions, 3222 flow [2022-12-13 02:30:44,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-13 02:30:54,508 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:30:54,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9550 [2022-12-13 02:30:54,508 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 153 transitions, 3223 flow [2022-12-13 02:30:54,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:30:54,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:30:54,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:30:54,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 02:30:54,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:54,709 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:30:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:30:54,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1146807213, now seen corresponding path program 1 times [2022-12-13 02:30:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:30:54,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788925685] [2022-12-13 02:30:54,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:30:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:30:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788925685] [2022-12-13 02:30:55,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788925685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:30:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497325255] [2022-12-13 02:30:55,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:30:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:30:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:30:55,371 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:30:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 02:30:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:30:55,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 02:30:55,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:30:55,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:30:55,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 02:30:55,647 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 02:30:55,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2022-12-13 02:30:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:30:55,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:30:56,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:30:56,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 396 [2022-12-13 02:30:56,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:30:56,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 02:30:56,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:30:56,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 02:32:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:32:58,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497325255] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:32:58,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:32:58,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 02:32:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195865665] [2022-12-13 02:32:58,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:32:58,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:32:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:32:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:32:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:32:58,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:32:58,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 153 transitions, 3223 flow. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:58,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:32:58,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:32:58,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:32:59,728 INFO L130 PetriNetUnfolder]: 377/690 cut-off events. [2022-12-13 02:32:59,728 INFO L131 PetriNetUnfolder]: For 7389/7389 co-relation queries the response was YES. [2022-12-13 02:32:59,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6165 conditions, 690 events. 377/690 cut-off events. For 7389/7389 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3258 event pairs, 22 based on Foata normal form. 2/688 useless extension candidates. Maximal degree in co-relation 6101. Up to 443 conditions per place. [2022-12-13 02:32:59,732 INFO L137 encePairwiseOnDemand]: 16/42 looper letters, 73 selfloop transitions, 96 changer transitions 17/186 dead transitions. [2022-12-13 02:32:59,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 186 transitions, 3778 flow [2022-12-13 02:32:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:32:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:32:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2022-12-13 02:32:59,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17857142857142858 [2022-12-13 02:32:59,733 INFO L175 Difference]: Start difference. First operand has 117 places, 153 transitions, 3223 flow. Second operand 12 states and 90 transitions. [2022-12-13 02:32:59,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 186 transitions, 3778 flow [2022-12-13 02:32:59,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 186 transitions, 3632 flow, removed 31 selfloop flow, removed 10 redundant places. [2022-12-13 02:32:59,758 INFO L231 Difference]: Finished difference. Result has 120 places, 151 transitions, 3245 flow [2022-12-13 02:32:59,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3083, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3245, PETRI_PLACES=120, PETRI_TRANSITIONS=151} [2022-12-13 02:32:59,758 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 98 predicate places. [2022-12-13 02:32:59,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:32:59,758 INFO L89 Accepts]: Start accepts. Operand has 120 places, 151 transitions, 3245 flow [2022-12-13 02:32:59,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:32:59,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:32:59,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 151 transitions, 3245 flow [2022-12-13 02:32:59,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 151 transitions, 3245 flow [2022-12-13 02:32:59,787 INFO L130 PetriNetUnfolder]: 116/281 cut-off events. [2022-12-13 02:32:59,787 INFO L131 PetriNetUnfolder]: For 2940/2940 co-relation queries the response was YES. [2022-12-13 02:32:59,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2564 conditions, 281 events. 116/281 cut-off events. For 2940/2940 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1287 event pairs, 5 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 2512. Up to 87 conditions per place. [2022-12-13 02:32:59,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 151 transitions, 3245 flow [2022-12-13 02:32:59,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 02:32:59,790 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:32:59,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 02:32:59,790 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 151 transitions, 3245 flow [2022-12-13 02:32:59,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:32:59,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:32:59,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:32:59,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 02:32:59,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:32:59,998 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:32:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:32:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1528189757, now seen corresponding path program 1 times [2022-12-13 02:32:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:32:59,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880724632] [2022-12-13 02:32:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:32:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:33:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:33:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:33:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:33:01,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880724632] [2022-12-13 02:33:01,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880724632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:33:01,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531200956] [2022-12-13 02:33:01,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:33:01,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:33:01,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:33:01,152 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:33:01,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 02:33:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:33:01,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 02:33:01,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:33:01,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 02:33:01,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:33:01,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-13 02:33:01,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 02:33:01,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:33:01,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:33:01,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2022-12-13 02:33:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:33:01,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:33:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:33:02,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531200956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:33:02,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:33:02,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:33:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888811082] [2022-12-13 02:33:02,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:33:02,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:33:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:33:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:33:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=275, Unknown=4, NotChecked=0, Total=342 [2022-12-13 02:33:02,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:33:02,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 151 transitions, 3245 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:33:02,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:33:02,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:33:02,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:33:03,612 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_~q2_front~0 4)) (.cse10 (* c_~q1_front~0 4))) (let ((.cse8 (+ .cse10 c_~q1~0.offset)) (.cse14 (+ c_~q2~0.offset .cse31))) (let ((.cse0 (select (select |c_#memory_int| c_~q2~0.base) .cse14)) (.cse2 (<= 1 c_~N~0)) (.cse1 (= (select (select |c_#memory_int| c_~q1~0.base) .cse8) 0)) (.cse11 (not (< c_~q2_back~0 c_~n2~0))) (.cse22 (not (<= 0 c_~q2_back~0))) (.cse9 (* c_~q1_back~0 4)) (.cse21 (* c_~q2_back~0 4)) (.cse16 (+ c_~i~0 1))) (and (< .cse0 c_~N~0) (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (or (not .cse1) (and .cse2 (= .cse0 0))) (<= c_~i~0 c_~j~0) (<= c_~q2_front~0 0) (<= 0 .cse0) .cse2 (or (let ((.cse3 (+ .cse9 c_~q1~0.offset)) (.cse4 (= c_~j~0 0))) (and (or (let ((.cse5 (= .cse8 4))) (and (or (and (<= .cse3 4) .cse4) (not .cse5)) (or (let ((.cse7 (<= .cse8 8))) (and (or (let ((.cse6 (<= .cse3 8))) (and (or .cse6 (<= c_~n1~0 3)) (or (not .cse6) (and (not (<= .cse3 7)) .cse4)))) (not .cse7)) (or (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 3)) .cse7) (< 3 .cse8))) .cse5))) (<= c_~q1_back~0 0)) (or (<= (+ .cse9 c_~q1~0.offset 1) 0) (and (or (not (= .cse3 0)) (and (<= .cse8 0) .cse4)) (not (<= (+ .cse10 c_~q1~0.offset 1) 0)))))) .cse1) (not (= c_~q1~0.base c_~q2~0.base)) (or .cse11 (let ((.cse13 (+ .cse21 c_~q2~0.offset))) (and (forall ((~q1~0.offset Int) (v_ArrVal_1799 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1799))) (let ((.cse12 (select .cse17 c_~q2~0.base)) (.cse15 (select .cse17 c_~q1~0.base))) (or (not (= (select .cse12 .cse13) c_~i~0)) (< (select .cse12 .cse14) c_~i~0) (not (= (select .cse15 (+ .cse9 ~q1~0.offset)) c_~j~0)) (< (select .cse15 (+ .cse10 ~q1~0.offset)) .cse16))))) (forall ((~q1~0.offset Int) (v_ArrVal_1799 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1799))) (let ((.cse19 (select .cse20 c_~q2~0.base)) (.cse18 (select .cse20 c_~q1~0.base))) (or (< (select .cse18 (+ .cse10 ~q1~0.offset)) c_~i~0) (not (= (select .cse19 .cse13) c_~i~0)) (< (select .cse19 .cse14) .cse16) (not (= (select .cse18 (+ .cse9 ~q1~0.offset)) c_~j~0)))))))) .cse22) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11 .cse22 (let ((.cse26 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse25 (+ .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~q1~0.offset Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1798 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1799))) (let ((.cse23 (select .cse27 c_~q1~0.base)) (.cse24 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse23 (+ .cse10 ~q1~0.offset)) .cse16) (not (= c_~j~0 (select .cse23 (+ .cse9 ~q1~0.offset)))) (< (select .cse24 .cse25) c_~i~0) (not (= (select .cse24 .cse26) c_~i~0)))))) (forall ((~q1~0.offset Int) (v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1798 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1798) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1799))) (let ((.cse28 (select .cse30 c_~q1~0.base)) (.cse29 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~j~0 (select .cse28 (+ .cse9 ~q1~0.offset)))) (< (select .cse28 (+ .cse10 ~q1~0.offset)) c_~i~0) (not (= (select .cse29 .cse26) c_~i~0)) (< (select .cse29 .cse25) .cse16)))))))) (<= c_~j~0 c_~N~0) (< c_~j~0 .cse16) (<= 0 c_~q2_front~0) (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (<= c_~i~0 1))))) is different from false [2022-12-13 02:33:05,598 INFO L130 PetriNetUnfolder]: 460/839 cut-off events. [2022-12-13 02:33:05,598 INFO L131 PetriNetUnfolder]: For 10929/10929 co-relation queries the response was YES. [2022-12-13 02:33:05,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 839 events. 460/839 cut-off events. For 10929/10929 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4134 event pairs, 22 based on Foata normal form. 10/847 useless extension candidates. Maximal degree in co-relation 7687. Up to 413 conditions per place. [2022-12-13 02:33:05,603 INFO L137 encePairwiseOnDemand]: 8/40 looper letters, 68 selfloop transitions, 162 changer transitions 14/244 dead transitions. [2022-12-13 02:33:05,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 244 transitions, 5142 flow [2022-12-13 02:33:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:33:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:33:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 119 transitions. [2022-12-13 02:33:05,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1859375 [2022-12-13 02:33:05,604 INFO L175 Difference]: Start difference. First operand has 119 places, 151 transitions, 3245 flow. Second operand 16 states and 119 transitions. [2022-12-13 02:33:05,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 244 transitions, 5142 flow [2022-12-13 02:33:05,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 244 transitions, 4867 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-12-13 02:33:05,632 INFO L231 Difference]: Finished difference. Result has 134 places, 206 transitions, 4824 flow [2022-12-13 02:33:05,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3047, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4824, PETRI_PLACES=134, PETRI_TRANSITIONS=206} [2022-12-13 02:33:05,633 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 112 predicate places. [2022-12-13 02:33:05,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:33:05,633 INFO L89 Accepts]: Start accepts. Operand has 134 places, 206 transitions, 4824 flow [2022-12-13 02:33:05,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:33:05,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:33:05,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 206 transitions, 4824 flow [2022-12-13 02:33:05,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 206 transitions, 4824 flow [2022-12-13 02:33:05,673 INFO L130 PetriNetUnfolder]: 147/361 cut-off events. [2022-12-13 02:33:05,673 INFO L131 PetriNetUnfolder]: For 5057/5057 co-relation queries the response was YES. [2022-12-13 02:33:05,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 361 events. 147/361 cut-off events. For 5057/5057 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1833 event pairs, 3 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 3373. Up to 110 conditions per place. [2022-12-13 02:33:05,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 206 transitions, 4824 flow [2022-12-13 02:33:05,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 02:33:11,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:33:11,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5479 [2022-12-13 02:33:11,112 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 206 transitions, 4876 flow [2022-12-13 02:33:11,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:33:11,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:33:11,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:33:11,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 02:33:11,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:33:11,317 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:33:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:33:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash -923242607, now seen corresponding path program 1 times [2022-12-13 02:33:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:33:11,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847929454] [2022-12-13 02:33:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:33:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:33:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:33:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:33:12,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:33:12,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847929454] [2022-12-13 02:33:12,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847929454] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:33:12,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733744494] [2022-12-13 02:33:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:33:12,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:33:12,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:33:12,591 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:33:12,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 02:33:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:33:12,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 02:33:12,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:33:12,808 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 02:33:12,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2022-12-13 02:33:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:33:12,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:33:13,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:33:13,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 282 [2022-12-13 02:33:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:33:20,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733744494] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:33:20,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:33:20,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 13 [2022-12-13 02:33:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718839674] [2022-12-13 02:33:20,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:33:20,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 02:33:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:33:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 02:33:20,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-13 02:33:20,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:33:20,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 206 transitions, 4876 flow. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:33:20,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:33:20,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:33:20,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:33:24,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:33:24,379 INFO L130 PetriNetUnfolder]: 480/858 cut-off events. [2022-12-13 02:33:24,380 INFO L131 PetriNetUnfolder]: For 13407/13407 co-relation queries the response was YES. [2022-12-13 02:33:24,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8891 conditions, 858 events. 480/858 cut-off events. For 13407/13407 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4136 event pairs, 16 based on Foata normal form. 2/858 useless extension candidates. Maximal degree in co-relation 8386. Up to 446 conditions per place. [2022-12-13 02:33:24,385 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 96 selfloop transitions, 152 changer transitions 4/252 dead transitions. [2022-12-13 02:33:24,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 252 transitions, 5989 flow [2022-12-13 02:33:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 02:33:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 02:33:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2022-12-13 02:33:24,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16031746031746033 [2022-12-13 02:33:24,386 INFO L175 Difference]: Start difference. First operand has 133 places, 206 transitions, 4876 flow. Second operand 15 states and 101 transitions. [2022-12-13 02:33:24,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 252 transitions, 5989 flow [2022-12-13 02:33:24,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 252 transitions, 5939 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 02:33:24,429 INFO L231 Difference]: Finished difference. Result has 148 places, 222 transitions, 5762 flow [2022-12-13 02:33:24,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4833, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5762, PETRI_PLACES=148, PETRI_TRANSITIONS=222} [2022-12-13 02:33:24,430 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 126 predicate places. [2022-12-13 02:33:24,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:33:24,430 INFO L89 Accepts]: Start accepts. Operand has 148 places, 222 transitions, 5762 flow [2022-12-13 02:33:24,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:33:24,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:33:24,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 222 transitions, 5762 flow [2022-12-13 02:33:24,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 222 transitions, 5762 flow [2022-12-13 02:33:24,476 INFO L130 PetriNetUnfolder]: 158/385 cut-off events. [2022-12-13 02:33:24,476 INFO L131 PetriNetUnfolder]: For 7062/7062 co-relation queries the response was YES. [2022-12-13 02:33:24,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 385 events. 158/385 cut-off events. For 7062/7062 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1974 event pairs, 2 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 4106. Up to 120 conditions per place. [2022-12-13 02:33:24,479 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 222 transitions, 5762 flow [2022-12-13 02:33:24,479 INFO L226 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-13 02:33:24,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:33:24,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 02:33:24,480 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 222 transitions, 5762 flow [2022-12-13 02:33:24,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:33:24,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:33:24,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:33:24,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 02:33:24,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 02:33:24,686 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:33:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:33:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash 112290931, now seen corresponding path program 1 times [2022-12-13 02:33:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:33:24,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844164226] [2022-12-13 02:33:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:33:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:33:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:33:25,267 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 02:33:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:33:25,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844164226] [2022-12-13 02:33:25,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844164226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:33:25,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896882385] [2022-12-13 02:33:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:33:25,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:33:25,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:33:25,269 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:33:25,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 02:33:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:33:25,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 02:33:25,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:33:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:33:25,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 02:33:25,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:33:25,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 02:33:25,687 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 02:33:25,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:33:26,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:33:26,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 396 [2022-12-13 02:33:26,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:33:26,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 170 [2022-12-13 02:33:26,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:33:26,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 152 [2022-12-13 02:34:35,012 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 02:34:35,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896882385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:34:35,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:34:35,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-13 02:34:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528037393] [2022-12-13 02:34:35,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:34:35,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 02:34:35,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:34:35,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 02:34:35,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-12-13 02:34:35,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 02:34:35,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 222 transitions, 5762 flow. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:35,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:34:35,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 02:34:35,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:34:37,748 INFO L130 PetriNetUnfolder]: 522/943 cut-off events. [2022-12-13 02:34:37,749 INFO L131 PetriNetUnfolder]: For 17897/17897 co-relation queries the response was YES. [2022-12-13 02:34:37,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10252 conditions, 943 events. 522/943 cut-off events. For 17897/17897 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4783 event pairs, 18 based on Foata normal form. 4/945 useless extension candidates. Maximal degree in co-relation 10205. Up to 413 conditions per place. [2022-12-13 02:34:37,757 INFO L137 encePairwiseOnDemand]: 13/41 looper letters, 82 selfloop transitions, 190 changer transitions 22/294 dead transitions. [2022-12-13 02:34:37,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 294 transitions, 7294 flow [2022-12-13 02:34:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 02:34:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 02:34:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 132 transitions. [2022-12-13 02:34:37,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14634146341463414 [2022-12-13 02:34:37,760 INFO L175 Difference]: Start difference. First operand has 147 places, 222 transitions, 5762 flow. Second operand 22 states and 132 transitions. [2022-12-13 02:34:37,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 294 transitions, 7294 flow [2022-12-13 02:34:37,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 294 transitions, 7094 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-13 02:34:37,834 INFO L231 Difference]: Finished difference. Result has 169 places, 244 transitions, 6774 flow [2022-12-13 02:34:37,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5589, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6774, PETRI_PLACES=169, PETRI_TRANSITIONS=244} [2022-12-13 02:34:37,834 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 147 predicate places. [2022-12-13 02:34:37,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:34:37,834 INFO L89 Accepts]: Start accepts. Operand has 169 places, 244 transitions, 6774 flow [2022-12-13 02:34:37,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:34:37,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:34:37,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 244 transitions, 6774 flow [2022-12-13 02:34:37,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 244 transitions, 6774 flow [2022-12-13 02:34:37,892 INFO L130 PetriNetUnfolder]: 166/391 cut-off events. [2022-12-13 02:34:37,892 INFO L131 PetriNetUnfolder]: For 9202/9202 co-relation queries the response was YES. [2022-12-13 02:34:37,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4638 conditions, 391 events. 166/391 cut-off events. For 9202/9202 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1982 event pairs, 2 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 4572. Up to 126 conditions per place. [2022-12-13 02:34:37,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 244 transitions, 6774 flow [2022-12-13 02:34:37,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-13 02:34:37,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:34:38,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L65-1-->thread2EXIT: Formula: (and (not (< v_~j~0_In_3 v_~N~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, ~j~0=v_~j~0_In_3, ~N~0=v_~N~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:34:38,120 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:34:38,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 02:34:38,121 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 243 transitions, 6750 flow [2022-12-13 02:34:38,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:38,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:34:38,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:34:38,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 02:34:38,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 02:34:38,322 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:34:38,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:34:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1967495503, now seen corresponding path program 1 times [2022-12-13 02:34:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:34:38,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250815628] [2022-12-13 02:34:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:34:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:34:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:34:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250815628] [2022-12-13 02:34:38,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250815628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:34:38,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:34:38,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:34:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419432756] [2022-12-13 02:34:38,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:34:38,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:34:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:34:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:34:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:34:38,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:34:38,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 243 transitions, 6750 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:38,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:34:38,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:34:38,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:34:38,725 INFO L130 PetriNetUnfolder]: 546/1001 cut-off events. [2022-12-13 02:34:38,726 INFO L131 PetriNetUnfolder]: For 31745/31745 co-relation queries the response was YES. [2022-12-13 02:34:38,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11525 conditions, 1001 events. 546/1001 cut-off events. For 31745/31745 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5059 event pairs, 119 based on Foata normal form. 62/1061 useless extension candidates. Maximal degree in co-relation 11438. Up to 522 conditions per place. [2022-12-13 02:34:38,736 INFO L137 encePairwiseOnDemand]: 26/39 looper letters, 175 selfloop transitions, 98 changer transitions 5/278 dead transitions. [2022-12-13 02:34:38,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 278 transitions, 7926 flow [2022-12-13 02:34:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:34:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:34:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 02:34:38,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-13 02:34:38,737 INFO L175 Difference]: Start difference. First operand has 160 places, 243 transitions, 6750 flow. Second operand 4 states and 66 transitions. [2022-12-13 02:34:38,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 278 transitions, 7926 flow [2022-12-13 02:34:38,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 278 transitions, 7773 flow, removed 52 selfloop flow, removed 8 redundant places. [2022-12-13 02:34:38,812 INFO L231 Difference]: Finished difference. Result has 157 places, 242 transitions, 6994 flow [2022-12-13 02:34:38,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=6158, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6994, PETRI_PLACES=157, PETRI_TRANSITIONS=242} [2022-12-13 02:34:38,812 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 135 predicate places. [2022-12-13 02:34:38,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:34:38,813 INFO L89 Accepts]: Start accepts. Operand has 157 places, 242 transitions, 6994 flow [2022-12-13 02:34:38,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:34:38,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:34:38,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 242 transitions, 6994 flow [2022-12-13 02:34:38,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 242 transitions, 6994 flow [2022-12-13 02:34:38,866 INFO L130 PetriNetUnfolder]: 168/418 cut-off events. [2022-12-13 02:34:38,866 INFO L131 PetriNetUnfolder]: For 11466/11466 co-relation queries the response was YES. [2022-12-13 02:34:38,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 418 events. 168/418 cut-off events. For 11466/11466 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2138 event pairs, 4 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 4588. Up to 124 conditions per place. [2022-12-13 02:34:38,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 242 transitions, 6994 flow [2022-12-13 02:34:38,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 02:34:38,871 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:34:38,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 02:34:38,871 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 242 transitions, 6994 flow [2022-12-13 02:34:38,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:38,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:34:38,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:34:38,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 02:34:38,872 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:34:38,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:34:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1594286472, now seen corresponding path program 1 times [2022-12-13 02:34:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:34:38,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654077374] [2022-12-13 02:34:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:34:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:34:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:34:41,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654077374] [2022-12-13 02:34:41,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654077374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:34:41,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752451442] [2022-12-13 02:34:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:41,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:34:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:34:41,594 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:34:41,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 02:34:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:41,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 02:34:41,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:34:41,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:41,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-12-13 02:34:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:34:42,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:34:42,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:42,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 282 [2022-12-13 02:34:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:34:49,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752451442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:34:49,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:34:49,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-13 02:34:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698295662] [2022-12-13 02:34:49,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:34:49,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 02:34:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:34:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 02:34:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-12-13 02:34:49,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 02:34:49,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 242 transitions, 6994 flow. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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 02:34:49,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:34:49,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 02:34:49,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:34:50,931 INFO L130 PetriNetUnfolder]: 592/1075 cut-off events. [2022-12-13 02:34:50,931 INFO L131 PetriNetUnfolder]: For 30632/30632 co-relation queries the response was YES. [2022-12-13 02:34:50,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12893 conditions, 1075 events. 592/1075 cut-off events. For 30632/30632 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5504 event pairs, 27 based on Foata normal form. 1/1074 useless extension candidates. Maximal degree in co-relation 11336. Up to 527 conditions per place. [2022-12-13 02:34:50,953 INFO L137 encePairwiseOnDemand]: 13/38 looper letters, 119 selfloop transitions, 171 changer transitions 8/298 dead transitions. [2022-12-13 02:34:50,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 298 transitions, 8724 flow [2022-12-13 02:34:50,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:34:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:34:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2022-12-13 02:34:50,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18045112781954886 [2022-12-13 02:34:50,954 INFO L175 Difference]: Start difference. First operand has 156 places, 242 transitions, 6994 flow. Second operand 14 states and 96 transitions. [2022-12-13 02:34:50,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 298 transitions, 8724 flow [2022-12-13 02:34:51,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 298 transitions, 8620 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 02:34:51,022 INFO L231 Difference]: Finished difference. Result has 168 places, 264 transitions, 8169 flow [2022-12-13 02:34:51,023 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=6906, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8169, PETRI_PLACES=168, PETRI_TRANSITIONS=264} [2022-12-13 02:34:51,023 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 146 predicate places. [2022-12-13 02:34:51,023 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:34:51,023 INFO L89 Accepts]: Start accepts. Operand has 168 places, 264 transitions, 8169 flow [2022-12-13 02:34:51,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:34:51,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:34:51,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 264 transitions, 8169 flow [2022-12-13 02:34:51,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 264 transitions, 8169 flow [2022-12-13 02:34:51,083 INFO L130 PetriNetUnfolder]: 184/448 cut-off events. [2022-12-13 02:34:51,084 INFO L131 PetriNetUnfolder]: For 14260/14260 co-relation queries the response was YES. [2022-12-13 02:34:51,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 448 events. 184/448 cut-off events. For 14260/14260 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2348 event pairs, 2 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 5396. Up to 137 conditions per place. [2022-12-13 02:34:51,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 264 transitions, 8169 flow [2022-12-13 02:34:51,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 02:34:56,871 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:34:56,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5848 [2022-12-13 02:34:56,871 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 264 transitions, 8233 flow [2022-12-13 02:34:56,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 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 02:34:56,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:34:56,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:34:56,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 02:34:57,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 02:34:57,077 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:34:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:34:57,077 INFO L85 PathProgramCache]: Analyzing trace with hash -774445017, now seen corresponding path program 1 times [2022-12-13 02:34:57,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:34:57,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55806428] [2022-12-13 02:34:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:57,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:34:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:34:57,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:34:57,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55806428] [2022-12-13 02:34:57,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55806428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:34:57,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:34:57,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:34:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020865366] [2022-12-13 02:34:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:34:57,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:34:57,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:34:57,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:34:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:34:57,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 02:34:57,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 264 transitions, 8233 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:57,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:34:57,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 02:34:57,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:34:57,450 INFO L130 PetriNetUnfolder]: 526/967 cut-off events. [2022-12-13 02:34:57,451 INFO L131 PetriNetUnfolder]: For 29640/29640 co-relation queries the response was YES. [2022-12-13 02:34:57,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12066 conditions, 967 events. 526/967 cut-off events. For 29640/29640 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4821 event pairs, 184 based on Foata normal form. 24/988 useless extension candidates. Maximal degree in co-relation 11077. Up to 921 conditions per place. [2022-12-13 02:34:57,457 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 221 selfloop transitions, 0 changer transitions 22/243 dead transitions. [2022-12-13 02:34:57,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 243 transitions, 7797 flow [2022-12-13 02:34:57,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:34:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:34:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 02:34:57,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35625 [2022-12-13 02:34:57,458 INFO L175 Difference]: Start difference. First operand has 168 places, 264 transitions, 8233 flow. Second operand 4 states and 57 transitions. [2022-12-13 02:34:57,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 243 transitions, 7797 flow [2022-12-13 02:34:57,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 243 transitions, 7452 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-12-13 02:34:57,524 INFO L231 Difference]: Finished difference. Result has 162 places, 221 transitions, 6483 flow [2022-12-13 02:34:57,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6865, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6483, PETRI_PLACES=162, PETRI_TRANSITIONS=221} [2022-12-13 02:34:57,525 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 140 predicate places. [2022-12-13 02:34:57,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:34:57,525 INFO L89 Accepts]: Start accepts. Operand has 162 places, 221 transitions, 6483 flow [2022-12-13 02:34:57,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:34:57,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:34:57,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 221 transitions, 6483 flow [2022-12-13 02:34:57,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 221 transitions, 6483 flow [2022-12-13 02:34:57,582 INFO L130 PetriNetUnfolder]: 164/398 cut-off events. [2022-12-13 02:34:57,582 INFO L131 PetriNetUnfolder]: For 10784/10784 co-relation queries the response was YES. [2022-12-13 02:34:57,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 398 events. 164/398 cut-off events. For 10784/10784 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1979 event pairs, 1 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 4714. Up to 122 conditions per place. [2022-12-13 02:34:57,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 221 transitions, 6483 flow [2022-12-13 02:34:57,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-13 02:34:57,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [924] L65-1-->L65-1: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (= v_~j~0_619 (+ (select (select |v_#memory_int_705| v_~q2~0.base_415) (+ v_~q2~0.offset_415 (* v_~q2_front~0_554 4))) 1)) (< v_~j~0_620 v_~N~0_434) (= v_~q1_back~0_748 (+ v_~q1_back~0_749 1)) (not (= (ite (and (<= 0 v_~q1_back~0_749) (< v_~q1_back~0_749 v_~n1~0_432)) 1 0) 0)) (not (= (ite (= v_~j~0_620 (select (select |v_#memory_int_705| v_~q1~0.base_445) (+ v_~q1~0.offset_445 (* v_~q1_back~0_749 4)))) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (= (ite (and (< v_~q2_front~0_554 v_~n2~0_420) (< v_~q2_front~0_554 v_~q2_back~0_720) (<= 0 v_~q2_front~0_554)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|) (= (+ v_~q2_front~0_554 1) v_~q2_front~0_553)) InVars {~j~0=v_~j~0_620, ~q1~0.offset=v_~q1~0.offset_445, ~n2~0=v_~n2~0_420, ~q1_back~0=v_~q1_back~0_749, ~q2~0.offset=v_~q2~0.offset_415, ~n1~0=v_~n1~0_432, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_705|, ~q2_front~0=v_~q2_front~0_554, ~q2~0.base=v_~q2~0.base_415, ~N~0=v_~N~0_434, ~q2_back~0=v_~q2_back~0_720} OutVars{thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_270|, ~j~0=v_~j~0_619, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_264|, ~q1~0.offset=v_~q1~0.offset_445, ~n2~0=v_~n2~0_420, ~q2~0.offset=v_~q2~0.offset_415, ~n1~0=v_~n1~0_432, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, ~q2_front~0=v_~q2_front~0_553, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_316|, ~N~0=v_~N~0_434, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_316|, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_264|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, ~q1_back~0=v_~q1_back~0_748, ~q1~0.base=v_~q1~0.base_445, #memory_int=|v_#memory_int_705|, ~q2~0.base=v_~q2~0.base_415, ~q2_back~0=v_~q2_back~0_720} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~post9#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:34:58,049 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:34:58,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 525 [2022-12-13 02:34:58,050 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 221 transitions, 6515 flow [2022-12-13 02:34:58,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:34:58,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:34:58,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:34:58,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 02:34:58,051 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:34:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:34:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 183522750, now seen corresponding path program 1 times [2022-12-13 02:34:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:34:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169115948] [2022-12-13 02:34:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:34:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:58,787 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 02:34:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:34:58,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169115948] [2022-12-13 02:34:58,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169115948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:34:58,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524532306] [2022-12-13 02:34:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:34:58,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:34:58,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:34:58,789 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:34:58,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 02:34:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:34:58,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 02:34:58,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:34:58,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:34:59,039 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-13 02:34:59,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-13 02:34:59,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-12-13 02:34:59,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-12-13 02:34:59,084 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:59,085 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-13 02:34:59,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:34:59,147 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-13 02:34:59,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 45 [2022-12-13 02:34:59,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:34:59,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 17 [2022-12-13 02:34:59,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:34:59,498 INFO L321 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-12-13 02:34:59,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2022-12-13 02:34:59,555 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 02:34:59,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:00,339 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 02:35:00,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524532306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:00,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:00,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 02:35:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735963171] [2022-12-13 02:35:00,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:00,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 02:35:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 02:35:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=354, Unknown=6, NotChecked=0, Total=420 [2022-12-13 02:35:00,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 02:35:00,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 221 transitions, 6515 flow. Second operand has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:00,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:00,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 02:35:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:09,647 INFO L130 PetriNetUnfolder]: 696/1263 cut-off events. [2022-12-13 02:35:09,647 INFO L131 PetriNetUnfolder]: For 33380/33380 co-relation queries the response was YES. [2022-12-13 02:35:09,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15135 conditions, 1263 events. 696/1263 cut-off events. For 33380/33380 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6778 event pairs, 18 based on Foata normal form. 17/1278 useless extension candidates. Maximal degree in co-relation 14171. Up to 484 conditions per place. [2022-12-13 02:35:09,664 INFO L137 encePairwiseOnDemand]: 13/39 looper letters, 95 selfloop transitions, 244 changer transitions 13/352 dead transitions. [2022-12-13 02:35:09,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 352 transitions, 9794 flow [2022-12-13 02:35:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 02:35:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-13 02:35:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 166 transitions. [2022-12-13 02:35:09,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13730355665839536 [2022-12-13 02:35:09,665 INFO L175 Difference]: Start difference. First operand has 153 places, 221 transitions, 6515 flow. Second operand 31 states and 166 transitions. [2022-12-13 02:35:09,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 352 transitions, 9794 flow [2022-12-13 02:35:09,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 352 transitions, 9587 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-12-13 02:35:09,754 INFO L231 Difference]: Finished difference. Result has 184 places, 288 transitions, 9247 flow [2022-12-13 02:35:09,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=6331, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=9247, PETRI_PLACES=184, PETRI_TRANSITIONS=288} [2022-12-13 02:35:09,755 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 162 predicate places. [2022-12-13 02:35:09,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:09,755 INFO L89 Accepts]: Start accepts. Operand has 184 places, 288 transitions, 9247 flow [2022-12-13 02:35:09,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:09,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:09,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 288 transitions, 9247 flow [2022-12-13 02:35:09,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 288 transitions, 9247 flow [2022-12-13 02:35:09,835 INFO L130 PetriNetUnfolder]: 212/526 cut-off events. [2022-12-13 02:35:09,835 INFO L131 PetriNetUnfolder]: For 15873/15873 co-relation queries the response was YES. [2022-12-13 02:35:09,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6868 conditions, 526 events. 212/526 cut-off events. For 15873/15873 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2973 event pairs, 1 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 6796. Up to 158 conditions per place. [2022-12-13 02:35:09,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 288 transitions, 9247 flow [2022-12-13 02:35:09,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-13 02:35:09,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:35:09,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L47-1-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (< v_~i~0_33 v_~N~0_11) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~i~0_33 (select (select |v_#memory_int_59| v_~q2~0.base_23) (+ v_~q2~0.offset_23 (* v_~q2_back~0_47 4)))) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (not (= (ite (and (<= 0 v_~q2_back~0_47) (< v_~q2_back~0_47 v_~n2~0_26)) 1 0) 0)) (= (+ v_~q2_back~0_47 1) v_~q2_back~0_46)) InVars {~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, ~q2_back~0=v_~q2_back~0_47} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, ~n2~0=v_~n2~0_26, ~i~0=v_~i~0_33, ~q2~0.offset=v_~q2~0.offset_23, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_59|, ~q2~0.base=v_~q2~0.base_23, ~N~0=v_~N~0_11, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_5|, ~q2_back~0=v_~q2_back~0_46} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~q2_back~0] and [650] L70-->L65-1: Formula: (and (= (+ v_~q2_front~0_61 1) v_~q2_front~0_60) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~j~0_65 (+ (select (select |v_#memory_int_133| v_~q2~0.base_41) (+ v_~q2~0.offset_41 (* 4 v_~q2_front~0_61))) 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= (ite (and (< v_~q2_front~0_61 v_~n2~0_56) (< v_~q2_front~0_61 v_~q2_back~0_80) (<= 0 v_~q2_front~0_61)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, ~q2_front~0=v_~q2_front~0_61, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_17|, ~j~0=v_~j~0_65, thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_13|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_41, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~q2_front~0=v_~q2_front~0_60, ~q2~0.base=v_~q2~0.base_41, ~q2_back~0=v_~q2_back~0_80, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, ~j~0, thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread2Thread1of1ForFork1_#t~post9#1] [2022-12-13 02:35:10,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:35:10,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [646] L65-1-->L70: Formula: (and (= (+ 1 v_~q1_back~0_69) v_~q1_back~0_68) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (< v_~j~0_61 v_~N~0_31) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= (ite (and (< v_~q1_back~0_69 v_~n1~0_40) (<= 0 v_~q1_back~0_69)) 1 0) 0)) (= (ite (= v_~j~0_61 (select (select |v_#memory_int_129| v_~q1~0.base_53) (+ v_~q1~0.offset_53 (* 4 v_~q1_back~0_69)))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|)) InVars {~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_69, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, ~j~0=v_~j~0_61, ~q1~0.offset=v_~q1~0.offset_53, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_40, ~q1~0.base=v_~q1~0.base_53, #memory_int=|v_#memory_int_129|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_9|, ~N~0=v_~N~0_31, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~q1_back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1] and [661] L52-->L47-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ (select (select |v_#memory_int_143| v_~q1~0.base_57) (+ v_~q1~0.offset_57 (* 4 v_~q1_front~0_63))) 1) v_~i~0_69) (= (ite (and (< v_~q1_front~0_63 v_~n1~0_48) (<= 0 v_~q1_front~0_63) (< v_~q1_front~0_63 v_~q1_back~0_74)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|) (= (+ v_~q1_front~0_63 1) v_~q1_front~0_62) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25| 0))) InVars {~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_63, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, ~q1~0.base=v_~q1~0.base_57, #memory_int=|v_#memory_int_143|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_25|, ~q1~0.offset=v_~q1~0.offset_57, ~q1_front~0=v_~q1_front~0_62, ~i~0=v_~i~0_69, ~q1_back~0=v_~q1_back~0_74, ~n1~0=v_~n1~0_48, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_15|, ~q1~0.base=v_~q1~0.base_57, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_19|, #memory_int=|v_#memory_int_143|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_25|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, ~i~0, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-13 02:35:10,451 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:35:10,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 696 [2022-12-13 02:35:10,451 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 285 transitions, 9179 flow [2022-12-13 02:35:10,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:10,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:10,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:10,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 02:35:10,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:10,652 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:35:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1498287779, now seen corresponding path program 1 times [2022-12-13 02:35:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:10,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204150858] [2022-12-13 02:35:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:11,665 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 02:35:11,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:11,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204150858] [2022-12-13 02:35:11,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204150858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:11,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323850796] [2022-12-13 02:35:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:11,667 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:35:11,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 02:35:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:11,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 02:35:11,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:11,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:11,906 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-13 02:35:11,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-13 02:35:11,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-12-13 02:35:11,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-12-13 02:35:11,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:11,960 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 02:35:11,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 33 [2022-12-13 02:35:11,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:11,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 17 [2022-12-13 02:35:11,974 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 02:35:11,975 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-13 02:35:12,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:35:14,443 INFO L321 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-12-13 02:35:14,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2022-12-13 02:35:14,529 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 02:35:14,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:17,516 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 02:35:17,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323850796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:17,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:17,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 02:35:17,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364582270] [2022-12-13 02:35:17,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:17,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 02:35:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 02:35:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=354, Unknown=6, NotChecked=0, Total=420 [2022-12-13 02:35:17,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:35:17,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 285 transitions, 9179 flow. Second operand has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:17,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:17,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:35:17,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:35:20,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:35:23,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:35:25,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:35:27,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:35:29,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:35:33,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:35:38,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 02:35:42,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 02:35:47,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 02:35:52,028 INFO L130 PetriNetUnfolder]: 687/1240 cut-off events. [2022-12-13 02:35:52,029 INFO L131 PetriNetUnfolder]: For 37376/37376 co-relation queries the response was YES. [2022-12-13 02:35:52,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15654 conditions, 1240 events. 687/1240 cut-off events. For 37376/37376 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6582 event pairs, 26 based on Foata normal form. 1/1239 useless extension candidates. Maximal degree in co-relation 15569. Up to 473 conditions per place. [2022-12-13 02:35:52,038 INFO L137 encePairwiseOnDemand]: 13/42 looper letters, 94 selfloop transitions, 242 changer transitions 6/342 dead transitions. [2022-12-13 02:35:52,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 342 transitions, 10302 flow [2022-12-13 02:35:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 02:35:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 02:35:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 147 transitions. [2022-12-13 02:35:52,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1346153846153846 [2022-12-13 02:35:52,043 INFO L175 Difference]: Start difference. First operand has 178 places, 285 transitions, 9179 flow. Second operand 26 states and 147 transitions. [2022-12-13 02:35:52,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 342 transitions, 10302 flow [2022-12-13 02:35:52,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 342 transitions, 10178 flow, removed 49 selfloop flow, removed 5 redundant places. [2022-12-13 02:35:52,144 INFO L231 Difference]: Finished difference. Result has 201 places, 291 transitions, 9799 flow [2022-12-13 02:35:52,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9067, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=9799, PETRI_PLACES=201, PETRI_TRANSITIONS=291} [2022-12-13 02:35:52,144 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 179 predicate places. [2022-12-13 02:35:52,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:35:52,145 INFO L89 Accepts]: Start accepts. Operand has 201 places, 291 transitions, 9799 flow [2022-12-13 02:35:52,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:35:52,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:35:52,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 291 transitions, 9799 flow [2022-12-13 02:35:52,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 291 transitions, 9799 flow [2022-12-13 02:35:52,244 INFO L130 PetriNetUnfolder]: 213/526 cut-off events. [2022-12-13 02:35:52,244 INFO L131 PetriNetUnfolder]: For 16865/16865 co-relation queries the response was YES. [2022-12-13 02:35:52,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 526 events. 213/526 cut-off events. For 16865/16865 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2946 event pairs, 4 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 7104. Up to 159 conditions per place. [2022-12-13 02:35:52,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 291 transitions, 9799 flow [2022-12-13 02:35:52,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-13 02:35:52,251 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:35:52,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-13 02:35:52,252 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 291 transitions, 9799 flow [2022-12-13 02:35:52,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:52,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:35:52,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:35:52,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 02:35:52,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:52,458 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:35:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:35:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2025070873, now seen corresponding path program 1 times [2022-12-13 02:35:52,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:35:52,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182892422] [2022-12-13 02:35:52,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:35:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:54,182 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 02:35:54,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:35:54,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182892422] [2022-12-13 02:35:54,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182892422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:35:54,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297437680] [2022-12-13 02:35:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:35:54,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:35:54,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:35:54,184 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:35:54,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 02:35:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:35:54,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 02:35:54,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:35:54,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:54,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:54,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 02:35:54,408 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 02:35:54,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-12-13 02:35:54,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-13 02:35:54,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2022-12-13 02:35:54,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 02:35:54,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2022-12-13 02:35:54,761 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 02:35:54,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:35:57,364 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 02:35:57,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297437680] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:35:57,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:35:57,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-13 02:35:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499742935] [2022-12-13 02:35:57,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:35:57,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 02:35:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:35:57,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 02:35:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2022-12-13 02:35:57,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 02:35:57,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 291 transitions, 9799 flow. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:35:57,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:35:57,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 02:35:57,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:36:20,075 WARN L233 SmtUtils]: Spent 12.73s on a formula simplification. DAG size of input: 165 DAG size of output: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 02:36:22,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 02:36:23,599 INFO L130 PetriNetUnfolder]: 711/1288 cut-off events. [2022-12-13 02:36:23,599 INFO L131 PetriNetUnfolder]: For 41434/41434 co-relation queries the response was YES. [2022-12-13 02:36:23,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16721 conditions, 1288 events. 711/1288 cut-off events. For 41434/41434 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6841 event pairs, 22 based on Foata normal form. 2/1288 useless extension candidates. Maximal degree in co-relation 16634. Up to 629 conditions per place. [2022-12-13 02:36:23,609 INFO L137 encePairwiseOnDemand]: 10/42 looper letters, 76 selfloop transitions, 252 changer transitions 17/345 dead transitions. [2022-12-13 02:36:23,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 345 transitions, 10958 flow [2022-12-13 02:36:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 02:36:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 02:36:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 137 transitions. [2022-12-13 02:36:23,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13047619047619047 [2022-12-13 02:36:23,610 INFO L175 Difference]: Start difference. First operand has 200 places, 291 transitions, 9799 flow. Second operand 25 states and 137 transitions. [2022-12-13 02:36:23,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 345 transitions, 10958 flow [2022-12-13 02:36:23,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 345 transitions, 10812 flow, removed 3 selfloop flow, removed 14 redundant places. [2022-12-13 02:36:23,716 INFO L231 Difference]: Finished difference. Result has 218 places, 299 transitions, 10711 flow [2022-12-13 02:36:23,716 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=9653, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=10711, PETRI_PLACES=218, PETRI_TRANSITIONS=299} [2022-12-13 02:36:23,717 INFO L295 CegarLoopForPetriNet]: 22 programPoint places, 196 predicate places. [2022-12-13 02:36:23,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:36:23,717 INFO L89 Accepts]: Start accepts. Operand has 218 places, 299 transitions, 10711 flow [2022-12-13 02:36:23,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:36:23,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:36:23,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 299 transitions, 10711 flow [2022-12-13 02:36:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 299 transitions, 10711 flow [2022-12-13 02:36:23,796 INFO L130 PetriNetUnfolder]: 217/534 cut-off events. [2022-12-13 02:36:23,797 INFO L131 PetriNetUnfolder]: For 20525/20525 co-relation queries the response was YES. [2022-12-13 02:36:23,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7857 conditions, 534 events. 217/534 cut-off events. For 20525/20525 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2956 event pairs, 4 based on Foata normal form. 0/533 useless extension candidates. Maximal degree in co-relation 7765. Up to 163 conditions per place. [2022-12-13 02:36:23,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 299 transitions, 10711 flow [2022-12-13 02:36:23,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 02:36:23,803 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:36:23,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 02:36:23,804 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 299 transitions, 10711 flow [2022-12-13 02:36:23,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:36:23,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:36:23,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:36:23,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 02:36:24,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-13 02:36:24,005 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:36:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:36:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1480051192, now seen corresponding path program 1 times [2022-12-13 02:36:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:36:24,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666438560] [2022-12-13 02:36:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:36:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:36:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:36:25,219 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 02:36:25,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:36:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666438560] [2022-12-13 02:36:25,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666438560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:36:25,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398603694] [2022-12-13 02:36:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:36:25,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:36:25,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:36:25,221 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:36:25,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 02:36:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:36:25,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 02:36:25,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:36:25,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:36:25,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 02:36:25,741 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-12-13 02:36:25,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 02:36:25,820 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 02:36:25,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:36:26,418 INFO L321 Elim1Store]: treesize reduction 34, result has 86.2 percent of original size [2022-12-13 02:36:26,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 243 Received shutdown request... [2022-12-13 02:36:29,600 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 02:36:29,601 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:36:29,605 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 02:36:29,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 02:36:29,628 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:36:29,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:36:29,802 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. [2022-12-13 02:36:29,803 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:36:29,804 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:36:29,804 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:36:29,806 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:36:29,806 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:36:29,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:36:29 BasicIcfg [2022-12-13 02:36:29,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:36:29,807 INFO L158 Benchmark]: Toolchain (without parser) took 804333.33ms. Allocated memory was 158.3MB in the beginning and 398.5MB in the end (delta: 240.1MB). Free memory was 121.0MB in the beginning and 227.1MB in the end (delta: -106.2MB). Peak memory consumption was 271.8MB. Max. memory is 8.0GB. [2022-12-13 02:36:29,808 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:36:29,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.78ms. Allocated memory is still 158.3MB. Free memory was 121.0MB in the beginning and 108.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 02:36:29,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.04ms. Allocated memory is still 158.3MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:36:29,808 INFO L158 Benchmark]: Boogie Preprocessor took 39.53ms. Allocated memory is still 158.3MB. Free memory was 105.8MB in the beginning and 104.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:36:29,808 INFO L158 Benchmark]: RCFGBuilder took 559.07ms. Allocated memory is still 158.3MB. Free memory was 104.3MB in the beginning and 115.6MB in the end (delta: -11.3MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-12-13 02:36:29,808 INFO L158 Benchmark]: TraceAbstraction took 803425.01ms. Allocated memory was 158.3MB in the beginning and 398.5MB in the end (delta: 240.1MB). Free memory was 114.5MB in the beginning and 227.1MB in the end (delta: -112.6MB). Peak memory consumption was 264.4MB. Max. memory is 8.0GB. [2022-12-13 02:36:29,809 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 106.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.78ms. Allocated memory is still 158.3MB. Free memory was 121.0MB in the beginning and 108.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.04ms. Allocated memory is still 158.3MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.53ms. Allocated memory is still 158.3MB. Free memory was 105.8MB in the beginning and 104.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 559.07ms. Allocated memory is still 158.3MB. Free memory was 104.3MB in the beginning and 115.6MB in the end (delta: -11.3MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * TraceAbstraction took 803425.01ms. Allocated memory was 158.3MB in the beginning and 398.5MB in the end (delta: 240.1MB). Free memory was 114.5MB in the beginning and 227.1MB in the end (delta: -112.6MB). Peak memory consumption was 264.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 147 PlacesBefore, 22 PlacesAfterwards, 153 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 106 TrivialYvCompositions, 19 ConcurrentYvCompositions, 9 ChoiceCompositions, 134 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 294, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 294, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 7, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 32 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 36 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.8s, 81 PlacesBefore, 73 PlacesAfterwards, 137 TransitionsBefore, 129 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 17 ConcurrentYvCompositions, 0 ChoiceCompositions, 24 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 96, independent conditional: 86, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 86, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 36, independent conditional: 31, 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: 36, independent: 36, independent conditional: 0, independent unconditional: 36, 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: 96, independent: 60, independent conditional: 55, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 36, unknown conditional: 31, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 56, Positive conditional cache size: 32, Positive unconditional cache size: 24, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 67 PlacesBefore, 64 PlacesAfterwards, 114 TransitionsBefore, 111 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 15, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 15, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 65, Positive conditional cache size: 41, Positive unconditional cache size: 24, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 77 PlacesBefore, 74 PlacesAfterwards, 121 TransitionsBefore, 118 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 70, Positive conditional cache size: 45, Positive unconditional cache size: 25, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.3s, 90 PlacesBefore, 87 PlacesAfterwards, 167 TransitionsBefore, 164 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 74, Positive conditional cache size: 47, Positive unconditional cache size: 27, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 117 PlacesBefore, 113 PlacesAfterwards, 220 TransitionsBefore, 215 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 13, independent conditional: 11, independent unconditional: 2, 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): 90, Positive cache size: 84, Positive conditional cache size: 54, Positive unconditional cache size: 30, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 113 PlacesBefore, 112 PlacesAfterwards, 187 TransitionsBefore, 186 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 87, Positive conditional cache size: 57, Positive unconditional cache size: 30, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 87, Positive conditional cache size: 57, Positive unconditional cache size: 30, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 161 TransitionsBefore, 161 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 87, Positive conditional cache size: 57, Positive unconditional cache size: 30, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 161 TransitionsBefore, 161 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 87, Positive conditional cache size: 57, Positive unconditional cache size: 30, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 84 PlacesBefore, 81 PlacesAfterwards, 103 TransitionsBefore, 100 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 7, independent conditional: 4, independent unconditional: 3, 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): 94, Positive cache size: 88, Positive conditional cache size: 58, Positive unconditional cache size: 30, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 98 PlacesBefore, 95 PlacesAfterwards, 123 TransitionsBefore, 120 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 6, independent: 5, independent conditional: 5, 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): 99, Positive cache size: 93, Positive conditional cache size: 59, Positive unconditional cache size: 34, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 110 PlacesBefore, 108 PlacesAfterwards, 148 TransitionsBefore, 146 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 95, Positive conditional cache size: 61, Positive unconditional cache size: 34, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 121 PlacesBefore, 121 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 96, Positive conditional cache size: 61, Positive unconditional cache size: 35, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 142 PlacesBefore, 138 PlacesAfterwards, 192 TransitionsBefore, 189 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 99, Positive conditional cache size: 63, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 130 PlacesBefore, 128 PlacesAfterwards, 137 TransitionsBefore, 135 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 103, Positive conditional cache size: 67, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 103, Positive conditional cache size: 67, Positive unconditional cache size: 36, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 122 PlacesBefore, 118 PlacesAfterwards, 151 TransitionsBefore, 147 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 112, Positive conditional cache size: 70, Positive unconditional cache size: 42, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 146 PlacesBefore, 140 PlacesAfterwards, 223 TransitionsBefore, 217 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 14, independent: 10, independent conditional: 10, 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): 127, Positive cache size: 121, Positive conditional cache size: 74, Positive unconditional cache size: 47, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 153 PlacesBefore, 150 PlacesAfterwards, 265 TransitionsBefore, 263 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 124, Positive conditional cache size: 74, Positive unconditional cache size: 50, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 171 PlacesBefore, 169 PlacesAfterwards, 319 TransitionsBefore, 317 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 128, Positive conditional cache size: 74, Positive unconditional cache size: 54, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 184 PlacesBefore, 182 PlacesAfterwards, 362 TransitionsBefore, 360 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 132, Positive conditional cache size: 78, Positive unconditional cache size: 54, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 139 PlacesBefore, 137 PlacesAfterwards, 194 TransitionsBefore, 192 TransitionsAfterwards, 308 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 135, Positive conditional cache size: 80, Positive unconditional cache size: 55, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 150 PlacesBefore, 149 PlacesAfterwards, 193 TransitionsBefore, 192 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, 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): 141, Positive cache size: 135, Positive conditional cache size: 80, Positive unconditional cache size: 55, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 121 PlacesBefore, 117 PlacesAfterwards, 124 TransitionsBefore, 122 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 137, Positive conditional cache size: 80, Positive unconditional cache size: 57, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 117 PlacesBefore, 114 PlacesAfterwards, 134 TransitionsBefore, 132 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 139, Positive conditional cache size: 81, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 121 PlacesBefore, 117 PlacesAfterwards, 155 TransitionsBefore, 153 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 139, Positive conditional cache size: 81, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 139, Positive conditional cache size: 81, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 133 PlacesBefore, 133 PlacesAfterwards, 206 TransitionsBefore, 206 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 139, Positive conditional cache size: 81, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 147 PlacesBefore, 147 PlacesAfterwards, 222 TransitionsBefore, 222 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 139, Positive conditional cache size: 81, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 160 PlacesBefore, 160 PlacesAfterwards, 244 TransitionsBefore, 243 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 141, Positive conditional cache size: 83, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 156 PlacesBefore, 156 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 141, Positive conditional cache size: 83, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 168 PlacesBefore, 168 PlacesAfterwards, 264 TransitionsBefore, 264 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 141, Positive conditional cache size: 83, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 153 PlacesBefore, 153 PlacesAfterwards, 221 TransitionsBefore, 221 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, 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): 148, Positive cache size: 142, Positive conditional cache size: 83, Positive unconditional cache size: 59, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 181 PlacesBefore, 178 PlacesAfterwards, 288 TransitionsBefore, 285 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 4, independent: 3, independent conditional: 3, 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): 152, Positive cache size: 146, Positive conditional cache size: 84, Positive unconditional cache size: 62, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 200 PlacesBefore, 200 PlacesAfterwards, 291 TransitionsBefore, 291 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 146, Positive conditional cache size: 84, Positive unconditional cache size: 62, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 216 PlacesBefore, 216 PlacesAfterwards, 299 TransitionsBefore, 299 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 146, Positive conditional cache size: 84, Positive unconditional cache size: 62, Negative cache size: 6, Negative conditional cache size: 4, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 7 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 171 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 803.3s, OverallIterations: 44, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 182.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 260 mSolverCounterUnknown, 3886 SdHoareTripleChecker+Valid, 70.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3886 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 67.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20846 IncrementalHoareTripleChecker+Invalid, 23428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2305 mSolverCounterUnsat, 0 mSDtfsCounter, 20846 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1309 GetRequests, 415 SyntacticMatches, 30 SemanticMatches, 864 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5160 ImplicationChecksByTransitivity, 132.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10711occurred in iteration=43, InterpolantAutomatonStates: 627, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 483.9s InterpolantComputationTime, 954 NumberOfCodeBlocks, 954 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1218 ConstructedInterpolants, 112 QuantifiedInterpolants, 44822 SizeOfPredicates, 567 NumberOfNonLiveVariables, 6912 ConjunctsInSsa, 1150 ConjunctsInUnsatCore, 101 InterpolantComputations, 15 PerfectInterpolantSequences, 25/147 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