/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/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:28:11,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:28:11,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:28:11,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:28:11,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:28:11,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:28:11,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:28:11,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:28:11,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:28:11,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:28:11,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:28:11,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:28:11,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:28:11,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:28:11,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:28:11,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:28:11,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:28:11,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:28:11,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:28:11,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:28:11,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:28:11,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:28:11,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:28:11,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:28:11,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:28:11,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:28:11,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:28:11,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:28:11,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:28:11,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:28:11,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:28:11,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:28:11,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:28:11,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:28:11,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:28:11,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:28:11,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:28:11,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:28:11,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:28:11,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:28:11,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:28:11,729 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-06 00:28:11,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:28:11,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:28:11,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:28:11,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:28:11,760 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:28:11,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:28:11,761 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:28:11,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:28:11,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:28:11,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:28:11,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:28:11,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:28:11,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:28:11,763 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:28:11,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:28:11,763 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:28:11,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:28:11,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:28:11,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:28:11,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:28:11,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:28:11,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:28:11,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:28:11,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:28:11,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:28:11,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:28:11,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:28:11,765 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:28:11,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:28:12,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:28:12,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:28:12,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:28:12,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:28:12,088 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:28:12,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 00:28:13,102 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:28:13,304 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:28:13,304 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2022-12-06 00:28:13,309 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f7dcd6c0/d91adb8a5410448699d2562288cbb505/FLAG8f9d27f73 [2022-12-06 00:28:13,319 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f7dcd6c0/d91adb8a5410448699d2562288cbb505 [2022-12-06 00:28:13,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:28:13,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:28:13,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:28:13,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:28:13,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:28:13,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5883778c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13, skipping insertion in model container [2022-12-06 00:28:13,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:28:13,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:28:13,551 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-06 00:28:13,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:28:13,576 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:28:13,607 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2428,2441] [2022-12-06 00:28:13,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:28:13,626 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:28:13,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13 WrapperNode [2022-12-06 00:28:13,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:28:13,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:28:13,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:28:13,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:28:13,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,680 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2022-12-06 00:28:13,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:28:13,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:28:13,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:28:13,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:28:13,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,716 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:28:13,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:28:13,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:28:13,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:28:13,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (1/1) ... [2022-12-06 00:28:13,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:28:13,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:13,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:28:13,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:28:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:28:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:28:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:28:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:28:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:28:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:28:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:28:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:28:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:28:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:28:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:28:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:28:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:28:13,804 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:28:13,897 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:28:13,899 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:28:14,137 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:28:14,145 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:28:14,145 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:28:14,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:28:14 BoogieIcfgContainer [2022-12-06 00:28:14,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:28:14,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:28:14,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:28:14,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:28:14,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:28:13" (1/3) ... [2022-12-06 00:28:14,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b741dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:28:14, skipping insertion in model container [2022-12-06 00:28:14,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:13" (2/3) ... [2022-12-06 00:28:14,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b741dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:28:14, skipping insertion in model container [2022-12-06 00:28:14,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:28:14" (3/3) ... [2022-12-06 00:28:14,155 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2022-12-06 00:28:14,170 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:28:14,171 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:28:14,171 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:28:14,253 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:28:14,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 00:28:14,368 INFO L130 PetriNetUnfolder]: 14/152 cut-off events. [2022-12-06 00:28:14,368 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:14,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 152 events. 14/152 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 145 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 00:28:14,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 154 transitions, 324 flow [2022-12-06 00:28:14,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 144 transitions, 300 flow [2022-12-06 00:28:14,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:14,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 00:28:14,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 144 transitions, 300 flow [2022-12-06 00:28:14,437 INFO L130 PetriNetUnfolder]: 14/144 cut-off events. [2022-12-06 00:28:14,437 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:14,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 144 events. 14/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 138 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 00:28:14,443 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 144 transitions, 300 flow [2022-12-06 00:28:14,443 INFO L188 LiptonReduction]: Number of co-enabled transitions 1942 [2022-12-06 00:28:18,943 INFO L203 LiptonReduction]: Total number of compositions: 127 [2022-12-06 00:28:18,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:28:18,961 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;@1aced7b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:28:18,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:28:18,965 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 00:28:18,965 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:18,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:18,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:18,966 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1849926836, now seen corresponding path program 1 times [2022-12-06 00:28:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:18,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835515955] [2022-12-06 00:28:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:19,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835515955] [2022-12-06 00:28:19,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835515955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:19,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:19,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:28:19,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658505850] [2022-12-06 00:28:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:19,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:19,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:19,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 00:28:19,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:19,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:19,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 00:28:19,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:19,439 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 00:28:19,439 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 00:28:19,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 00:28:19,442 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 00:28:19,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 00:28:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 00:28:19,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 00:28:19,454 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 00:28:19,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 00:28:19,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:28:19,458 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:19,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 00:28:19,464 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 00:28:19,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:19,464 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:19,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:19,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:19,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:19,478 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 00:28:19,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:28:19,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 00:28:19,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:19,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 00:28:20,418 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:20,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 955 [2022-12-06 00:28:20,420 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 00:28:20,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:20,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:20,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:20,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:28:20,421 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash 233480835, now seen corresponding path program 1 times [2022-12-06 00:28:20,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:20,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100141738] [2022-12-06 00:28:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:20,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:20,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100141738] [2022-12-06 00:28:20,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100141738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:20,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:20,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:28:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247054562] [2022-12-06 00:28:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:20,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:20,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 00:28:20,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:20,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:20,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 00:28:20,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:20,767 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 00:28:20,767 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:28:20,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 00:28:20,770 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 00:28:20,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 00:28:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 00:28:20,771 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 00:28:20,771 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 00:28:20,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 00:28:20,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:20,773 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:20,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-06 00:28:20,774 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 00:28:20,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:20,774 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:20,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:20,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:20,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:20,783 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 00:28:20,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:28:20,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 00:28:20,786 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:20,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 00:28:20,787 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:20,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 00:28:20,789 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:20,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:20,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:20,789 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:20,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:28:20,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:20,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash 166108600, now seen corresponding path program 1 times [2022-12-06 00:28:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:20,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579993439] [2022-12-06 00:28:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:20,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:20,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579993439] [2022-12-06 00:28:20,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579993439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:20,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:20,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:28:20,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684562073] [2022-12-06 00:28:20,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:20,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:28:20,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:28:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:20,930 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 00:28:20,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:20,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:20,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 00:28:20,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:21,044 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 00:28:21,044 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 00:28:21,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 169 events. 87/169 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 517 event pairs, 30 based on Foata normal form. 6/174 useless extension candidates. Maximal degree in co-relation 132. Up to 98 conditions per place. [2022-12-06 00:28:21,048 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 6/40 dead transitions. [2022-12-06 00:28:21,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 40 transitions, 193 flow [2022-12-06 00:28:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 00:28:21,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-06 00:28:21,049 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 39 transitions. [2022-12-06 00:28:21,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 40 transitions, 193 flow [2022-12-06 00:28:21,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 40 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:21,051 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 00:28:21,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 00:28:21,052 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 00:28:21,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:21,052 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 00:28:21,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:21,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:21,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 00:28:21,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 00:28:21,063 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-06 00:28:21,063 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 00:28:21,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 34 events. 7/34 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 46. Up to 11 conditions per place. [2022-12-06 00:28:21,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 00:28:21,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 00:28:21,270 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:21,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:28:21,272 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 00:28:21,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:21,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:21,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:21,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:28:21,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1536303008, now seen corresponding path program 1 times [2022-12-06 00:28:21,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:21,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023285562] [2022-12-06 00:28:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:21,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023285562] [2022-12-06 00:28:21,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023285562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:21,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789593248] [2022-12-06 00:28:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:21,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:21,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:21,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:21,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 00:28:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:21,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:28:21,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:21,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:21,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789593248] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:21,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:28:21,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-06 00:28:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826160738] [2022-12-06 00:28:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:21,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:21,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:21,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:21,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 00:28:21,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:21,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:21,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 00:28:21,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:21,633 INFO L130 PetriNetUnfolder]: 59/109 cut-off events. [2022-12-06 00:28:21,633 INFO L131 PetriNetUnfolder]: For 168/174 co-relation queries the response was YES. [2022-12-06 00:28:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 109 events. 59/109 cut-off events. For 168/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 299 event pairs, 10 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 203. Up to 76 conditions per place. [2022-12-06 00:28:21,635 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 22 selfloop transitions, 2 changer transitions 2/27 dead transitions. [2022-12-06 00:28:21,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-06 00:28:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 00:28:21,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 00:28:21,643 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-06 00:28:21,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-06 00:28:21,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 27 transitions, 135 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:21,647 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-06 00:28:21,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-06 00:28:21,648 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 00:28:21,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:21,648 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-06 00:28:21,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:21,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:21,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-06 00:28:21,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-06 00:28:21,654 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-06 00:28:21,654 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 00:28:21,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 27 events. 7/27 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-06 00:28:21,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-06 00:28:21,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 00:28:21,656 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:21,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 00:28:21,659 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-06 00:28:21,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:21,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:21,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:21,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:21,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:21,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -774279310, now seen corresponding path program 1 times [2022-12-06 00:28:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:21,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567967776] [2022-12-06 00:28:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:21,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567967776] [2022-12-06 00:28:21,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567967776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:21,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:21,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374092093] [2022-12-06 00:28:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:21,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:21,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:21,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 00:28:21,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:21,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:21,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 00:28:21,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:22,068 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-06 00:28:22,068 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 00:28:22,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 119 events. 61/119 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 308 event pairs, 20 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 125. Up to 76 conditions per place. [2022-12-06 00:28:22,069 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-06 00:28:22,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 184 flow [2022-12-06 00:28:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 00:28:22,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 00:28:22,072 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-06 00:28:22,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 35 transitions, 184 flow [2022-12-06 00:28:22,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 35 transitions, 169 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:22,076 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:22,076 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-06 00:28:22,077 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 00:28:22,077 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:22,077 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:22,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:22,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:22,078 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:22,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:22,084 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-06 00:28:22,084 INFO L131 PetriNetUnfolder]: For 5/7 co-relation queries the response was YES. [2022-12-06 00:28:22,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 31 events. 6/31 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 39. Up to 9 conditions per place. [2022-12-06 00:28:22,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:22,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 00:28:22,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:22,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:28:22,286 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-06 00:28:22,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,287 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:22,287 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:22,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:28:22,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:22,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1396315567, now seen corresponding path program 1 times [2022-12-06 00:28:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:22,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364741247] [2022-12-06 00:28:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:22,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364741247] [2022-12-06 00:28:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364741247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:22,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:28:22,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689127068] [2022-12-06 00:28:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:22,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:22,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:28:22,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:22,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:28:22,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:22,416 INFO L130 PetriNetUnfolder]: 44/84 cut-off events. [2022-12-06 00:28:22,416 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 00:28:22,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 84 events. 44/84 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 179 event pairs, 11 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 165. Up to 68 conditions per place. [2022-12-06 00:28:22,417 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 3/25 dead transitions. [2022-12-06 00:28:22,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 143 flow [2022-12-06 00:28:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 00:28:22,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 00:28:22,418 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 26 transitions. [2022-12-06 00:28:22,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 143 flow [2022-12-06 00:28:22,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 126 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:22,420 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-06 00:28:22,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2022-12-06 00:28:22,420 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 00:28:22,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:22,421 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-06 00:28:22,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:22,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:22,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-06 00:28:22,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-06 00:28:22,425 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-06 00:28:22,425 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:28:22,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 6/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 9 conditions per place. [2022-12-06 00:28:22,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-06 00:28:22,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 00:28:22,426 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:22,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 00:28:22,427 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-06 00:28:22,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:22,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:22,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:28:22,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1385749717, now seen corresponding path program 1 times [2022-12-06 00:28:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:22,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929198044] [2022-12-06 00:28:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:22,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:22,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929198044] [2022-12-06 00:28:22,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929198044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:22,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:22,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709367238] [2022-12-06 00:28:22,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:22,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:22,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:28:22,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:22,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:28:22,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:22,565 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-06 00:28:22,565 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 00:28:22,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 119 events. 61/119 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 316 event pairs, 16 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 265. Up to 76 conditions per place. [2022-12-06 00:28:22,566 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-06 00:28:22,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 176 flow [2022-12-06 00:28:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 00:28:22,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-06 00:28:22,567 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-06 00:28:22,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 176 flow [2022-12-06 00:28:22,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:22,568 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 87 flow [2022-12-06 00:28:22,568 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 00:28:22,569 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 00:28:22,569 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:22,569 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 87 flow [2022-12-06 00:28:22,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:22,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:22,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-06 00:28:22,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 87 flow [2022-12-06 00:28:22,574 INFO L130 PetriNetUnfolder]: 8/37 cut-off events. [2022-12-06 00:28:22,574 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 00:28:22,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 37 events. 8/37 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 53. Up to 13 conditions per place. [2022-12-06 00:28:22,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 87 flow [2022-12-06 00:28:22,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 00:28:22,575 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:22,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 00:28:22,576 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 87 flow [2022-12-06 00:28:22,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:22,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:22,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:28:22,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:22,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1328554519, now seen corresponding path program 2 times [2022-12-06 00:28:22,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:22,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908591498] [2022-12-06 00:28:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:22,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:22,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908591498] [2022-12-06 00:28:22,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908591498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:22,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:22,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923058617] [2022-12-06 00:28:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:22,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:22,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:28:22,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:22,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:28:22,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:22,720 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-06 00:28:22,720 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-06 00:28:22,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 94 events. 52/94 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 148. Up to 76 conditions per place. [2022-12-06 00:28:22,721 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2022-12-06 00:28:22,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 154 flow [2022-12-06 00:28:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 00:28:22,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 00:28:22,723 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 87 flow. Second operand 3 states and 27 transitions. [2022-12-06 00:28:22,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 154 flow [2022-12-06 00:28:22,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 141 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:22,725 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 78 flow [2022-12-06 00:28:22,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-06 00:28:22,727 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 00:28:22,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:22,727 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 00:28:22,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:22,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:22,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 00:28:22,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 78 flow [2022-12-06 00:28:22,733 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-06 00:28:22,733 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 00:28:22,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 29 events. 8/29 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-06 00:28:22,733 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 78 flow [2022-12-06 00:28:22,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 00:28:22,741 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:22,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:28:22,744 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 78 flow [2022-12-06 00:28:22,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:22,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:22,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:28:22,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2064777642, now seen corresponding path program 1 times [2022-12-06 00:28:22,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:22,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185856470] [2022-12-06 00:28:22,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:22,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:23,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:23,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185856470] [2022-12-06 00:28:23,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185856470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:23,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303212277] [2022-12-06 00:28:23,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:23,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:23,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:23,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:23,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:28:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:28:23,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:23,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 00:28:23,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:23,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:23,458 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-06 00:28:23,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 35 [2022-12-06 00:28:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:23,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:23,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4))))) (or (<= c_~size~0 .cse0) (< .cse0 0) (< ~x1~0 0) (<= c_~size~0 ~x1~0) (= (select .cse1 (+ c_~f~0.offset (* .cse0 4))) (select .cse1 (+ (* ~x1~0 4) c_~f~0.offset))))))) is different from false [2022-12-06 00:28:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:24,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303212277] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:24,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:24,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 00:28:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068622072] [2022-12-06 00:28:24,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:24,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:28:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:28:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=141, Unknown=2, NotChecked=24, Total=210 [2022-12-06 00:28:24,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:28:24,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 78 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:24,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:24,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:28:24,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:24,681 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2022-12-06 00:28:24,681 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 00:28:24,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 218 events. 121/218 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 682 event pairs, 14 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 110. Up to 105 conditions per place. [2022-12-06 00:28:24,682 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 20 selfloop transitions, 4 changer transitions 37/61 dead transitions. [2022-12-06 00:28:24,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 61 transitions, 343 flow [2022-12-06 00:28:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:28:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:28:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-06 00:28:24,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-06 00:28:24,684 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 78 flow. Second operand 9 states and 60 transitions. [2022-12-06 00:28:24,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 61 transitions, 343 flow [2022-12-06 00:28:24,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 61 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:24,685 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 100 flow [2022-12-06 00:28:24,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-06 00:28:24,686 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 00:28:24,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:24,686 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 100 flow [2022-12-06 00:28:24,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:24,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:24,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 100 flow [2022-12-06 00:28:24,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 100 flow [2022-12-06 00:28:24,691 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-06 00:28:24,691 INFO L131 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2022-12-06 00:28:24,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 30 events. 8/30 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 71. Up to 13 conditions per place. [2022-12-06 00:28:24,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 100 flow [2022-12-06 00:28:24,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 00:28:25,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:25,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 998 [2022-12-06 00:28:25,684 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 96 flow [2022-12-06 00:28:25,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:25,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:25,685 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:25,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:25,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-06 00:28:25,890 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:25,891 INFO L85 PathProgramCache]: Analyzing trace with hash -380380717, now seen corresponding path program 1 times [2022-12-06 00:28:25,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:25,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737818314] [2022-12-06 00:28:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:25,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:26,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737818314] [2022-12-06 00:28:26,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737818314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:26,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446391546] [2022-12-06 00:28:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:26,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:26,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:26,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:26,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 00:28:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:26,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 00:28:26,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:27,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:27,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 00:28:27,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-06 00:28:27,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:27,175 INFO L321 Elim1Store]: treesize reduction 10, result has 85.5 percent of original size [2022-12-06 00:28:27,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 78 [2022-12-06 00:28:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:27,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446391546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:27,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:27,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-06 00:28:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602579772] [2022-12-06 00:28:27,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:27,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:28:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:28:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:28:27,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:28:27,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 96 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:27,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:27,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:28:27,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:27,695 INFO L130 PetriNetUnfolder]: 139/255 cut-off events. [2022-12-06 00:28:27,695 INFO L131 PetriNetUnfolder]: For 275/275 co-relation queries the response was YES. [2022-12-06 00:28:27,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 255 events. 139/255 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 788 event pairs, 10 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 845. Up to 118 conditions per place. [2022-12-06 00:28:27,698 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 57 selfloop transitions, 25 changer transitions 1/83 dead transitions. [2022-12-06 00:28:27,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 83 transitions, 507 flow [2022-12-06 00:28:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:28:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:28:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 83 transitions. [2022-12-06 00:28:27,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36403508771929827 [2022-12-06 00:28:27,699 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 96 flow. Second operand 12 states and 83 transitions. [2022-12-06 00:28:27,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 83 transitions, 507 flow [2022-12-06 00:28:27,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 83 transitions, 437 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 00:28:27,702 INFO L231 Difference]: Finished difference. Result has 36 places, 44 transitions, 246 flow [2022-12-06 00:28:27,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=246, PETRI_PLACES=36, PETRI_TRANSITIONS=44} [2022-12-06 00:28:27,702 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 00:28:27,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:27,703 INFO L89 Accepts]: Start accepts. Operand has 36 places, 44 transitions, 246 flow [2022-12-06 00:28:27,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:27,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:27,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-06 00:28:27,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 44 transitions, 246 flow [2022-12-06 00:28:27,712 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2022-12-06 00:28:27,712 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-06 00:28:27,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 85 events. 24/85 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 273 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 167. Up to 36 conditions per place. [2022-12-06 00:28:27,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 44 transitions, 246 flow [2022-12-06 00:28:27,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 00:28:27,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:28:28,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 00:28:28,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [548] L82-3-->L83-3: Formula: (and (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_80|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_32|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_11|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 00:28:29,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [594] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_64| 1) (= (ite (and (<= 0 v_~x1~0_74) (< v_~x1~0_74 v_~size~0_88)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (= v_~x1~0_73 (select (select |v_#memory_int_124| v_~f~0.base_74) (+ v_~f~0.offset_74 (* v_~x1~0_74 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_64| 4294967295) 4294967296) (* 2 (mod v_~n~0_84 2147483648))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34| 0))) InVars {~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_74, ~f~0.offset=v_~f~0.offset_74} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_36|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_18|, ~size~0=v_~size~0_88, ~f~0.base=v_~f~0.base_74, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_34|, #memory_int=|v_#memory_int_124|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_73, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_44|, ~f~0.offset=v_~f~0.offset_74} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:28:29,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [612] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (ite (and (<= 0 v_~x1~0_147) (< v_~x1~0_147 v_~size~0_116)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|) (= (store |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47| (store (select |v_#memory_int_172| |v_ULTIMATE.start_main_~#t2~0#1.base_47|) |v_ULTIMATE.start_main_~#t2~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre12#1_54|)) |v_#memory_int_171|) (= (select (select |v_#memory_int_172| v_~f~0.base_104) (+ v_~f~0.offset_104 (* v_~x1~0_147 4))) v_~x1~0_146) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_128| 1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_128| 4294967295) 4294967296) (* (mod v_~n~0_115 2147483648) 2)) (= |v_ULTIMATE.start_main_#t~pre12#1_54| |v_#pthreadsForks_68|) (= |v_#pthreadsForks_67| (+ |v_#pthreadsForks_68| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_68|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, #memory_int=|v_#memory_int_172|, ~n~0=v_~n~0_115, ~x1~0=v_~x1~0_147, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|, ~f~0.offset=v_~f~0.offset_104} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_80|, ~size~0=v_~size~0_116, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, ~f~0.base=v_~f~0.base_104, ~x1~0=v_~x1~0_146, ~f~0.offset=v_~f~0.offset_104, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_54|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_62|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_43|, #pthreadsForks=|v_#pthreadsForks_67|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_57|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_128|, #memory_int=|v_#memory_int_171|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, ~n~0=v_~n~0_115, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_88|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:29,373 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [613] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_175| v_~f~0.base_106))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_106 (* v_~x2~0_116 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= (ite (and (< .cse0 v_~size~0_118) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= v_~x1~0_150 (select .cse1 (+ v_~f~0.offset_106 (* v_~x1~0_151 4)))) (= v_~x2~0_115 (select .cse1 (+ v_~f~0.offset_106 (* .cse0 4)))) (= (ite (and (< v_~x1~0_151 v_~size~0_118) (<= 0 v_~x1~0_151)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_116) (< v_~x2~0_116 v_~size~0_118)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_130| 1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_95|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_130| 4294967295) 4294967296) (* 2 (mod v_~n~0_117 2147483648))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84| 0))))) InVars {~x2~0=v_~x2~0_116, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, #memory_int=|v_#memory_int_175|, ~n~0=v_~n~0_117, ~x1~0=v_~x1~0_151, ~f~0.offset=v_~f~0.offset_106} OutVars{~x2~0=v_~x2~0_115, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_82|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, ~size~0=v_~size~0_118, ~f~0.base=v_~f~0.base_106, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_95|, ~x1~0=v_~x1~0_150, ~f~0.offset=v_~f~0.offset_106, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_84|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_130|, #memory_int=|v_#memory_int_175|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_36|, ~n~0=v_~n~0_117, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_36|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_90|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:29,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_155| v_~f~0.base_90))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_90 (* v_~x2~0_112 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_100| 1) (= (ite (and (<= 0 v_~x1~0_109) (< v_~x1~0_109 v_~size~0_102)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (< 0 (* 2 (mod v_~n~0_101 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_102)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= (ite (and (<= 0 v_~x2~0_112) (< v_~x2~0_112 v_~size~0_102)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82| 0)) (= (select .cse1 (+ v_~f~0.offset_90 (* .cse0 4))) v_~x2~0_111) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|) (= (select .cse1 (+ v_~f~0.offset_90 (* v_~x1~0_109 4))) v_~x1~0_108)))) InVars {~x2~0=v_~x2~0_112, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_101, ~x1~0=v_~x1~0_109, ~f~0.offset=v_~f~0.offset_90} OutVars{~x2~0=v_~x2~0_111, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_56|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_44|, ~size~0=v_~size~0_102, ~f~0.base=v_~f~0.base_90, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~x1~0=v_~x1~0_108, ~f~0.offset=v_~f~0.offset_90, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_82|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_100|, #memory_int=|v_#memory_int_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_54|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_34|, ~n~0=v_~n~0_101, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_34|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_64|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:32,401 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 00:28:32,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4699 [2022-12-06 00:28:32,402 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 42 transitions, 276 flow [2022-12-06 00:28:32,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:32,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:32,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:32,409 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-06 00:28:32,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:32,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1202382836, now seen corresponding path program 1 times [2022-12-06 00:28:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:32,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131048809] [2022-12-06 00:28:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:33,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131048809] [2022-12-06 00:28:33,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131048809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:33,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:33,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:28:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244230446] [2022-12-06 00:28:33,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:33,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:28:33,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:28:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:33,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 00:28:33,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 42 transitions, 276 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:33,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 00:28:33,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:33,289 INFO L130 PetriNetUnfolder]: 151/272 cut-off events. [2022-12-06 00:28:33,289 INFO L131 PetriNetUnfolder]: For 336/336 co-relation queries the response was YES. [2022-12-06 00:28:33,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 272 events. 151/272 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 885 event pairs, 42 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 634. Up to 237 conditions per place. [2022-12-06 00:28:33,291 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2022-12-06 00:28:33,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 425 flow [2022-12-06 00:28:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 00:28:33,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-06 00:28:33,292 INFO L175 Difference]: Start difference. First operand has 34 places, 42 transitions, 276 flow. Second operand 4 states and 46 transitions. [2022-12-06 00:28:33,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 425 flow [2022-12-06 00:28:33,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 349 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:33,294 INFO L231 Difference]: Finished difference. Result has 36 places, 43 transitions, 249 flow [2022-12-06 00:28:33,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=36, PETRI_TRANSITIONS=43} [2022-12-06 00:28:33,295 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-06 00:28:33,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:33,295 INFO L89 Accepts]: Start accepts. Operand has 36 places, 43 transitions, 249 flow [2022-12-06 00:28:33,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:33,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:33,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 43 transitions, 249 flow [2022-12-06 00:28:33,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 43 transitions, 249 flow [2022-12-06 00:28:33,305 INFO L130 PetriNetUnfolder]: 25/88 cut-off events. [2022-12-06 00:28:33,306 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-06 00:28:33,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 88 events. 25/88 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 184. Up to 30 conditions per place. [2022-12-06 00:28:33,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 43 transitions, 249 flow [2022-12-06 00:28:33,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 00:28:33,307 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:33,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 00:28:33,308 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 43 transitions, 249 flow [2022-12-06 00:28:33,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:33,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:33,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:28:33,308 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1205008728, now seen corresponding path program 1 times [2022-12-06 00:28:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:33,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117990524] [2022-12-06 00:28:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:33,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:33,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117990524] [2022-12-06 00:28:33,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117990524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:33,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:33,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005046825] [2022-12-06 00:28:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:33,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:28:33,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:28:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:28:33,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:28:33,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 43 transitions, 249 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:33,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:28:33,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:33,742 INFO L130 PetriNetUnfolder]: 201/355 cut-off events. [2022-12-06 00:28:33,742 INFO L131 PetriNetUnfolder]: For 241/241 co-relation queries the response was YES. [2022-12-06 00:28:33,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 355 events. 201/355 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1296 event pairs, 24 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 863. Up to 227 conditions per place. [2022-12-06 00:28:33,745 INFO L137 encePairwiseOnDemand]: 11/29 looper letters, 37 selfloop transitions, 26 changer transitions 1/64 dead transitions. [2022-12-06 00:28:33,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 64 transitions, 464 flow [2022-12-06 00:28:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 00:28:33,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35172413793103446 [2022-12-06 00:28:33,746 INFO L175 Difference]: Start difference. First operand has 35 places, 43 transitions, 249 flow. Second operand 5 states and 51 transitions. [2022-12-06 00:28:33,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 64 transitions, 464 flow [2022-12-06 00:28:33,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 442 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:33,749 INFO L231 Difference]: Finished difference. Result has 38 places, 51 transitions, 369 flow [2022-12-06 00:28:33,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=38, PETRI_TRANSITIONS=51} [2022-12-06 00:28:33,750 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 00:28:33,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:33,750 INFO L89 Accepts]: Start accepts. Operand has 38 places, 51 transitions, 369 flow [2022-12-06 00:28:33,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:33,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:33,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 51 transitions, 369 flow [2022-12-06 00:28:33,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 51 transitions, 369 flow [2022-12-06 00:28:33,763 INFO L130 PetriNetUnfolder]: 30/103 cut-off events. [2022-12-06 00:28:33,763 INFO L131 PetriNetUnfolder]: For 99/104 co-relation queries the response was YES. [2022-12-06 00:28:33,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 103 events. 30/103 cut-off events. For 99/104 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 0 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 226. Up to 36 conditions per place. [2022-12-06 00:28:33,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 51 transitions, 369 flow [2022-12-06 00:28:33,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 00:28:33,765 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:33,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 00:28:33,766 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 51 transitions, 369 flow [2022-12-06 00:28:33,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:33,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:33,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:28:33,767 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -7334795, now seen corresponding path program 1 times [2022-12-06 00:28:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:33,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096547598] [2022-12-06 00:28:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096547598] [2022-12-06 00:28:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096547598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:33,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:33,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:28:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361848670] [2022-12-06 00:28:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:33,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:33,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:33,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:33,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:28:33,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 51 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:33,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:28:33,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:33,931 INFO L130 PetriNetUnfolder]: 212/374 cut-off events. [2022-12-06 00:28:33,931 INFO L131 PetriNetUnfolder]: For 629/629 co-relation queries the response was YES. [2022-12-06 00:28:33,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 374 events. 212/374 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1381 event pairs, 91 based on Foata normal form. 8/365 useless extension candidates. Maximal degree in co-relation 909. Up to 345 conditions per place. [2022-12-06 00:28:33,934 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 53 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2022-12-06 00:28:33,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 520 flow [2022-12-06 00:28:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 00:28:33,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2022-12-06 00:28:33,935 INFO L175 Difference]: Start difference. First operand has 38 places, 51 transitions, 369 flow. Second operand 3 states and 37 transitions. [2022-12-06 00:28:33,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 520 flow [2022-12-06 00:28:33,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 506 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:33,939 INFO L231 Difference]: Finished difference. Result has 40 places, 52 transitions, 384 flow [2022-12-06 00:28:33,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=40, PETRI_TRANSITIONS=52} [2022-12-06 00:28:33,941 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 00:28:33,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:33,941 INFO L89 Accepts]: Start accepts. Operand has 40 places, 52 transitions, 384 flow [2022-12-06 00:28:33,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:33,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:33,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 52 transitions, 384 flow [2022-12-06 00:28:33,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 52 transitions, 384 flow [2022-12-06 00:28:33,955 INFO L130 PetriNetUnfolder]: 33/113 cut-off events. [2022-12-06 00:28:33,955 INFO L131 PetriNetUnfolder]: For 106/110 co-relation queries the response was YES. [2022-12-06 00:28:33,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 113 events. 33/113 cut-off events. For 106/110 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 462 event pairs, 0 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 278. Up to 42 conditions per place. [2022-12-06 00:28:33,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 52 transitions, 384 flow [2022-12-06 00:28:33,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 00:28:33,957 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:33,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:28:33,958 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 52 transitions, 384 flow [2022-12-06 00:28:33,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:33,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:33,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:28:33,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1927888959, now seen corresponding path program 1 times [2022-12-06 00:28:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:33,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985833398] [2022-12-06 00:28:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:34,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:34,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985833398] [2022-12-06 00:28:34,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985833398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:34,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:34,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23518523] [2022-12-06 00:28:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:34,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:34,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:34,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:28:34,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 52 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:34,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:34,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:28:34,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:34,167 INFO L130 PetriNetUnfolder]: 206/368 cut-off events. [2022-12-06 00:28:34,168 INFO L131 PetriNetUnfolder]: For 755/755 co-relation queries the response was YES. [2022-12-06 00:28:34,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 368 events. 206/368 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1366 event pairs, 87 based on Foata normal form. 6/357 useless extension candidates. Maximal degree in co-relation 1207. Up to 346 conditions per place. [2022-12-06 00:28:34,170 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 49 selfloop transitions, 4 changer transitions 8/61 dead transitions. [2022-12-06 00:28:34,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 534 flow [2022-12-06 00:28:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 00:28:34,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 00:28:34,171 INFO L175 Difference]: Start difference. First operand has 40 places, 52 transitions, 384 flow. Second operand 4 states and 42 transitions. [2022-12-06 00:28:34,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 534 flow [2022-12-06 00:28:34,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 525 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:34,176 INFO L231 Difference]: Finished difference. Result has 43 places, 52 transitions, 391 flow [2022-12-06 00:28:34,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=43, PETRI_TRANSITIONS=52} [2022-12-06 00:28:34,177 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 00:28:34,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:34,177 INFO L89 Accepts]: Start accepts. Operand has 43 places, 52 transitions, 391 flow [2022-12-06 00:28:34,178 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:34,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:34,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 52 transitions, 391 flow [2022-12-06 00:28:34,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 52 transitions, 391 flow [2022-12-06 00:28:34,191 INFO L130 PetriNetUnfolder]: 39/126 cut-off events. [2022-12-06 00:28:34,192 INFO L131 PetriNetUnfolder]: For 141/145 co-relation queries the response was YES. [2022-12-06 00:28:34,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 126 events. 39/126 cut-off events. For 141/145 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 512 event pairs, 6 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 375. Up to 42 conditions per place. [2022-12-06 00:28:34,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 52 transitions, 391 flow [2022-12-06 00:28:34,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 00:28:34,193 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:34,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:28:34,194 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 52 transitions, 391 flow [2022-12-06 00:28:34,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:34,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:34,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:34,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:28:34,195 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1573840658, now seen corresponding path program 1 times [2022-12-06 00:28:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:34,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086339085] [2022-12-06 00:28:34,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086339085] [2022-12-06 00:28:34,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086339085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:34,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:34,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779621797] [2022-12-06 00:28:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:34,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:28:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:34,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:28:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:28:34,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:28:34,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 52 transitions, 391 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:34,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:34,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:28:34,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:34,852 INFO L130 PetriNetUnfolder]: 221/389 cut-off events. [2022-12-06 00:28:34,852 INFO L131 PetriNetUnfolder]: For 759/759 co-relation queries the response was YES. [2022-12-06 00:28:34,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 389 events. 221/389 cut-off events. For 759/759 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1452 event pairs, 53 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1432. Up to 344 conditions per place. [2022-12-06 00:28:34,855 INFO L137 encePairwiseOnDemand]: 15/29 looper letters, 50 selfloop transitions, 17 changer transitions 1/68 dead transitions. [2022-12-06 00:28:34,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 598 flow [2022-12-06 00:28:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:34,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 00:28:34,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33793103448275863 [2022-12-06 00:28:34,856 INFO L175 Difference]: Start difference. First operand has 42 places, 52 transitions, 391 flow. Second operand 5 states and 49 transitions. [2022-12-06 00:28:34,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 598 flow [2022-12-06 00:28:34,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 574 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:34,866 INFO L231 Difference]: Finished difference. Result has 46 places, 56 transitions, 455 flow [2022-12-06 00:28:34,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=46, PETRI_TRANSITIONS=56} [2022-12-06 00:28:34,866 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 00:28:34,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:34,867 INFO L89 Accepts]: Start accepts. Operand has 46 places, 56 transitions, 455 flow [2022-12-06 00:28:34,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:34,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:34,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 56 transitions, 455 flow [2022-12-06 00:28:34,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 56 transitions, 455 flow [2022-12-06 00:28:34,882 INFO L130 PetriNetUnfolder]: 42/138 cut-off events. [2022-12-06 00:28:34,882 INFO L131 PetriNetUnfolder]: For 181/185 co-relation queries the response was YES. [2022-12-06 00:28:34,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 138 events. 42/138 cut-off events. For 181/185 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 603 event pairs, 7 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 415. Up to 44 conditions per place. [2022-12-06 00:28:34,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 56 transitions, 455 flow [2022-12-06 00:28:34,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 00:28:34,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_120| v_~f~0.base_70))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_70 (* v_~x2~0_98 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73| 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_79|) (not (= (ite (and (< v_~x2~0_98 v_~size~0_84) (<= 0 v_~x2~0_98)) 1 0) 0)) (< 0 (* 2 (mod v_~n~0_80 2147483648))) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_84)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (= (select .cse1 (+ v_~f~0.offset_70 (* .cse0 4))) v_~x2~0_97)))) InVars {~x2~0=v_~x2~0_98, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, #memory_int=|v_#memory_int_120|, ~n~0=v_~n~0_80, ~f~0.offset=v_~f~0.offset_70} OutVars{~x2~0=v_~x2~0_97, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_35|, ~size~0=v_~size~0_84, ~f~0.base=v_~f~0.base_70, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_79|, ~f~0.offset=v_~f~0.offset_70, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_73|, #memory_int=|v_#memory_int_120|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_25|, ~n~0=v_~n~0_80, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:35,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:35,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 478 [2022-12-06 00:28:35,344 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 56 transitions, 465 flow [2022-12-06 00:28:35,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:35,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:35,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:35,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:28:35,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -110380839, now seen corresponding path program 2 times [2022-12-06 00:28:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745649131] [2022-12-06 00:28:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:35,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:35,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745649131] [2022-12-06 00:28:35,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745649131] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:35,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928501519] [2022-12-06 00:28:35,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:28:35,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:35,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:35,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:35,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 00:28:35,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:28:35,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:28:35,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:28:35,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:35,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-06 00:28:35,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:35,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928501519] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:35,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:35,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 00:28:35,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625501729] [2022-12-06 00:28:35,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:35,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:28:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:28:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:28:35,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:28:35,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 56 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:35,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:35,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:28:35,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:35,772 INFO L130 PetriNetUnfolder]: 229/411 cut-off events. [2022-12-06 00:28:35,772 INFO L131 PetriNetUnfolder]: For 1062/1062 co-relation queries the response was YES. [2022-12-06 00:28:35,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 411 events. 229/411 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1599 event pairs, 91 based on Foata normal form. 6/398 useless extension candidates. Maximal degree in co-relation 1346. Up to 362 conditions per place. [2022-12-06 00:28:35,776 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 60 selfloop transitions, 8 changer transitions 2/70 dead transitions. [2022-12-06 00:28:35,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 677 flow [2022-12-06 00:28:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 00:28:35,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2022-12-06 00:28:35,777 INFO L175 Difference]: Start difference. First operand has 46 places, 56 transitions, 465 flow. Second operand 4 states and 48 transitions. [2022-12-06 00:28:35,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 677 flow [2022-12-06 00:28:35,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 661 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:35,782 INFO L231 Difference]: Finished difference. Result has 49 places, 56 transitions, 473 flow [2022-12-06 00:28:35,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=49, PETRI_TRANSITIONS=56} [2022-12-06 00:28:35,783 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 00:28:35,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:35,784 INFO L89 Accepts]: Start accepts. Operand has 49 places, 56 transitions, 473 flow [2022-12-06 00:28:35,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:35,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:35,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 56 transitions, 473 flow [2022-12-06 00:28:35,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 56 transitions, 473 flow [2022-12-06 00:28:35,799 INFO L130 PetriNetUnfolder]: 44/148 cut-off events. [2022-12-06 00:28:35,799 INFO L131 PetriNetUnfolder]: For 227/233 co-relation queries the response was YES. [2022-12-06 00:28:35,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 148 events. 44/148 cut-off events. For 227/233 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 675 event pairs, 7 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 532. Up to 47 conditions per place. [2022-12-06 00:28:35,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 56 transitions, 473 flow [2022-12-06 00:28:35,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 00:28:35,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:28:35,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:35,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 00:28:35,989 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 56 transitions, 478 flow [2022-12-06 00:28:35,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:35,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:35,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:35,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:36,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 00:28:36,190 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2131638270, now seen corresponding path program 1 times [2022-12-06 00:28:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:36,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22300780] [2022-12-06 00:28:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:36,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:36,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:36,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22300780] [2022-12-06 00:28:36,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22300780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:36,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:36,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593305075] [2022-12-06 00:28:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:36,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:28:36,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 56 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:36,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:36,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:28:36,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:36,421 INFO L130 PetriNetUnfolder]: 239/431 cut-off events. [2022-12-06 00:28:36,422 INFO L131 PetriNetUnfolder]: For 1331/1331 co-relation queries the response was YES. [2022-12-06 00:28:36,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 431 events. 239/431 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1716 event pairs, 95 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 1849. Up to 376 conditions per place. [2022-12-06 00:28:36,425 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 61 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2022-12-06 00:28:36,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 692 flow [2022-12-06 00:28:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 00:28:36,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2022-12-06 00:28:36,427 INFO L175 Difference]: Start difference. First operand has 48 places, 56 transitions, 478 flow. Second operand 4 states and 49 transitions. [2022-12-06 00:28:36,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 692 flow [2022-12-06 00:28:36,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 660 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:36,432 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 483 flow [2022-12-06 00:28:36,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2022-12-06 00:28:36,432 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 00:28:36,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:36,432 INFO L89 Accepts]: Start accepts. Operand has 49 places, 57 transitions, 483 flow [2022-12-06 00:28:36,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:36,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:36,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 57 transitions, 483 flow [2022-12-06 00:28:36,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 57 transitions, 483 flow [2022-12-06 00:28:36,468 INFO L130 PetriNetUnfolder]: 46/156 cut-off events. [2022-12-06 00:28:36,468 INFO L131 PetriNetUnfolder]: For 315/319 co-relation queries the response was YES. [2022-12-06 00:28:36,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 156 events. 46/156 cut-off events. For 315/319 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 731 event pairs, 7 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 460. Up to 47 conditions per place. [2022-12-06 00:28:36,470 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 57 transitions, 483 flow [2022-12-06 00:28:36,470 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 00:28:36,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:36,651 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:36,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:28:36,652 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 492 flow [2022-12-06 00:28:36,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:36,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:36,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:36,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:28:36,652 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2077275410, now seen corresponding path program 1 times [2022-12-06 00:28:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:36,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146304602] [2022-12-06 00:28:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:36,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:36,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146304602] [2022-12-06 00:28:36,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146304602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:36,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:36,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852889717] [2022-12-06 00:28:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:36,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:36,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:28:36,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:36,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:36,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:28:36,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:36,889 INFO L130 PetriNetUnfolder]: 267/481 cut-off events. [2022-12-06 00:28:36,889 INFO L131 PetriNetUnfolder]: For 1680/1680 co-relation queries the response was YES. [2022-12-06 00:28:36,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 481 events. 267/481 cut-off events. For 1680/1680 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1986 event pairs, 112 based on Foata normal form. 4/468 useless extension candidates. Maximal degree in co-relation 1693. Up to 440 conditions per place. [2022-12-06 00:28:36,893 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 66 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-06 00:28:36,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 736 flow [2022-12-06 00:28:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 00:28:36,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 00:28:36,894 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 492 flow. Second operand 4 states and 48 transitions. [2022-12-06 00:28:36,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 736 flow [2022-12-06 00:28:36,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 706 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:36,900 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 531 flow [2022-12-06 00:28:36,900 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2022-12-06 00:28:36,901 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2022-12-06 00:28:36,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:36,901 INFO L89 Accepts]: Start accepts. Operand has 52 places, 61 transitions, 531 flow [2022-12-06 00:28:36,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:36,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:36,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 61 transitions, 531 flow [2022-12-06 00:28:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 61 transitions, 531 flow [2022-12-06 00:28:36,920 INFO L130 PetriNetUnfolder]: 50/171 cut-off events. [2022-12-06 00:28:36,920 INFO L131 PetriNetUnfolder]: For 414/420 co-relation queries the response was YES. [2022-12-06 00:28:36,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 171 events. 50/171 cut-off events. For 414/420 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 844 event pairs, 8 based on Foata normal form. 2/160 useless extension candidates. Maximal degree in co-relation 598. Up to 53 conditions per place. [2022-12-06 00:28:36,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 61 transitions, 531 flow [2022-12-06 00:28:36,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 00:28:36,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:28:37,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:37,317 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 416 [2022-12-06 00:28:37,317 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 527 flow [2022-12-06 00:28:37,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:37,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:37,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:28:37,317 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1277806634, now seen corresponding path program 1 times [2022-12-06 00:28:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:37,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209081006] [2022-12-06 00:28:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:37,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209081006] [2022-12-06 00:28:37,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209081006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:37,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:37,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918720533] [2022-12-06 00:28:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:37,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:37,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:28:37,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:37,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:37,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:28:37,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:37,603 INFO L130 PetriNetUnfolder]: 311/562 cut-off events. [2022-12-06 00:28:37,603 INFO L131 PetriNetUnfolder]: For 2704/2704 co-relation queries the response was YES. [2022-12-06 00:28:37,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2889 conditions, 562 events. 311/562 cut-off events. For 2704/2704 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2419 event pairs, 101 based on Foata normal form. 19/562 useless extension candidates. Maximal degree in co-relation 2313. Up to 258 conditions per place. [2022-12-06 00:28:37,608 INFO L137 encePairwiseOnDemand]: 17/35 looper letters, 56 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2022-12-06 00:28:37,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 848 flow [2022-12-06 00:28:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 00:28:37,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-06 00:28:37,609 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 527 flow. Second operand 4 states and 57 transitions. [2022-12-06 00:28:37,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 848 flow [2022-12-06 00:28:37,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 81 transitions, 822 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:37,621 INFO L231 Difference]: Finished difference. Result has 54 places, 62 transitions, 611 flow [2022-12-06 00:28:37,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=611, PETRI_PLACES=54, PETRI_TRANSITIONS=62} [2022-12-06 00:28:37,621 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 00:28:37,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:37,621 INFO L89 Accepts]: Start accepts. Operand has 54 places, 62 transitions, 611 flow [2022-12-06 00:28:37,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:37,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:37,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 62 transitions, 611 flow [2022-12-06 00:28:37,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 62 transitions, 611 flow [2022-12-06 00:28:37,651 INFO L130 PetriNetUnfolder]: 57/195 cut-off events. [2022-12-06 00:28:37,651 INFO L131 PetriNetUnfolder]: For 575/588 co-relation queries the response was YES. [2022-12-06 00:28:37,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 195 events. 57/195 cut-off events. For 575/588 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1009 event pairs, 10 based on Foata normal form. 2/185 useless extension candidates. Maximal degree in co-relation 708. Up to 66 conditions per place. [2022-12-06 00:28:37,654 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 62 transitions, 611 flow [2022-12-06 00:28:37,654 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 00:28:37,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:37,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 00:28:37,656 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 62 transitions, 611 flow [2022-12-06 00:28:37,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:37,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:37,656 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:37,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:28:37,656 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash -157582306, now seen corresponding path program 1 times [2022-12-06 00:28:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:37,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695230150] [2022-12-06 00:28:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:37,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695230150] [2022-12-06 00:28:37,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695230150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:37,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:37,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:37,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370351814] [2022-12-06 00:28:37,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:37,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:37,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:37,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:37,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:37,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:28:37,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 62 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:37,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:37,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:28:37,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:37,908 INFO L130 PetriNetUnfolder]: 317/572 cut-off events. [2022-12-06 00:28:37,908 INFO L131 PetriNetUnfolder]: For 2937/2937 co-relation queries the response was YES. [2022-12-06 00:28:37,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 572 events. 317/572 cut-off events. For 2937/2937 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2452 event pairs, 148 based on Foata normal form. 4/561 useless extension candidates. Maximal degree in co-relation 2572. Up to 523 conditions per place. [2022-12-06 00:28:37,913 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 71 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2022-12-06 00:28:37,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 875 flow [2022-12-06 00:28:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 00:28:37,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 00:28:37,914 INFO L175 Difference]: Start difference. First operand has 54 places, 62 transitions, 611 flow. Second operand 4 states and 49 transitions. [2022-12-06 00:28:37,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 875 flow [2022-12-06 00:28:37,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 859 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-06 00:28:37,923 INFO L231 Difference]: Finished difference. Result has 58 places, 63 transitions, 636 flow [2022-12-06 00:28:37,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=636, PETRI_PLACES=58, PETRI_TRANSITIONS=63} [2022-12-06 00:28:37,924 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 00:28:37,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:37,924 INFO L89 Accepts]: Start accepts. Operand has 58 places, 63 transitions, 636 flow [2022-12-06 00:28:37,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:37,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:37,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 63 transitions, 636 flow [2022-12-06 00:28:37,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 63 transitions, 636 flow [2022-12-06 00:28:37,946 INFO L130 PetriNetUnfolder]: 58/197 cut-off events. [2022-12-06 00:28:37,946 INFO L131 PetriNetUnfolder]: For 760/774 co-relation queries the response was YES. [2022-12-06 00:28:37,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 197 events. 58/197 cut-off events. For 760/774 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1023 event pairs, 10 based on Foata normal form. 2/186 useless extension candidates. Maximal degree in co-relation 750. Up to 68 conditions per place. [2022-12-06 00:28:37,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 63 transitions, 636 flow [2022-12-06 00:28:37,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 00:28:37,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_203| v_~f~0.base_126))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_126 (* v_~x2~0_137 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_126 (* 4 .cse3))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_126 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= (select .cse0 (+ v_~f~0.offset_126 (* .cse1 4))) v_~x2~0_135) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_135 2147483648) 2)) (not (= 0 (ite (and (< v_~x2~0_137 v_~size~0_136) (<= 0 v_~x2~0_137)) 1 0))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (< .cse2 v_~size~0_136) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_136)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_135, ~f~0.offset=v_~f~0.offset_126} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_126, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_203|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_135, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [631] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_209| v_~f~0.base_132))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_132 (* v_~x2~0_151 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_132 (* v_~x1~0_203 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (not (= (ite (and (< v_~x1~0_203 v_~size~0_142) (<= 0 v_~x1~0_203)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_142) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= |v_thread2Thread1of1ForFork1_~i~1#1_116| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_117|)) (= v_~x2~0_150 (select .cse1 (+ (* .cse0 4) v_~f~0.offset_132))) (= |v_thread1Thread1of1ForFork0_~i~0#1_164| 2) (not (= (ite (and (<= 0 v_~x2~0_151) (< v_~x2~0_151 v_~size~0_142)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_142)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= v_~x1~0_202 (select .cse1 (+ v_~f~0.offset_132 (* .cse2 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_117| 4294967296) (* 2 (mod v_~n~0_141 2147483648)))))) InVars {~x2~0=v_~x2~0_151, ~size~0=v_~size~0_142, ~f~0.base=v_~f~0.base_132, #memory_int=|v_#memory_int_209|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_117|, ~n~0=v_~n~0_141, ~x1~0=v_~x1~0_203, ~f~0.offset=v_~f~0.offset_132} OutVars{~x2~0=v_~x2~0_150, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_112|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_142, ~f~0.base=v_~f~0.base_132, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_116|, ~x1~0=v_~x1~0_202, ~f~0.offset=v_~f~0.offset_132, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_164|, #memory_int=|v_#memory_int_209|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ~n~0=v_~n~0_141, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_53|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_120|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:38,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:38,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 497 [2022-12-06 00:28:38,421 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 63 transitions, 641 flow [2022-12-06 00:28:38,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:38,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:38,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:38,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:28:38,422 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:38,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash -616105078, now seen corresponding path program 2 times [2022-12-06 00:28:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:38,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988912335] [2022-12-06 00:28:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:38,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988912335] [2022-12-06 00:28:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988912335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:38,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:38,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:38,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248883908] [2022-12-06 00:28:38,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:38,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:38,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:38,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:38,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:38,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:28:38,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 641 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:38,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:38,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:28:38,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:38,705 INFO L130 PetriNetUnfolder]: 302/537 cut-off events. [2022-12-06 00:28:38,706 INFO L131 PetriNetUnfolder]: For 3290/3290 co-relation queries the response was YES. [2022-12-06 00:28:38,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 537 events. 302/537 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2218 event pairs, 142 based on Foata normal form. 6/528 useless extension candidates. Maximal degree in co-relation 2351. Up to 512 conditions per place. [2022-12-06 00:28:38,710 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 57 selfloop transitions, 7 changer transitions 8/72 dead transitions. [2022-12-06 00:28:38,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 837 flow [2022-12-06 00:28:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 00:28:38,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-06 00:28:38,711 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 641 flow. Second operand 4 states and 48 transitions. [2022-12-06 00:28:38,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 837 flow [2022-12-06 00:28:38,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 801 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:38,718 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 630 flow [2022-12-06 00:28:38,718 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=630, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2022-12-06 00:28:38,718 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 39 predicate places. [2022-12-06 00:28:38,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:38,719 INFO L89 Accepts]: Start accepts. Operand has 60 places, 63 transitions, 630 flow [2022-12-06 00:28:38,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:38,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:38,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 630 flow [2022-12-06 00:28:38,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 630 flow [2022-12-06 00:28:38,738 INFO L130 PetriNetUnfolder]: 55/176 cut-off events. [2022-12-06 00:28:38,739 INFO L131 PetriNetUnfolder]: For 786/815 co-relation queries the response was YES. [2022-12-06 00:28:38,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 176 events. 55/176 cut-off events. For 786/815 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 850 event pairs, 9 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 726. Up to 65 conditions per place. [2022-12-06 00:28:38,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 630 flow [2022-12-06 00:28:38,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 00:28:38,741 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:38,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:28:38,742 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 630 flow [2022-12-06 00:28:38,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:38,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:38,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:38,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:28:38,743 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:38,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:38,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1235189396, now seen corresponding path program 1 times [2022-12-06 00:28:38,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:38,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004870778] [2022-12-06 00:28:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:38,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004870778] [2022-12-06 00:28:38,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004870778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:38,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298374146] [2022-12-06 00:28:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:38,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:38,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:38,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:38,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 00:28:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:39,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 00:28:39,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:39,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:39,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:28:39,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:39,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2022-12-06 00:28:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:39,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:39,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:39,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2022-12-06 00:28:39,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:39,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 52 [2022-12-06 00:28:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:39,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298374146] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:39,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:39,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 00:28:39,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392622926] [2022-12-06 00:28:39,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:39,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:28:39,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:39,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:28:39,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:28:39,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:28:39,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 630 flow. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:39,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:39,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:28:39,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:39,663 INFO L130 PetriNetUnfolder]: 364/645 cut-off events. [2022-12-06 00:28:39,664 INFO L131 PetriNetUnfolder]: For 3708/3708 co-relation queries the response was YES. [2022-12-06 00:28:39,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 645 events. 364/645 cut-off events. For 3708/3708 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2814 event pairs, 43 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 3236. Up to 370 conditions per place. [2022-12-06 00:28:39,669 INFO L137 encePairwiseOnDemand]: 12/35 looper letters, 63 selfloop transitions, 47 changer transitions 1/111 dead transitions. [2022-12-06 00:28:39,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 1205 flow [2022-12-06 00:28:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:28:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:28:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2022-12-06 00:28:39,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27936507936507937 [2022-12-06 00:28:39,670 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 630 flow. Second operand 9 states and 88 transitions. [2022-12-06 00:28:39,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 1205 flow [2022-12-06 00:28:39,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 1149 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:39,680 INFO L231 Difference]: Finished difference. Result has 67 places, 78 transitions, 923 flow [2022-12-06 00:28:39,680 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=923, PETRI_PLACES=67, PETRI_TRANSITIONS=78} [2022-12-06 00:28:39,681 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 46 predicate places. [2022-12-06 00:28:39,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:39,681 INFO L89 Accepts]: Start accepts. Operand has 67 places, 78 transitions, 923 flow [2022-12-06 00:28:39,681 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:39,681 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:39,681 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 78 transitions, 923 flow [2022-12-06 00:28:39,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 78 transitions, 923 flow [2022-12-06 00:28:39,713 INFO L130 PetriNetUnfolder]: 64/214 cut-off events. [2022-12-06 00:28:39,713 INFO L131 PetriNetUnfolder]: For 935/964 co-relation queries the response was YES. [2022-12-06 00:28:39,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 214 events. 64/214 cut-off events. For 935/964 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1132 event pairs, 11 based on Foata normal form. 3/204 useless extension candidates. Maximal degree in co-relation 945. Up to 75 conditions per place. [2022-12-06 00:28:39,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 78 transitions, 923 flow [2022-12-06 00:28:39,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-06 00:28:39,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [603] $Ultimate##0-->L83-3: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_106| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (= (ite (and (<= 0 v_~x1~0_119) (< v_~x1~0_119 v_~size~0_106)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_52| |v_#pthreadsForks_64|) (= (store |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45| (store (select |v_#memory_int_160| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) |v_ULTIMATE.start_main_~#t2~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre12#1_52|)) |v_#memory_int_159|) (= v_~x1~0_118 (select (select |v_#memory_int_160| v_~f~0.base_94) (+ v_~f~0.offset_94 (* v_~x1~0_119 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_106| 4294967295) 4294967296) (* 2 (mod v_~n~0_105 2147483648))) (= (+ |v_#pthreadsForks_64| 1) |v_#pthreadsForks_63|)) InVars {#pthreadsForks=|v_#pthreadsForks_64|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, #memory_int=|v_#memory_int_160|, ~n~0=v_~n~0_105, ~x1~0=v_~x1~0_119, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ~f~0.offset=v_~f~0.offset_94} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, ~size~0=v_~size~0_106, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ~f~0.base=v_~f~0.base_94, ~x1~0=v_~x1~0_118, ~f~0.offset=v_~f~0.offset_94, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_52|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_41|, #pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_55|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_106|, #memory_int=|v_#memory_int_159|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, ~n~0=v_~n~0_105, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:39,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:28:40,039 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:28:40,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 359 [2022-12-06 00:28:40,040 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 78 transitions, 943 flow [2022-12-06 00:28:40,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:40,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:40,040 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:40,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:40,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-06 00:28:40,244 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash -49574454, now seen corresponding path program 2 times [2022-12-06 00:28:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:40,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138207504] [2022-12-06 00:28:40,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:40,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138207504] [2022-12-06 00:28:40,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138207504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:40,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322004532] [2022-12-06 00:28:40,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:28:40,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:40,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:40,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:40,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 00:28:40,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:28:40,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:28:40,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-06 00:28:40,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:40,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:40,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:28:40,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:41,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:41,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:28:41,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:41,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 26 [2022-12-06 00:28:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:41,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:41,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322004532] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:41,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:41,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:28:41,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325261268] [2022-12-06 00:28:41,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:41,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:28:41,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:28:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:28:41,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:28:41,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 78 transitions, 943 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:41,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:41,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:28:41,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:41,692 INFO L130 PetriNetUnfolder]: 446/793 cut-off events. [2022-12-06 00:28:41,692 INFO L131 PetriNetUnfolder]: For 5201/5201 co-relation queries the response was YES. [2022-12-06 00:28:41,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4631 conditions, 793 events. 446/793 cut-off events. For 5201/5201 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3695 event pairs, 120 based on Foata normal form. 1/785 useless extension candidates. Maximal degree in co-relation 4248. Up to 641 conditions per place. [2022-12-06 00:28:41,698 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 90 selfloop transitions, 37 changer transitions 1/128 dead transitions. [2022-12-06 00:28:41,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 1582 flow [2022-12-06 00:28:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:28:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:28:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-12-06 00:28:41,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23783783783783785 [2022-12-06 00:28:41,699 INFO L175 Difference]: Start difference. First operand has 67 places, 78 transitions, 943 flow. Second operand 10 states and 88 transitions. [2022-12-06 00:28:41,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 1582 flow [2022-12-06 00:28:41,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 128 transitions, 1479 flow, removed 35 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:41,714 INFO L231 Difference]: Finished difference. Result has 78 places, 97 transitions, 1215 flow [2022-12-06 00:28:41,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1215, PETRI_PLACES=78, PETRI_TRANSITIONS=97} [2022-12-06 00:28:41,714 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 57 predicate places. [2022-12-06 00:28:41,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:41,714 INFO L89 Accepts]: Start accepts. Operand has 78 places, 97 transitions, 1215 flow [2022-12-06 00:28:41,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:41,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:41,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 97 transitions, 1215 flow [2022-12-06 00:28:41,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 97 transitions, 1215 flow [2022-12-06 00:28:41,744 INFO L130 PetriNetUnfolder]: 78/264 cut-off events. [2022-12-06 00:28:41,744 INFO L131 PetriNetUnfolder]: For 1178/1217 co-relation queries the response was YES. [2022-12-06 00:28:41,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 264 events. 78/264 cut-off events. For 1178/1217 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1520 event pairs, 14 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 1209. Up to 93 conditions per place. [2022-12-06 00:28:41,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 97 transitions, 1215 flow [2022-12-06 00:28:41,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 00:28:42,058 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_203| v_~f~0.base_126))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_126 (* v_~x2~0_137 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_126 (* 4 .cse3))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_126 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| 0)) (= (select .cse0 (+ v_~f~0.offset_126 (* .cse1 4))) v_~x2~0_135) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_103|) 4294967296) (* (mod v_~n~0_135 2147483648) 2)) (not (= 0 (ite (and (< v_~x2~0_137 v_~size~0_136) (<= 0 v_~x2~0_137)) 1 0))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_136)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (< .cse2 v_~size~0_136) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_103| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_136)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_137, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, #memory_int=|v_#memory_int_203|, ~n~0=v_~n~0_135, ~f~0.offset=v_~f~0.offset_126} OutVars{~x2~0=v_~x2~0_135, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_54|, ~size~0=v_~size~0_136, ~f~0.base=v_~f~0.base_126, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_58|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_68|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_103|, ~f~0.offset=v_~f~0.offset_126, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_92|, #memory_int=|v_#memory_int_203|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_44|, ~n~0=v_~n~0_135, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_44|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [633] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_211| v_~f~0.base_134))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_134 (* v_~x1~0_208 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_134 (* .cse2 4))))) (and (= v_~x1~0_206 (select .cse0 (+ v_~f~0.offset_134 (* 4 .cse1)))) (not (= (ite (and (<= 0 v_~x1~0_208) (< v_~x1~0_208 v_~size~0_144)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_166| 3) (< 2 (* (mod v_~n~0_143 2147483648) 2)) (= (ite (and (< .cse1 v_~size~0_144) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_144)) 1 0) 0)))))) InVars {~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_134, #memory_int=|v_#memory_int_211|, ~n~0=v_~n~0_143, ~x1~0=v_~x1~0_208, ~f~0.offset=v_~f~0.offset_134} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_96|, ~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_134, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_112|, #memory_int=|v_#memory_int_211|, ~n~0=v_~n~0_143, ~x1~0=v_~x1~0_206, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_122|, ~f~0.offset=v_~f~0.offset_134} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:42,384 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [635] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_213| v_~f~0.base_136))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_136 (* v_~x2~0_156 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_136 (* 4 .cse6))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_136 (* .cse2 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_136 (* 4 .cse5))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_136 (* v_~x1~0_213 4)))) (.cse4 (select .cse0 (+ v_~f~0.offset_136 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (not (= (ite (and (<= 0 v_~x2~0_156) (< v_~x2~0_156 v_~size~0_146)) 1 0) 0)) (= v_~x1~0_212 (select .cse0 (+ v_~f~0.offset_136 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x1~0_213) (< v_~x1~0_213 v_~size~0_146)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_146)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_170| 2) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_120|) 4294967296) (* 2 (mod v_~n~0_145 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_146) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_146)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_136 (* .cse4 4))) v_~x2~0_154) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_146)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= 0 (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_146)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_120|) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_146)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116| 0))))))))) InVars {~x2~0=v_~x2~0_156, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_136, #memory_int=|v_#memory_int_213|, ~n~0=v_~n~0_145, ~x1~0=v_~x1~0_213, ~f~0.offset=v_~f~0.offset_136} OutVars{~x2~0=v_~x2~0_154, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_118|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_146, ~f~0.base=v_~f~0.base_136, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_120|, ~x1~0=v_~x1~0_212, ~f~0.offset=v_~f~0.offset_136, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_170|, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_55|, ~n~0=v_~n~0_145, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_55|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_126|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:42,898 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:28:42,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1185 [2022-12-06 00:28:42,899 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 97 transitions, 1239 flow [2022-12-06 00:28:42,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:42,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:42,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:42,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 00:28:43,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:43,107 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -712213236, now seen corresponding path program 1 times [2022-12-06 00:28:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:43,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164458021] [2022-12-06 00:28:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:43,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164458021] [2022-12-06 00:28:43,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164458021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:43,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:43,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:43,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115376450] [2022-12-06 00:28:43,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:43,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:28:43,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:43,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:28:43,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:28:43,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:28:43,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 97 transitions, 1239 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:43,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:43,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:28:43,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:43,899 INFO L130 PetriNetUnfolder]: 508/902 cut-off events. [2022-12-06 00:28:43,899 INFO L131 PetriNetUnfolder]: For 6414/6414 co-relation queries the response was YES. [2022-12-06 00:28:43,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5382 conditions, 902 events. 508/902 cut-off events. For 6414/6414 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4362 event pairs, 129 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 4721. Up to 770 conditions per place. [2022-12-06 00:28:43,906 INFO L137 encePairwiseOnDemand]: 13/39 looper letters, 84 selfloop transitions, 36 changer transitions 2/122 dead transitions. [2022-12-06 00:28:43,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 1708 flow [2022-12-06 00:28:43,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 00:28:43,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3282051282051282 [2022-12-06 00:28:43,908 INFO L175 Difference]: Start difference. First operand has 78 places, 97 transitions, 1239 flow. Second operand 5 states and 64 transitions. [2022-12-06 00:28:43,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 1708 flow [2022-12-06 00:28:43,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 1576 flow, removed 60 selfloop flow, removed 1 redundant places. [2022-12-06 00:28:43,925 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1377 flow [2022-12-06 00:28:43,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1377, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2022-12-06 00:28:43,926 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 00:28:43,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:43,926 INFO L89 Accepts]: Start accepts. Operand has 83 places, 106 transitions, 1377 flow [2022-12-06 00:28:43,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:43,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:43,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 106 transitions, 1377 flow [2022-12-06 00:28:43,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 106 transitions, 1377 flow [2022-12-06 00:28:43,964 INFO L130 PetriNetUnfolder]: 87/297 cut-off events. [2022-12-06 00:28:43,964 INFO L131 PetriNetUnfolder]: For 1543/1592 co-relation queries the response was YES. [2022-12-06 00:28:43,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1521 conditions, 297 events. 87/297 cut-off events. For 1543/1592 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1803 event pairs, 17 based on Foata normal form. 4/281 useless extension candidates. Maximal degree in co-relation 1454. Up to 81 conditions per place. [2022-12-06 00:28:43,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 106 transitions, 1377 flow [2022-12-06 00:28:43,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 00:28:43,970 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:43,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 00:28:43,970 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 1377 flow [2022-12-06 00:28:43,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:43,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:43,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 00:28:43,972 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash 2049019939, now seen corresponding path program 1 times [2022-12-06 00:28:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:43,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294120071] [2022-12-06 00:28:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:45,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294120071] [2022-12-06 00:28:45,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294120071] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:45,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342006098] [2022-12-06 00:28:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:45,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:45,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 00:28:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:45,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 00:28:45,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:46,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:46,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 00:28:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:46,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:46,391 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 00:28:46,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 00:28:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:47,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342006098] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:47,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:47,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 00:28:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666069433] [2022-12-06 00:28:47,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:47,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:28:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:28:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:28:47,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:28:47,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 1377 flow. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:47,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:47,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:28:47,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:47,809 INFO L130 PetriNetUnfolder]: 566/1003 cut-off events. [2022-12-06 00:28:47,809 INFO L131 PetriNetUnfolder]: For 7741/7741 co-relation queries the response was YES. [2022-12-06 00:28:47,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 1003 events. 566/1003 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4974 event pairs, 193 based on Foata normal form. 2/997 useless extension candidates. Maximal degree in co-relation 5769. Up to 872 conditions per place. [2022-12-06 00:28:47,818 INFO L137 encePairwiseOnDemand]: 15/38 looper letters, 92 selfloop transitions, 39 changer transitions 1/132 dead transitions. [2022-12-06 00:28:47,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 132 transitions, 1862 flow [2022-12-06 00:28:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:28:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:28:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-06 00:28:47,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22932330827067668 [2022-12-06 00:28:47,819 INFO L175 Difference]: Start difference. First operand has 82 places, 106 transitions, 1377 flow. Second operand 7 states and 61 transitions. [2022-12-06 00:28:47,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 132 transitions, 1862 flow [2022-12-06 00:28:47,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 132 transitions, 1831 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:47,840 INFO L231 Difference]: Finished difference. Result has 88 places, 118 transitions, 1649 flow [2022-12-06 00:28:47,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1649, PETRI_PLACES=88, PETRI_TRANSITIONS=118} [2022-12-06 00:28:47,841 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 67 predicate places. [2022-12-06 00:28:47,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:47,841 INFO L89 Accepts]: Start accepts. Operand has 88 places, 118 transitions, 1649 flow [2022-12-06 00:28:47,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:47,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:47,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 118 transitions, 1649 flow [2022-12-06 00:28:47,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 118 transitions, 1649 flow [2022-12-06 00:28:47,877 INFO L130 PetriNetUnfolder]: 95/327 cut-off events. [2022-12-06 00:28:47,877 INFO L131 PetriNetUnfolder]: For 1882/1944 co-relation queries the response was YES. [2022-12-06 00:28:47,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 327 events. 95/327 cut-off events. For 1882/1944 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2076 event pairs, 20 based on Foata normal form. 4/308 useless extension candidates. Maximal degree in co-relation 1561. Up to 92 conditions per place. [2022-12-06 00:28:47,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 118 transitions, 1649 flow [2022-12-06 00:28:47,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 00:28:47,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_228| v_~f~0.base_144))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_144 (* v_~x2~0_175 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_144 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_144 (* v_~x1~0_235 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_144 (* .cse5 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_144 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|) (= |v_thread2Thread1of1ForFork1_~i~1#1_136| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (not (= (ite (and (< v_~x1~0_235 v_~size~0_154) (<= 0 v_~x1~0_235)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_175 v_~size~0_154) (<= 0 v_~x2~0_175)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse1 4))) v_~x2~0_174) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130| 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_154) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< .cse3 v_~size~0_154) (<= 0 .cse3)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_144 (* .cse4 4))) v_~x1~0_234) (= |v_thread1Thread1of1ForFork0_~i~0#1_186| 3) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_154)) 1 0) 0)) (= (ite (and (< .cse4 v_~size~0_154) (<= 0 .cse4)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_154)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (< 2 (* (mod v_~n~0_153 2147483648) 2))))))) InVars {~x2~0=v_~x2~0_175, ~size~0=v_~size~0_154, ~f~0.base=v_~f~0.base_144, #memory_int=|v_#memory_int_228|, ~n~0=v_~n~0_153, ~x1~0=v_~x1~0_235, ~f~0.offset=v_~f~0.offset_144} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_132|, ~x2~0=v_~x2~0_174, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_79|, ~size~0=v_~size~0_154, ~f~0.base=v_~f~0.base_144, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_136|, ~x1~0=v_~x1~0_234, ~f~0.offset=v_~f~0.offset_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_114|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_186|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_130|, #memory_int=|v_#memory_int_228|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_69|, ~n~0=v_~n~0_153, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_140|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_69|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:28:49,776 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:28:49,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1936 [2022-12-06 00:28:49,777 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 118 transitions, 1673 flow [2022-12-06 00:28:49,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:49,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:49,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:49,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:49,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:49,982 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1451375644, now seen corresponding path program 1 times [2022-12-06 00:28:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:49,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969713857] [2022-12-06 00:28:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969713857] [2022-12-06 00:28:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969713857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:50,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:50,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:28:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160432778] [2022-12-06 00:28:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:50,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:28:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:28:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:50,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:28:50,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 118 transitions, 1673 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:50,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:50,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:28:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:50,414 INFO L130 PetriNetUnfolder]: 698/1241 cut-off events. [2022-12-06 00:28:50,414 INFO L131 PetriNetUnfolder]: For 10311/10311 co-relation queries the response was YES. [2022-12-06 00:28:50,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 1241 events. 698/1241 cut-off events. For 10311/10311 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6466 event pairs, 310 based on Foata normal form. 8/1241 useless extension candidates. Maximal degree in co-relation 7072. Up to 960 conditions per place. [2022-12-06 00:28:50,434 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 142 selfloop transitions, 14 changer transitions 0/156 dead transitions. [2022-12-06 00:28:50,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 156 transitions, 2422 flow [2022-12-06 00:28:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:28:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:28:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 00:28:50,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-06 00:28:50,435 INFO L175 Difference]: Start difference. First operand has 88 places, 118 transitions, 1673 flow. Second operand 6 states and 70 transitions. [2022-12-06 00:28:50,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 156 transitions, 2422 flow [2022-12-06 00:28:50,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 156 transitions, 2346 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:50,469 INFO L231 Difference]: Finished difference. Result has 94 places, 125 transitions, 1776 flow [2022-12-06 00:28:50,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1776, PETRI_PLACES=94, PETRI_TRANSITIONS=125} [2022-12-06 00:28:50,470 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 00:28:50,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:50,470 INFO L89 Accepts]: Start accepts. Operand has 94 places, 125 transitions, 1776 flow [2022-12-06 00:28:50,471 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:50,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:50,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 125 transitions, 1776 flow [2022-12-06 00:28:50,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 125 transitions, 1776 flow [2022-12-06 00:28:50,515 INFO L130 PetriNetUnfolder]: 119/404 cut-off events. [2022-12-06 00:28:50,516 INFO L131 PetriNetUnfolder]: For 3327/3412 co-relation queries the response was YES. [2022-12-06 00:28:50,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2323 conditions, 404 events. 119/404 cut-off events. For 3327/3412 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2698 event pairs, 27 based on Foata normal form. 4/377 useless extension candidates. Maximal degree in co-relation 2115. Up to 117 conditions per place. [2022-12-06 00:28:50,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 125 transitions, 1776 flow [2022-12-06 00:28:50,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 00:28:50,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:50,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:28:50,891 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:50,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-06 00:28:50,892 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 125 transitions, 1772 flow [2022-12-06 00:28:50,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:50,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:50,892 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:50,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 00:28:50,892 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1288017019, now seen corresponding path program 1 times [2022-12-06 00:28:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:50,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413971990] [2022-12-06 00:28:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:51,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:51,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413971990] [2022-12-06 00:28:51,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413971990] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:51,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183655616] [2022-12-06 00:28:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:51,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:51,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 00:28:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:51,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-06 00:28:51,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:51,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:51,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:28:51,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:51,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:51,330 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 00:28:51,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 103 treesize of output 64 [2022-12-06 00:28:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:51,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:53,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183655616] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:53,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:53,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 00:28:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292907921] [2022-12-06 00:28:53,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:28:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:28:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=115, Unknown=4, NotChecked=0, Total=156 [2022-12-06 00:28:53,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:28:53,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 125 transitions, 1772 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:53,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:53,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:28:53,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:14,928 WARN L233 SmtUtils]: Spent 12.25s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:29:15,865 INFO L130 PetriNetUnfolder]: 774/1381 cut-off events. [2022-12-06 00:29:15,865 INFO L131 PetriNetUnfolder]: For 14306/14306 co-relation queries the response was YES. [2022-12-06 00:29:15,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9042 conditions, 1381 events. 774/1381 cut-off events. For 14306/14306 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7424 event pairs, 154 based on Foata normal form. 14/1387 useless extension candidates. Maximal degree in co-relation 8386. Up to 1068 conditions per place. [2022-12-06 00:29:15,877 INFO L137 encePairwiseOnDemand]: 13/42 looper letters, 113 selfloop transitions, 60 changer transitions 9/182 dead transitions. [2022-12-06 00:29:15,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 182 transitions, 2630 flow [2022-12-06 00:29:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:29:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:29:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 116 transitions. [2022-12-06 00:29:15,879 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17261904761904762 [2022-12-06 00:29:15,879 INFO L175 Difference]: Start difference. First operand has 95 places, 125 transitions, 1772 flow. Second operand 16 states and 116 transitions. [2022-12-06 00:29:15,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 182 transitions, 2630 flow [2022-12-06 00:29:15,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 182 transitions, 2582 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-12-06 00:29:15,920 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 2036 flow [2022-12-06 00:29:15,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1694, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2036, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2022-12-06 00:29:15,920 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 00:29:15,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:15,920 INFO L89 Accepts]: Start accepts. Operand has 113 places, 131 transitions, 2036 flow [2022-12-06 00:29:15,921 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:15,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:15,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 131 transitions, 2036 flow [2022-12-06 00:29:15,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 131 transitions, 2036 flow [2022-12-06 00:29:15,971 INFO L130 PetriNetUnfolder]: 128/434 cut-off events. [2022-12-06 00:29:15,971 INFO L131 PetriNetUnfolder]: For 4963/5053 co-relation queries the response was YES. [2022-12-06 00:29:15,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2760 conditions, 434 events. 128/434 cut-off events. For 4963/5053 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2948 event pairs, 29 based on Foata normal form. 4/405 useless extension candidates. Maximal degree in co-relation 2533. Up to 126 conditions per place. [2022-12-06 00:29:15,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 131 transitions, 2036 flow [2022-12-06 00:29:15,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 00:29:15,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:29:17,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [643] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_230| v_~f~0.base_146))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_146 (* v_~x2~0_179 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_146 (* 4 .cse6))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_146 (* .cse7 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_146 (* .cse0 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_146 (* v_~x1~0_240 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_146 (* .cse5 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_146 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_156)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_146 (* .cse2 4))) v_~x2~0_178) (not (= (ite (and (< v_~x1~0_240 v_~size~0_156) (<= 0 v_~x1~0_240)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_156)) 1 0) 0)) (= v_~x1~0_238 (select .cse1 (+ v_~f~0.offset_146 (* .cse4 4)))) (not (= (ite (and (< .cse5 v_~size~0_156) (<= 0 .cse5)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_156)) 1 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_138|) (= |v_thread1Thread1of1ForFork0_~i~0#1_188| 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (not (= 0 (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_156)) 1 0))) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_156)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_138|) 4294967296) (* (mod v_~n~0_155 2147483648) 2)) (not (= (ite (and (<= 0 v_~x2~0_179) (< v_~x2~0_179 v_~size~0_156)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_156)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_179, ~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_146, #memory_int=|v_#memory_int_230|, ~n~0=v_~n~0_155, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_146} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_134|, ~x2~0=v_~x2~0_178, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_156, ~f~0.base=v_~f~0.base_146, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_85|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_138|, ~x1~0=v_~x1~0_238, ~f~0.offset=v_~f~0.offset_146, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_116|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_188|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_132|, #memory_int=|v_#memory_int_230|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_71|, ~n~0=v_~n~0_155, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_142|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:18,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_250| v_~f~0.base_160))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_160 (* v_~x2~0_203 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_160 (* v_~x1~0_274 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_160 (* .cse4 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_160 (* .cse5 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_160 (* .cse2 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_160 (* .cse6 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_168)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_168)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|) (= |v_thread2Thread1of1ForFork1_~i~1#1_156| 4) (not (= (ite (and (< .cse2 v_~size~0_168) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_202 (select .cse3 (+ v_~f~0.offset_160 (* .cse1 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_212| 4294967295) 4294967296) (* (mod v_~n~0_167 2147483648) 2)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_168)) 1 0) 0)) (not (= 0 (ite (and (< v_~x1~0_274 v_~size~0_168) (<= 0 v_~x1~0_274)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_212| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152| 0)) (not (= (ite (and (< .cse5 v_~size~0_168) (<= 0 .cse5)) 1 0) 0)) (= v_~x1~0_272 (select .cse3 (+ v_~f~0.offset_160 (* .cse0 4)))) (not (= (ite (and (<= 0 v_~x2~0_203) (< v_~x2~0_203 v_~size~0_168)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_168)) 1 0) 0))))))) InVars {~x2~0=v_~x2~0_203, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_160, #memory_int=|v_#memory_int_250|, ~n~0=v_~n~0_167, ~x1~0=v_~x1~0_274, ~f~0.offset=v_~f~0.offset_160} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_154|, ~x2~0=v_~x2~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, ~size~0=v_~size~0_168, ~f~0.base=v_~f~0.base_160, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_99|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_156|, ~x1~0=v_~x1~0_272, ~f~0.offset=v_~f~0.offset_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_133|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_136|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_212|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|, #memory_int=|v_#memory_int_250|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_85|, ~n~0=v_~n~0_167, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_162|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_85|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:18,651 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:29:18,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2732 [2022-12-06 00:29:18,652 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 129 transitions, 2081 flow [2022-12-06 00:29:18,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:18,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:18,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:18,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 00:29:18,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-06 00:29:18,860 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash 149813494, now seen corresponding path program 1 times [2022-12-06 00:29:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:18,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558448648] [2022-12-06 00:29:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:18,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558448648] [2022-12-06 00:29:18,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558448648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:18,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:18,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246748317] [2022-12-06 00:29:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:18,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:18,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 00:29:18,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 129 transitions, 2081 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:18,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:18,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 00:29:18,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:19,266 INFO L130 PetriNetUnfolder]: 770/1422 cut-off events. [2022-12-06 00:29:19,267 INFO L131 PetriNetUnfolder]: For 19065/19065 co-relation queries the response was YES. [2022-12-06 00:29:19,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9797 conditions, 1422 events. 770/1422 cut-off events. For 19065/19065 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8165 event pairs, 292 based on Foata normal form. 24/1438 useless extension candidates. Maximal degree in co-relation 9098. Up to 1052 conditions per place. [2022-12-06 00:29:19,277 INFO L137 encePairwiseOnDemand]: 27/44 looper letters, 125 selfloop transitions, 31 changer transitions 7/163 dead transitions. [2022-12-06 00:29:19,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 163 transitions, 2763 flow [2022-12-06 00:29:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-06 00:29:19,278 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32272727272727275 [2022-12-06 00:29:19,278 INFO L175 Difference]: Start difference. First operand has 108 places, 129 transitions, 2081 flow. Second operand 5 states and 71 transitions. [2022-12-06 00:29:19,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 163 transitions, 2763 flow [2022-12-06 00:29:19,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 163 transitions, 2498 flow, removed 114 selfloop flow, removed 6 redundant places. [2022-12-06 00:29:19,314 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1977 flow [2022-12-06 00:29:19,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1977, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 00:29:19,314 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 00:29:19,314 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:19,314 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1977 flow [2022-12-06 00:29:19,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:19,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:19,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1977 flow [2022-12-06 00:29:19,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1977 flow [2022-12-06 00:29:19,362 INFO L130 PetriNetUnfolder]: 130/451 cut-off events. [2022-12-06 00:29:19,362 INFO L131 PetriNetUnfolder]: For 5204/5258 co-relation queries the response was YES. [2022-12-06 00:29:19,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 451 events. 130/451 cut-off events. For 5204/5258 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3155 event pairs, 30 based on Foata normal form. 4/429 useless extension candidates. Maximal degree in co-relation 2662. Up to 137 conditions per place. [2022-12-06 00:29:19,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1977 flow [2022-12-06 00:29:19,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 00:29:20,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [645] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_233| v_~f~0.base_148))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_148 (* v_~x2~0_186 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_148 (* 4 .cse4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_148 (* .cse6 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_148 (* .cse5 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_148 (* v_~x1~0_249 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_148 (* .cse7 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_148 (* .cse2 4))))) (and (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_142|) 4294967296) (* (mod v_~n~0_157 2147483648) 2)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_142|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (= (select .cse0 (+ v_~f~0.offset_148 (* 4 .cse1))) v_~x2~0_184) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_158)) 1 0) 0)) (= v_~x1~0_248 (select .cse0 (+ v_~f~0.offset_148 (* .cse3 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| (ite (and (< .cse3 v_~size~0_158) (<= 0 .cse3)) 1 0)) (not (= (ite (and (< .cse4 v_~size~0_158) (<= 0 .cse4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_195| 3) (not (= (ite (and (< .cse5 v_~size~0_158) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (not (= (ite (and (< v_~x1~0_249 v_~size~0_158) (<= 0 v_~x1~0_249)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_158)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_158)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_186) (< v_~x2~0_186 v_~size~0_158)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_186, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_148, #memory_int=|v_#memory_int_233|, ~n~0=v_~n~0_157, ~x1~0=v_~x1~0_249, ~f~0.offset=v_~f~0.offset_148} OutVars{~x2~0=v_~x2~0_184, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_141|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_85|, ~size~0=v_~size~0_158, ~f~0.base=v_~f~0.base_148, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_89|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_142|, ~x1~0=v_~x1~0_248, ~f~0.offset=v_~f~0.offset_148, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, #memory_int=|v_#memory_int_233|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_75|, ~n~0=v_~n~0_157, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_75|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_149|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:29:20,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_157| v_~f~0.base_92))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_92 (* v_~x1~0_114 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= |v_thread1Thread1of1ForFork0_~i~0#1_102| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (ite (and (< .cse0 v_~size~0_104) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|) (= v_~x1~0_112 (select .cse1 (+ v_~f~0.offset_92 (* .cse0 4)))) (not (= (ite (and (< v_~x1~0_114 v_~size~0_104) (<= 0 v_~x1~0_114)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_102| 4294967295) 4294967296) (* 2 (mod v_~n~0_103 2147483648)))))) InVars {~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_114, ~f~0.offset=v_~f~0.offset_92} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_58|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_40|, ~size~0=v_~size~0_104, ~f~0.base=v_~f~0.base_92, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, #memory_int=|v_#memory_int_157|, ~n~0=v_~n~0_103, ~x1~0=v_~x1~0_112, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_66|, ~f~0.offset=v_~f~0.offset_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:20,802 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_169| v_~f~0.base_102))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_102 (* v_~x1~0_142 4))))) (and (not (= (ite (and (< v_~x1~0_142 v_~size~0_114) (<= 0 v_~x1~0_142)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_124| 4294967295) 4294967296) (* (mod v_~n~0_113 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= v_~x1~0_140 (select .cse0 (+ v_~f~0.offset_102 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_114)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|) (= |v_thread1Thread1of1ForFork0_~i~0#1_124| 2)))) InVars {~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_102, #memory_int=|v_#memory_int_169|, ~n~0=v_~n~0_113, ~x1~0=v_~x1~0_142, ~f~0.offset=v_~f~0.offset_102} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_76|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_58|, ~size~0=v_~size~0_114, ~f~0.base=v_~f~0.base_102, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_124|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_74|, #memory_int=|v_#memory_int_169|, ~n~0=v_~n~0_113, ~x1~0=v_~x1~0_140, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_84|, ~f~0.offset=v_~f~0.offset_102} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:20,996 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:29:20,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1683 [2022-12-06 00:29:20,997 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 2027 flow [2022-12-06 00:29:20,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:20,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:20,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:20,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:29:21,001 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:21,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1625893549, now seen corresponding path program 1 times [2022-12-06 00:29:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:21,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665316139] [2022-12-06 00:29:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:21,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:21,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:21,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665316139] [2022-12-06 00:29:21,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665316139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:21,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:21,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832794518] [2022-12-06 00:29:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:21,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:21,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 00:29:21,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 2027 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:21,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:21,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 00:29:21,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:21,486 INFO L130 PetriNetUnfolder]: 742/1349 cut-off events. [2022-12-06 00:29:21,486 INFO L131 PetriNetUnfolder]: For 17202/17202 co-relation queries the response was YES. [2022-12-06 00:29:21,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9359 conditions, 1349 events. 742/1349 cut-off events. For 17202/17202 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7412 event pairs, 368 based on Foata normal form. 4/1345 useless extension candidates. Maximal degree in co-relation 8751. Up to 1322 conditions per place. [2022-12-06 00:29:21,496 INFO L137 encePairwiseOnDemand]: 41/47 looper letters, 126 selfloop transitions, 8 changer transitions 1/135 dead transitions. [2022-12-06 00:29:21,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 2361 flow [2022-12-06 00:29:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:29:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:29:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 00:29:21,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36879432624113473 [2022-12-06 00:29:21,497 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 2027 flow. Second operand 3 states and 52 transitions. [2022-12-06 00:29:21,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 2361 flow [2022-12-06 00:29:21,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 2220 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-12-06 00:29:21,533 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1921 flow [2022-12-06 00:29:21,533 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1921, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 00:29:21,534 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 00:29:21,534 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:21,534 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1921 flow [2022-12-06 00:29:21,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:21,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:21,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1921 flow [2022-12-06 00:29:21,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1921 flow [2022-12-06 00:29:21,586 INFO L130 PetriNetUnfolder]: 132/452 cut-off events. [2022-12-06 00:29:21,586 INFO L131 PetriNetUnfolder]: For 4715/4765 co-relation queries the response was YES. [2022-12-06 00:29:21,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 452 events. 132/452 cut-off events. For 4715/4765 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3184 event pairs, 30 based on Foata normal form. 4/427 useless extension candidates. Maximal degree in co-relation 2558. Up to 136 conditions per place. [2022-12-06 00:29:21,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1921 flow [2022-12-06 00:29:21,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 00:29:21,592 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:21,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 00:29:21,593 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 1921 flow [2022-12-06 00:29:21,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:21,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:21,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:21,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 00:29:21,593 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1995524838, now seen corresponding path program 1 times [2022-12-06 00:29:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:21,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059930670] [2022-12-06 00:29:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:21,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:21,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059930670] [2022-12-06 00:29:21,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059930670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:21,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:21,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086920404] [2022-12-06 00:29:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:21,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:21,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:21,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:21,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:21,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 00:29:21,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 1921 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:21,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:21,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 00:29:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:21,946 INFO L130 PetriNetUnfolder]: 720/1323 cut-off events. [2022-12-06 00:29:21,946 INFO L131 PetriNetUnfolder]: For 15842/15842 co-relation queries the response was YES. [2022-12-06 00:29:21,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8790 conditions, 1323 events. 720/1323 cut-off events. For 15842/15842 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7302 event pairs, 357 based on Foata normal form. 20/1333 useless extension candidates. Maximal degree in co-relation 8093. Up to 1273 conditions per place. [2022-12-06 00:29:21,957 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 112 selfloop transitions, 20 changer transitions 8/140 dead transitions. [2022-12-06 00:29:21,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 140 transitions, 2249 flow [2022-12-06 00:29:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 00:29:21,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3423913043478261 [2022-12-06 00:29:21,959 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 1921 flow. Second operand 4 states and 63 transitions. [2022-12-06 00:29:21,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 140 transitions, 2249 flow [2022-12-06 00:29:21,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 140 transitions, 2213 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 00:29:21,997 INFO L231 Difference]: Finished difference. Result has 109 places, 131 transitions, 1949 flow [2022-12-06 00:29:21,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1949, PETRI_PLACES=109, PETRI_TRANSITIONS=131} [2022-12-06 00:29:21,998 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 00:29:21,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:21,998 INFO L89 Accepts]: Start accepts. Operand has 109 places, 131 transitions, 1949 flow [2022-12-06 00:29:21,999 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:21,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:21,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 131 transitions, 1949 flow [2022-12-06 00:29:22,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 1949 flow [2022-12-06 00:29:22,068 INFO L130 PetriNetUnfolder]: 129/440 cut-off events. [2022-12-06 00:29:22,068 INFO L131 PetriNetUnfolder]: For 4265/4309 co-relation queries the response was YES. [2022-12-06 00:29:22,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 440 events. 129/440 cut-off events. For 4265/4309 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3033 event pairs, 28 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 2522. Up to 131 conditions per place. [2022-12-06 00:29:22,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 131 transitions, 1949 flow [2022-12-06 00:29:22,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 00:29:22,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:22,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_163| v_~f~0.base_96))) (let ((.cse0 (* (mod v_~n~0_107 2147483648) 2)) (.cse1 (select .cse2 (+ v_~f~0.offset_96 (* v_~x1~0_124 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_110| 2) |v_thread1Thread1of1ForFork0_~i~0#1_108|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (not (= (ite (and (< v_~x1~0_124 v_~size~0_108) (<= 0 v_~x1~0_124)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_110| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_108)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_108| 4294967295) 4294967296) .cse0) (= (select .cse2 (+ v_~f~0.offset_96 (* 4 .cse1))) v_~x1~0_122)))) InVars {~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_110|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_124, ~f~0.offset=v_~f~0.offset_96} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_64|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_46|, ~size~0=v_~size~0_108, ~f~0.base=v_~f~0.base_96, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_62|, #memory_int=|v_#memory_int_163|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_122, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_72|, ~f~0.offset=v_~f~0.offset_96} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:22,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:22,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:22,861 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:22,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 864 [2022-12-06 00:29:22,862 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 132 transitions, 1975 flow [2022-12-06 00:29:22,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:22,862 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:22,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:22,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 00:29:22,862 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:22,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1487787042, now seen corresponding path program 2 times [2022-12-06 00:29:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:22,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564778642] [2022-12-06 00:29:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:22,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:22,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564778642] [2022-12-06 00:29:22,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564778642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:22,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:22,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:22,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048349123] [2022-12-06 00:29:22,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:22,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:22,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:22,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:29:22,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 132 transitions, 1975 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:22,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:22,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:29:22,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:23,189 INFO L130 PetriNetUnfolder]: 718/1313 cut-off events. [2022-12-06 00:29:23,190 INFO L131 PetriNetUnfolder]: For 14620/14620 co-relation queries the response was YES. [2022-12-06 00:29:23,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8893 conditions, 1313 events. 718/1313 cut-off events. For 14620/14620 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7195 event pairs, 363 based on Foata normal form. 4/1307 useless extension candidates. Maximal degree in co-relation 8199. Up to 1281 conditions per place. [2022-12-06 00:29:23,198 INFO L137 encePairwiseOnDemand]: 33/50 looper letters, 114 selfloop transitions, 23 changer transitions 0/137 dead transitions. [2022-12-06 00:29:23,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 137 transitions, 2306 flow [2022-12-06 00:29:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 00:29:23,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 00:29:23,199 INFO L175 Difference]: Start difference. First operand has 109 places, 132 transitions, 1975 flow. Second operand 4 states and 60 transitions. [2022-12-06 00:29:23,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 137 transitions, 2306 flow [2022-12-06 00:29:23,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 2265 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-06 00:29:23,237 INFO L231 Difference]: Finished difference. Result has 112 places, 133 transitions, 2006 flow [2022-12-06 00:29:23,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2006, PETRI_PLACES=112, PETRI_TRANSITIONS=133} [2022-12-06 00:29:23,238 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-06 00:29:23,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:23,238 INFO L89 Accepts]: Start accepts. Operand has 112 places, 133 transitions, 2006 flow [2022-12-06 00:29:23,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:23,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:23,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 133 transitions, 2006 flow [2022-12-06 00:29:23,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 133 transitions, 2006 flow [2022-12-06 00:29:23,290 INFO L130 PetriNetUnfolder]: 132/451 cut-off events. [2022-12-06 00:29:23,291 INFO L131 PetriNetUnfolder]: For 4537/4592 co-relation queries the response was YES. [2022-12-06 00:29:23,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 451 events. 132/451 cut-off events. For 4537/4592 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3138 event pairs, 29 based on Foata normal form. 4/424 useless extension candidates. Maximal degree in co-relation 2622. Up to 135 conditions per place. [2022-12-06 00:29:23,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 133 transitions, 2006 flow [2022-12-06 00:29:23,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-06 00:29:23,296 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:23,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 00:29:23,297 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 133 transitions, 2006 flow [2022-12-06 00:29:23,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:23,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:23,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:23,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 00:29:23,297 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash 507632386, now seen corresponding path program 1 times [2022-12-06 00:29:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:23,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257209160] [2022-12-06 00:29:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:23,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257209160] [2022-12-06 00:29:23,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257209160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:23,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24132764] [2022-12-06 00:29:23,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:23,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:23,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:23,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:23,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:29:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:23,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:29:23,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:23,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-06 00:29:23,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:23,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24132764] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:23,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:23,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 00:29:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193450151] [2022-12-06 00:29:23,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:29:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:29:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:29:23,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:29:23,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 133 transitions, 2006 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:23,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:23,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:29:23,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:25,288 INFO L130 PetriNetUnfolder]: 755/1399 cut-off events. [2022-12-06 00:29:25,289 INFO L131 PetriNetUnfolder]: For 16300/16300 co-relation queries the response was YES. [2022-12-06 00:29:25,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9517 conditions, 1399 events. 755/1399 cut-off events. For 16300/16300 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7865 event pairs, 340 based on Foata normal form. 32/1413 useless extension candidates. Maximal degree in co-relation 8822. Up to 1225 conditions per place. [2022-12-06 00:29:25,298 INFO L137 encePairwiseOnDemand]: 34/50 looper letters, 139 selfloop transitions, 30 changer transitions 6/175 dead transitions. [2022-12-06 00:29:25,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 175 transitions, 2764 flow [2022-12-06 00:29:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:29:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:29:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-12-06 00:29:25,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26857142857142857 [2022-12-06 00:29:25,305 INFO L175 Difference]: Start difference. First operand has 112 places, 133 transitions, 2006 flow. Second operand 7 states and 94 transitions. [2022-12-06 00:29:25,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 175 transitions, 2764 flow [2022-12-06 00:29:25,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 175 transitions, 2717 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 00:29:25,353 INFO L231 Difference]: Finished difference. Result has 120 places, 139 transitions, 2142 flow [2022-12-06 00:29:25,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1959, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2142, PETRI_PLACES=120, PETRI_TRANSITIONS=139} [2022-12-06 00:29:25,354 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 00:29:25,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:25,354 INFO L89 Accepts]: Start accepts. Operand has 120 places, 139 transitions, 2142 flow [2022-12-06 00:29:25,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:25,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:25,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 139 transitions, 2142 flow [2022-12-06 00:29:25,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 139 transitions, 2142 flow [2022-12-06 00:29:25,411 INFO L130 PetriNetUnfolder]: 139/490 cut-off events. [2022-12-06 00:29:25,411 INFO L131 PetriNetUnfolder]: For 6027/6082 co-relation queries the response was YES. [2022-12-06 00:29:25,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 490 events. 139/490 cut-off events. For 6027/6082 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3494 event pairs, 28 based on Foata normal form. 4/465 useless extension candidates. Maximal degree in co-relation 3082. Up to 139 conditions per place. [2022-12-06 00:29:25,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 139 transitions, 2142 flow [2022-12-06 00:29:25,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-06 00:29:25,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:25,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [607] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_165| v_~f~0.base_98))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_98 (* v_~x1~0_130 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_98 (* .cse3 4)))) (.cse1 (* (mod v_~n~0_109 2147483648) 2))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_110)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_116| 3) |v_thread1Thread1of1ForFork0_~i~0#1_114|) (not (= (ite (and (<= 0 v_~x1~0_130) (< v_~x1~0_130 v_~size~0_110)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_114| 4294967295) 4294967296) .cse1) (= v_~x1~0_128 (select .cse2 (+ v_~f~0.offset_98 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_116| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_110)) 1 0) 0)))))) InVars {~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_116|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_130, ~f~0.offset=v_~f~0.offset_98} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_50|, ~size~0=v_~size~0_110, ~f~0.base=v_~f~0.base_98, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_114|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_66|, #memory_int=|v_#memory_int_165|, ~n~0=v_~n~0_109, ~x1~0=v_~x1~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_76|, ~f~0.offset=v_~f~0.offset_98} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:25,863 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:25,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 510 [2022-12-06 00:29:25,864 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 140 transitions, 2201 flow [2022-12-06 00:29:25,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:25,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:25,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:25,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:26,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:26,069 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash -254902856, now seen corresponding path program 2 times [2022-12-06 00:29:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:26,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037583561] [2022-12-06 00:29:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037583561] [2022-12-06 00:29:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037583561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:26,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279681111] [2022-12-06 00:29:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:26,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:26,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:29:26,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 140 transitions, 2201 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:26,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:26,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:29:26,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:26,530 INFO L130 PetriNetUnfolder]: 763/1393 cut-off events. [2022-12-06 00:29:26,530 INFO L131 PetriNetUnfolder]: For 21030/21030 co-relation queries the response was YES. [2022-12-06 00:29:26,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10461 conditions, 1393 events. 763/1393 cut-off events. For 21030/21030 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7769 event pairs, 144 based on Foata normal form. 12/1395 useless extension candidates. Maximal degree in co-relation 9694. Up to 618 conditions per place. [2022-12-06 00:29:26,542 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 149 selfloop transitions, 36 changer transitions 2/187 dead transitions. [2022-12-06 00:29:26,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 187 transitions, 3206 flow [2022-12-06 00:29:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 00:29:26,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2923076923076923 [2022-12-06 00:29:26,543 INFO L175 Difference]: Start difference. First operand has 120 places, 140 transitions, 2201 flow. Second operand 5 states and 76 transitions. [2022-12-06 00:29:26,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 187 transitions, 3206 flow [2022-12-06 00:29:26,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 187 transitions, 3077 flow, removed 47 selfloop flow, removed 2 redundant places. [2022-12-06 00:29:26,601 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 2394 flow [2022-12-06 00:29:26,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2394, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2022-12-06 00:29:26,601 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-06 00:29:26,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:26,601 INFO L89 Accepts]: Start accepts. Operand has 124 places, 151 transitions, 2394 flow [2022-12-06 00:29:26,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:26,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:26,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 151 transitions, 2394 flow [2022-12-06 00:29:26,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 151 transitions, 2394 flow [2022-12-06 00:29:26,663 INFO L130 PetriNetUnfolder]: 149/484 cut-off events. [2022-12-06 00:29:26,664 INFO L131 PetriNetUnfolder]: For 7486/7536 co-relation queries the response was YES. [2022-12-06 00:29:26,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 484 events. 149/484 cut-off events. For 7486/7536 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3341 event pairs, 24 based on Foata normal form. 4/461 useless extension candidates. Maximal degree in co-relation 3331. Up to 142 conditions per place. [2022-12-06 00:29:26,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 151 transitions, 2394 flow [2022-12-06 00:29:26,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-06 00:29:27,131 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:27,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 531 [2022-12-06 00:29:27,132 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 150 transitions, 2386 flow [2022-12-06 00:29:27,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:27,132 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:27,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:27,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 00:29:27,132 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1211623447, now seen corresponding path program 1 times [2022-12-06 00:29:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:27,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411859047] [2022-12-06 00:29:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:27,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411859047] [2022-12-06 00:29:27,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411859047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:27,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159354511] [2022-12-06 00:29:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:27,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:27,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:27,247 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:27,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:29:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:27,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:29:27,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:27,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:27,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159354511] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:27,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:27,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 00:29:27,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657550358] [2022-12-06 00:29:27,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:27,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:29:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:27,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:29:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:29:27,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 00:29:27,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 150 transitions, 2386 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:27,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:27,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 00:29:27,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:28,295 INFO L130 PetriNetUnfolder]: 832/1481 cut-off events. [2022-12-06 00:29:28,295 INFO L131 PetriNetUnfolder]: For 30317/30317 co-relation queries the response was YES. [2022-12-06 00:29:28,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12374 conditions, 1481 events. 832/1481 cut-off events. For 30317/30317 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8102 event pairs, 147 based on Foata normal form. 55/1526 useless extension candidates. Maximal degree in co-relation 11567. Up to 767 conditions per place. [2022-12-06 00:29:28,307 INFO L137 encePairwiseOnDemand]: 19/52 looper letters, 137 selfloop transitions, 72 changer transitions 0/209 dead transitions. [2022-12-06 00:29:28,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 209 transitions, 3745 flow [2022-12-06 00:29:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:29:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:29:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-12-06 00:29:28,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1987179487179487 [2022-12-06 00:29:28,309 INFO L175 Difference]: Start difference. First operand has 122 places, 150 transitions, 2386 flow. Second operand 9 states and 93 transitions. [2022-12-06 00:29:28,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 209 transitions, 3745 flow [2022-12-06 00:29:28,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 209 transitions, 3661 flow, removed 42 selfloop flow, removed 0 redundant places. [2022-12-06 00:29:28,382 INFO L231 Difference]: Finished difference. Result has 135 places, 161 transitions, 2842 flow [2022-12-06 00:29:28,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2842, PETRI_PLACES=135, PETRI_TRANSITIONS=161} [2022-12-06 00:29:28,383 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 114 predicate places. [2022-12-06 00:29:28,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:28,383 INFO L89 Accepts]: Start accepts. Operand has 135 places, 161 transitions, 2842 flow [2022-12-06 00:29:28,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:28,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:28,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 161 transitions, 2842 flow [2022-12-06 00:29:28,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 161 transitions, 2842 flow [2022-12-06 00:29:28,443 INFO L130 PetriNetUnfolder]: 166/508 cut-off events. [2022-12-06 00:29:28,443 INFO L131 PetriNetUnfolder]: For 10088/10169 co-relation queries the response was YES. [2022-12-06 00:29:28,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4307 conditions, 508 events. 166/508 cut-off events. For 10088/10169 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3420 event pairs, 24 based on Foata normal form. 8/491 useless extension candidates. Maximal degree in co-relation 4023. Up to 166 conditions per place. [2022-12-06 00:29:28,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 161 transitions, 2842 flow [2022-12-06 00:29:28,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-06 00:29:28,961 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:28,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 578 [2022-12-06 00:29:28,961 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 161 transitions, 2928 flow [2022-12-06 00:29:28,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:28,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:28,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:28,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:29,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-06 00:29:29,166 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1908327070, now seen corresponding path program 2 times [2022-12-06 00:29:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:29,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273825055] [2022-12-06 00:29:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:29,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273825055] [2022-12-06 00:29:29,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273825055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:29,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:29,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68195572] [2022-12-06 00:29:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:29,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:29,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:29,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:29,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 00:29:29,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 161 transitions, 2928 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:29,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:29,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 00:29:29,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:29,617 INFO L130 PetriNetUnfolder]: 824/1487 cut-off events. [2022-12-06 00:29:29,617 INFO L131 PetriNetUnfolder]: For 34412/34412 co-relation queries the response was YES. [2022-12-06 00:29:29,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13176 conditions, 1487 events. 824/1487 cut-off events. For 34412/34412 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8193 event pairs, 330 based on Foata normal form. 24/1501 useless extension candidates. Maximal degree in co-relation 12322. Up to 1220 conditions per place. [2022-12-06 00:29:29,628 INFO L137 encePairwiseOnDemand]: 32/56 looper letters, 137 selfloop transitions, 47 changer transitions 0/184 dead transitions. [2022-12-06 00:29:29,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 184 transitions, 3542 flow [2022-12-06 00:29:29,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 00:29:29,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30357142857142855 [2022-12-06 00:29:29,630 INFO L175 Difference]: Start difference. First operand has 135 places, 161 transitions, 2928 flow. Second operand 5 states and 85 transitions. [2022-12-06 00:29:29,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 184 transitions, 3542 flow [2022-12-06 00:29:29,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 3327 flow, removed 101 selfloop flow, removed 2 redundant places. [2022-12-06 00:29:29,699 INFO L231 Difference]: Finished difference. Result has 140 places, 166 transitions, 2984 flow [2022-12-06 00:29:29,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2713, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2984, PETRI_PLACES=140, PETRI_TRANSITIONS=166} [2022-12-06 00:29:29,700 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 119 predicate places. [2022-12-06 00:29:29,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:29,700 INFO L89 Accepts]: Start accepts. Operand has 140 places, 166 transitions, 2984 flow [2022-12-06 00:29:29,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:29,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:29,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 166 transitions, 2984 flow [2022-12-06 00:29:29,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 166 transitions, 2984 flow [2022-12-06 00:29:29,754 INFO L130 PetriNetUnfolder]: 166/516 cut-off events. [2022-12-06 00:29:29,755 INFO L131 PetriNetUnfolder]: For 11776/11857 co-relation queries the response was YES. [2022-12-06 00:29:29,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 516 events. 166/516 cut-off events. For 11776/11857 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3503 event pairs, 20 based on Foata normal form. 5/497 useless extension candidates. Maximal degree in co-relation 4068. Up to 164 conditions per place. [2022-12-06 00:29:29,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 166 transitions, 2984 flow [2022-12-06 00:29:29,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 00:29:29,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (* (mod v_~n~0_In_7 2147483648) 2))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:29:29,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:29,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:29:29,910 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 3020 flow [2022-12-06 00:29:29,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:29,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:29,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:29,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 00:29:29,914 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:29,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2041371074, now seen corresponding path program 1 times [2022-12-06 00:29:29,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:29,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664322418] [2022-12-06 00:29:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:29,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:31,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664322418] [2022-12-06 00:29:31,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664322418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:31,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706723925] [2022-12-06 00:29:31,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:31,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:31,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:31,692 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:31,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:29:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:31,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 00:29:31,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:31,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:31,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:29:31,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:31,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:32,082 INFO L321 Elim1Store]: treesize reduction 16, result has 86.8 percent of original size [2022-12-06 00:29:32,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 148 [2022-12-06 00:29:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:32,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:32,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706723925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:32,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:32,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:29:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539022791] [2022-12-06 00:29:32,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:32,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:29:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:29:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=89, Unknown=1, NotChecked=0, Total=132 [2022-12-06 00:29:32,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 00:29:32,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 167 transitions, 3020 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:32,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:32,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 00:29:32,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:45,549 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 115 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:29:46,537 INFO L130 PetriNetUnfolder]: 934/1710 cut-off events. [2022-12-06 00:29:46,537 INFO L131 PetriNetUnfolder]: For 41992/41992 co-relation queries the response was YES. [2022-12-06 00:29:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15202 conditions, 1710 events. 934/1710 cut-off events. For 41992/41992 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9982 event pairs, 236 based on Foata normal form. 4/1704 useless extension candidates. Maximal degree in co-relation 14342. Up to 1398 conditions per place. [2022-12-06 00:29:46,548 INFO L137 encePairwiseOnDemand]: 19/57 looper letters, 147 selfloop transitions, 56 changer transitions 13/216 dead transitions. [2022-12-06 00:29:46,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 216 transitions, 4052 flow [2022-12-06 00:29:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:29:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:29:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 00:29:46,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2124756335282651 [2022-12-06 00:29:46,551 INFO L175 Difference]: Start difference. First operand has 141 places, 167 transitions, 3020 flow. Second operand 9 states and 109 transitions. [2022-12-06 00:29:46,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 216 transitions, 4052 flow [2022-12-06 00:29:46,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 216 transitions, 3950 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-06 00:29:46,625 INFO L231 Difference]: Finished difference. Result has 151 places, 175 transitions, 3312 flow [2022-12-06 00:29:46,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=2891, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3312, PETRI_PLACES=151, PETRI_TRANSITIONS=175} [2022-12-06 00:29:46,625 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 130 predicate places. [2022-12-06 00:29:46,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:46,626 INFO L89 Accepts]: Start accepts. Operand has 151 places, 175 transitions, 3312 flow [2022-12-06 00:29:46,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:46,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:46,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 175 transitions, 3312 flow [2022-12-06 00:29:46,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 175 transitions, 3312 flow [2022-12-06 00:29:46,702 INFO L130 PetriNetUnfolder]: 182/595 cut-off events. [2022-12-06 00:29:46,702 INFO L131 PetriNetUnfolder]: For 16161/16268 co-relation queries the response was YES. [2022-12-06 00:29:46,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 595 events. 182/595 cut-off events. For 16161/16268 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4348 event pairs, 28 based on Foata normal form. 6/572 useless extension candidates. Maximal degree in co-relation 4890. Up to 187 conditions per place. [2022-12-06 00:29:46,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 175 transitions, 3312 flow [2022-12-06 00:29:46,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 00:29:46,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:29:46,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [640] $Ultimate##0-->L59-2: Formula: (let ((.cse5 (select |v_#memory_int_226| v_~f~0.base_142))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_142 (* v_~x2~0_170 4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_142 (* .cse1 4))))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_142 (* 4 .cse0))))) (let ((.cse2 (select .cse5 (+ v_~f~0.offset_142 (* .cse4 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_142 (* .cse2 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_152) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_152) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (< (mod (+ 4294967294 |v_thread2Thread1of1ForFork1_~i~1#1_132|) 4294967296) (* 2 (mod v_~n~0_151 2147483648))) (not (= (ite (and (< .cse2 v_~size~0_152) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_170) (< v_~x2~0_170 v_~size~0_152)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_132|) (= (ite (and (< .cse3 v_~size~0_152) (<= 0 .cse3)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (< .cse4 v_~size~0_152) (<= 0 .cse4)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_142 (* .cse3 4))) v_~x2~0_168)))))))) InVars {~x2~0=v_~x2~0_170, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_142, #memory_int=|v_#memory_int_226|, ~n~0=v_~n~0_151, ~f~0.offset=v_~f~0.offset_142} OutVars{~x2~0=v_~x2~0_168, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_75|, ~size~0=v_~size~0_152, ~f~0.base=v_~f~0.base_142, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_79|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_132|, ~f~0.offset=v_~f~0.offset_142, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_113|, #memory_int=|v_#memory_int_226|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_65|, ~n~0=v_~n~0_151, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_65|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [654] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_252| v_~f~0.base_162))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_162 (* v_~x1~0_280 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_162 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_216| 3) (= v_~x1~0_278 (select .cse0 (+ v_~f~0.offset_162 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_216| 4294967295) 4294967296) (* (mod v_~n~0_169 2147483648) 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (and (< .cse2 v_~size~0_170) (<= 0 .cse2)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_170)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|) (not (= (ite (and (< v_~x1~0_280 v_~size~0_170) (<= 0 v_~x1~0_280)) 1 0) 0)))))) InVars {~size~0=v_~size~0_170, ~f~0.base=v_~f~0.base_162, #memory_int=|v_#memory_int_252|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_280, ~f~0.offset=v_~f~0.offset_162} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_140|, ~size~0=v_~size~0_170, ~f~0.base=v_~f~0.base_162, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_216|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_156|, #memory_int=|v_#memory_int_252|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_278, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_166|, ~f~0.offset=v_~f~0.offset_162} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:29:47,312 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:47,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 687 [2022-12-06 00:29:47,312 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 174 transitions, 3332 flow [2022-12-06 00:29:47,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:47,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:47,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:47,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:47,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 00:29:47,521 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1563444456, now seen corresponding path program 3 times [2022-12-06 00:29:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:47,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451488946] [2022-12-06 00:29:47,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:47,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451488946] [2022-12-06 00:29:47,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451488946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:47,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:47,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:47,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961777982] [2022-12-06 00:29:47,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:47,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 00:29:47,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 174 transitions, 3332 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:47,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:47,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 00:29:47,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:47,921 INFO L130 PetriNetUnfolder]: 924/1690 cut-off events. [2022-12-06 00:29:47,921 INFO L131 PetriNetUnfolder]: For 44626/44626 co-relation queries the response was YES. [2022-12-06 00:29:47,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 1690 events. 924/1690 cut-off events. For 44626/44626 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9821 event pairs, 387 based on Foata normal form. 8/1688 useless extension candidates. Maximal degree in co-relation 14527. Up to 1353 conditions per place. [2022-12-06 00:29:47,958 INFO L137 encePairwiseOnDemand]: 32/56 looper letters, 144 selfloop transitions, 51 changer transitions 0/195 dead transitions. [2022-12-06 00:29:47,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 195 transitions, 4051 flow [2022-12-06 00:29:47,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-06 00:29:47,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29642857142857143 [2022-12-06 00:29:47,959 INFO L175 Difference]: Start difference. First operand has 150 places, 174 transitions, 3332 flow. Second operand 5 states and 83 transitions. [2022-12-06 00:29:47,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 195 transitions, 4051 flow [2022-12-06 00:29:48,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 195 transitions, 3864 flow, removed 73 selfloop flow, removed 6 redundant places. [2022-12-06 00:29:48,022 INFO L231 Difference]: Finished difference. Result has 149 places, 175 transitions, 3333 flow [2022-12-06 00:29:48,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3333, PETRI_PLACES=149, PETRI_TRANSITIONS=175} [2022-12-06 00:29:48,023 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2022-12-06 00:29:48,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:48,023 INFO L89 Accepts]: Start accepts. Operand has 149 places, 175 transitions, 3333 flow [2022-12-06 00:29:48,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:48,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:48,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 175 transitions, 3333 flow [2022-12-06 00:29:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 175 transitions, 3333 flow [2022-12-06 00:29:48,083 INFO L130 PetriNetUnfolder]: 182/590 cut-off events. [2022-12-06 00:29:48,084 INFO L131 PetriNetUnfolder]: For 15565/15696 co-relation queries the response was YES. [2022-12-06 00:29:48,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5130 conditions, 590 events. 182/590 cut-off events. For 15565/15696 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4276 event pairs, 29 based on Foata normal form. 10/569 useless extension candidates. Maximal degree in co-relation 4833. Up to 174 conditions per place. [2022-12-06 00:29:48,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 175 transitions, 3333 flow [2022-12-06 00:29:48,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-06 00:29:48,089 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:48,090 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 00:29:48,090 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 175 transitions, 3333 flow [2022-12-06 00:29:48,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:48,090 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:48,090 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 00:29:48,090 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1430528684, now seen corresponding path program 1 times [2022-12-06 00:29:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944722937] [2022-12-06 00:29:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:48,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:48,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944722937] [2022-12-06 00:29:48,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944722937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:48,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:48,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407497693] [2022-12-06 00:29:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:48,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:29:48,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:48,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:29:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:29:48,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 00:29:48,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 175 transitions, 3333 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:48,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:48,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 00:29:48,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:49,087 INFO L130 PetriNetUnfolder]: 976/1818 cut-off events. [2022-12-06 00:29:49,087 INFO L131 PetriNetUnfolder]: For 44612/44612 co-relation queries the response was YES. [2022-12-06 00:29:49,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16222 conditions, 1818 events. 976/1818 cut-off events. For 44612/44612 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10958 event pairs, 249 based on Foata normal form. 3/1811 useless extension candidates. Maximal degree in co-relation 15349. Up to 1574 conditions per place. [2022-12-06 00:29:49,098 INFO L137 encePairwiseOnDemand]: 18/56 looper letters, 138 selfloop transitions, 63 changer transitions 11/212 dead transitions. [2022-12-06 00:29:49,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 212 transitions, 4317 flow [2022-12-06 00:29:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 00:29:49,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3107142857142857 [2022-12-06 00:29:49,099 INFO L175 Difference]: Start difference. First operand has 149 places, 175 transitions, 3333 flow. Second operand 5 states and 87 transitions. [2022-12-06 00:29:49,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 212 transitions, 4317 flow [2022-12-06 00:29:49,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 212 transitions, 4179 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 00:29:49,181 INFO L231 Difference]: Finished difference. Result has 153 places, 189 transitions, 3779 flow [2022-12-06 00:29:49,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3221, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3779, PETRI_PLACES=153, PETRI_TRANSITIONS=189} [2022-12-06 00:29:49,182 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 132 predicate places. [2022-12-06 00:29:49,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:49,182 INFO L89 Accepts]: Start accepts. Operand has 153 places, 189 transitions, 3779 flow [2022-12-06 00:29:49,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:49,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:49,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 189 transitions, 3779 flow [2022-12-06 00:29:49,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 189 transitions, 3779 flow [2022-12-06 00:29:49,251 INFO L130 PetriNetUnfolder]: 192/642 cut-off events. [2022-12-06 00:29:49,251 INFO L131 PetriNetUnfolder]: For 17162/17303 co-relation queries the response was YES. [2022-12-06 00:29:49,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5602 conditions, 642 events. 192/642 cut-off events. For 17162/17303 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4837 event pairs, 29 based on Foata normal form. 13/625 useless extension candidates. Maximal degree in co-relation 5298. Up to 188 conditions per place. [2022-12-06 00:29:49,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 189 transitions, 3779 flow [2022-12-06 00:29:49,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-06 00:29:49,270 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:49,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 00:29:49,271 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 189 transitions, 3779 flow [2022-12-06 00:29:49,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:49,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:49,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:49,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 00:29:49,271 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash 489799642, now seen corresponding path program 1 times [2022-12-06 00:29:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:49,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546307367] [2022-12-06 00:29:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:49,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546307367] [2022-12-06 00:29:49,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546307367] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:49,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597897056] [2022-12-06 00:29:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:49,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:49,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:49,369 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:49,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:29:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:49,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-06 00:29:49,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:49,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:49,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:29:49,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:49,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:49,736 INFO L321 Elim1Store]: treesize reduction 100, result has 17.4 percent of original size [2022-12-06 00:29:49,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 70 [2022-12-06 00:29:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:49,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:50,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597897056] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:50,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:50,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-12-06 00:29:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832097878] [2022-12-06 00:29:50,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:50,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:29:50,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:50,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:29:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=117, Unknown=2, NotChecked=0, Total=156 [2022-12-06 00:29:50,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 00:29:50,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 189 transitions, 3779 flow. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:50,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:50,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 00:29:50,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:56,582 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:30:19,444 WARN L233 SmtUtils]: Spent 22.39s on a formula simplification. DAG size of input: 128 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:30:40,001 WARN L233 SmtUtils]: Spent 20.40s on a formula simplification. DAG size of input: 145 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:30:55,127 WARN L233 SmtUtils]: Spent 14.41s on a formula simplification. DAG size of input: 131 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:30:57,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:30:57,873 INFO L130 PetriNetUnfolder]: 1125/2076 cut-off events. [2022-12-06 00:30:57,873 INFO L131 PetriNetUnfolder]: For 60820/60820 co-relation queries the response was YES. [2022-12-06 00:30:57,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19442 conditions, 2076 events. 1125/2076 cut-off events. For 60820/60820 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 12841 event pairs, 333 based on Foata normal form. 19/2085 useless extension candidates. Maximal degree in co-relation 18562. Up to 1510 conditions per place. [2022-12-06 00:30:57,888 INFO L137 encePairwiseOnDemand]: 11/56 looper letters, 156 selfloop transitions, 112 changer transitions 7/275 dead transitions. [2022-12-06 00:30:57,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 275 transitions, 5814 flow [2022-12-06 00:30:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:30:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:30:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 141 transitions. [2022-12-06 00:30:57,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15736607142857142 [2022-12-06 00:30:57,890 INFO L175 Difference]: Start difference. First operand has 153 places, 189 transitions, 3779 flow. Second operand 16 states and 141 transitions. [2022-12-06 00:30:57,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 275 transitions, 5814 flow [2022-12-06 00:30:57,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 275 transitions, 5757 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 00:30:58,000 INFO L231 Difference]: Finished difference. Result has 175 places, 223 transitions, 5088 flow [2022-12-06 00:30:58,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3722, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5088, PETRI_PLACES=175, PETRI_TRANSITIONS=223} [2022-12-06 00:30:58,000 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 154 predicate places. [2022-12-06 00:30:58,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:58,000 INFO L89 Accepts]: Start accepts. Operand has 175 places, 223 transitions, 5088 flow [2022-12-06 00:30:58,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:58,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:58,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 223 transitions, 5088 flow [2022-12-06 00:30:58,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 223 transitions, 5088 flow [2022-12-06 00:30:58,087 INFO L130 PetriNetUnfolder]: 217/728 cut-off events. [2022-12-06 00:30:58,087 INFO L131 PetriNetUnfolder]: For 23077/23217 co-relation queries the response was YES. [2022-12-06 00:30:58,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6996 conditions, 728 events. 217/728 cut-off events. For 23077/23217 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5676 event pairs, 34 based on Foata normal form. 20/719 useless extension candidates. Maximal degree in co-relation 6663. Up to 225 conditions per place. [2022-12-06 00:30:58,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 223 transitions, 5088 flow [2022-12-06 00:30:58,095 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 00:30:58,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:30:58,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [679] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_288| v_~f~0.base_198))) (let ((.cse0 (* 2 (mod v_~n~0_205 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_198 (* v_~x1~0_370 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_291| 1) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|) (= |v_thread1Thread1of1ForFork0_~i~0#1_289| (+ |v_thread1Thread1of1ForFork0_~i~0#1_291| 2)) (= v_~x1~0_368 (select .cse1 (+ v_~f~0.offset_198 (* .cse2 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_291| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210| 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_206)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|) (not (= (ite (and (<= 0 v_~x1~0_370) (< v_~x1~0_370 v_~size~0_206)) 1 0) 0))))) InVars {~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_198, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_291|, #memory_int=|v_#memory_int_288|, ~n~0=v_~n~0_205, ~x1~0=v_~x1~0_370, ~f~0.offset=v_~f~0.offset_198} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_212|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_194|, ~size~0=v_~size~0_206, ~f~0.base=v_~f~0.base_198, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_289|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_210|, #memory_int=|v_#memory_int_288|, ~n~0=v_~n~0_205, ~x1~0=v_~x1~0_368, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_220|, ~f~0.offset=v_~f~0.offset_198} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:30:58,553 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:30:58,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 554 [2022-12-06 00:30:58,554 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 223 transitions, 5114 flow [2022-12-06 00:30:58,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:58,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:58,554 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:58,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 00:30:58,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 00:30:58,760 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash 496157650, now seen corresponding path program 1 times [2022-12-06 00:30:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:58,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736361557] [2022-12-06 00:30:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:30:58,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:58,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736361557] [2022-12-06 00:30:58,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736361557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:58,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634812805] [2022-12-06 00:30:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:58,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:58,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:58,851 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:58,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 00:30:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:58,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:30:58,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:30:58,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:30:59,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634812805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:59,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:59,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 00:30:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788864276] [2022-12-06 00:30:59,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:59,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:30:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:30:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:30:59,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:30:59,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 223 transitions, 5114 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:59,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:59,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:30:59,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:59,764 INFO L130 PetriNetUnfolder]: 1217/2245 cut-off events. [2022-12-06 00:30:59,764 INFO L131 PetriNetUnfolder]: For 71350/71350 co-relation queries the response was YES. [2022-12-06 00:30:59,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22070 conditions, 2245 events. 1217/2245 cut-off events. For 71350/71350 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 14078 event pairs, 331 based on Foata normal form. 26/2261 useless extension candidates. Maximal degree in co-relation 20772. Up to 1556 conditions per place. [2022-12-06 00:30:59,779 INFO L137 encePairwiseOnDemand]: 25/59 looper letters, 203 selfloop transitions, 68 changer transitions 0/271 dead transitions. [2022-12-06 00:30:59,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 271 transitions, 6397 flow [2022-12-06 00:30:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:30:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:30:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-06 00:30:59,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2768361581920904 [2022-12-06 00:30:59,780 INFO L175 Difference]: Start difference. First operand has 175 places, 223 transitions, 5114 flow. Second operand 6 states and 98 transitions. [2022-12-06 00:30:59,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 271 transitions, 6397 flow [2022-12-06 00:30:59,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 271 transitions, 5739 flow, removed 312 selfloop flow, removed 3 redundant places. [2022-12-06 00:30:59,956 INFO L231 Difference]: Finished difference. Result has 178 places, 227 transitions, 4724 flow [2022-12-06 00:30:59,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4500, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4724, PETRI_PLACES=178, PETRI_TRANSITIONS=227} [2022-12-06 00:30:59,957 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2022-12-06 00:30:59,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:59,957 INFO L89 Accepts]: Start accepts. Operand has 178 places, 227 transitions, 4724 flow [2022-12-06 00:30:59,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:59,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:59,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions, 4724 flow [2022-12-06 00:30:59,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions, 4724 flow [2022-12-06 00:31:00,048 INFO L130 PetriNetUnfolder]: 233/778 cut-off events. [2022-12-06 00:31:00,048 INFO L131 PetriNetUnfolder]: For 22523/22721 co-relation queries the response was YES. [2022-12-06 00:31:00,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 778 events. 233/778 cut-off events. For 22523/22721 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6144 event pairs, 38 based on Foata normal form. 20/764 useless extension candidates. Maximal degree in co-relation 6617. Up to 227 conditions per place. [2022-12-06 00:31:00,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 227 transitions, 4724 flow [2022-12-06 00:31:00,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-06 00:31:00,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:00,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 773 [2022-12-06 00:31:00,730 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 227 transitions, 4743 flow [2022-12-06 00:31:00,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:00,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:00,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:00,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:00,931 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,SelfDestructingSolverStorable39 [2022-12-06 00:31:00,931 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1869178353, now seen corresponding path program 1 times [2022-12-06 00:31:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:00,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167509588] [2022-12-06 00:31:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:02,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:02,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167509588] [2022-12-06 00:31:02,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167509588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:02,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:02,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:31:02,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762528208] [2022-12-06 00:31:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:02,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:31:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:31:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:31:02,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:31:02,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 227 transitions, 4743 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:02,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:02,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:31:02,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:03,432 INFO L130 PetriNetUnfolder]: 1249/2303 cut-off events. [2022-12-06 00:31:03,433 INFO L131 PetriNetUnfolder]: For 67765/67765 co-relation queries the response was YES. [2022-12-06 00:31:03,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21779 conditions, 2303 events. 1249/2303 cut-off events. For 67765/67765 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14630 event pairs, 440 based on Foata normal form. 1/2294 useless extension candidates. Maximal degree in co-relation 20437. Up to 2184 conditions per place. [2022-12-06 00:31:03,458 INFO L137 encePairwiseOnDemand]: 21/59 looper letters, 186 selfloop transitions, 55 changer transitions 3/244 dead transitions. [2022-12-06 00:31:03,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 244 transitions, 5495 flow [2022-12-06 00:31:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:31:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:31:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 00:31:03,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3220338983050847 [2022-12-06 00:31:03,459 INFO L175 Difference]: Start difference. First operand has 178 places, 227 transitions, 4743 flow. Second operand 4 states and 76 transitions. [2022-12-06 00:31:03,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 244 transitions, 5495 flow [2022-12-06 00:31:03,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 244 transitions, 5321 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-06 00:31:03,630 INFO L231 Difference]: Finished difference. Result has 178 places, 231 transitions, 4880 flow [2022-12-06 00:31:03,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4569, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4880, PETRI_PLACES=178, PETRI_TRANSITIONS=231} [2022-12-06 00:31:03,631 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2022-12-06 00:31:03,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:03,631 INFO L89 Accepts]: Start accepts. Operand has 178 places, 231 transitions, 4880 flow [2022-12-06 00:31:03,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:03,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:03,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 231 transitions, 4880 flow [2022-12-06 00:31:03,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 231 transitions, 4880 flow [2022-12-06 00:31:03,738 INFO L130 PetriNetUnfolder]: 240/795 cut-off events. [2022-12-06 00:31:03,738 INFO L131 PetriNetUnfolder]: For 23161/23347 co-relation queries the response was YES. [2022-12-06 00:31:03,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7358 conditions, 795 events. 240/795 cut-off events. For 23161/23347 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6326 event pairs, 39 based on Foata normal form. 16/775 useless extension candidates. Maximal degree in co-relation 6894. Up to 232 conditions per place. [2022-12-06 00:31:03,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 231 transitions, 4880 flow [2022-12-06 00:31:03,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 770 [2022-12-06 00:31:03,748 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:03,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 00:31:03,749 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 231 transitions, 4880 flow [2022-12-06 00:31:03,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:03,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:03,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:03,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 00:31:03,749 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash -766060164, now seen corresponding path program 1 times [2022-12-06 00:31:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117220903] [2022-12-06 00:31:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:03,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117220903] [2022-12-06 00:31:03,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117220903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:03,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:03,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:31:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2389898] [2022-12-06 00:31:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:03,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:31:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:31:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:31:03,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:31:03,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 231 transitions, 4880 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:03,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:03,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:31:03,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:04,572 INFO L130 PetriNetUnfolder]: 1318/2522 cut-off events. [2022-12-06 00:31:04,572 INFO L131 PetriNetUnfolder]: For 79385/79385 co-relation queries the response was YES. [2022-12-06 00:31:04,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23744 conditions, 2522 events. 1318/2522 cut-off events. For 79385/79385 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 17147 event pairs, 207 based on Foata normal form. 24/2536 useless extension candidates. Maximal degree in co-relation 22390. Up to 1175 conditions per place. [2022-12-06 00:31:04,599 INFO L137 encePairwiseOnDemand]: 35/59 looper letters, 282 selfloop transitions, 53 changer transitions 4/339 dead transitions. [2022-12-06 00:31:04,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 339 transitions, 7636 flow [2022-12-06 00:31:04,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:31:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:31:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 00:31:04,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2983050847457627 [2022-12-06 00:31:04,600 INFO L175 Difference]: Start difference. First operand has 178 places, 231 transitions, 4880 flow. Second operand 5 states and 88 transitions. [2022-12-06 00:31:04,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 339 transitions, 7636 flow [2022-12-06 00:31:04,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 339 transitions, 7556 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:31:04,816 INFO L231 Difference]: Finished difference. Result has 182 places, 261 transitions, 5624 flow [2022-12-06 00:31:04,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=4779, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5624, PETRI_PLACES=182, PETRI_TRANSITIONS=261} [2022-12-06 00:31:04,816 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 161 predicate places. [2022-12-06 00:31:04,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:04,817 INFO L89 Accepts]: Start accepts. Operand has 182 places, 261 transitions, 5624 flow [2022-12-06 00:31:04,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:04,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:04,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 261 transitions, 5624 flow [2022-12-06 00:31:04,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 261 transitions, 5624 flow [2022-12-06 00:31:04,942 INFO L130 PetriNetUnfolder]: 274/953 cut-off events. [2022-12-06 00:31:04,942 INFO L131 PetriNetUnfolder]: For 31131/31258 co-relation queries the response was YES. [2022-12-06 00:31:04,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9017 conditions, 953 events. 274/953 cut-off events. For 31131/31258 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8064 event pairs, 33 based on Foata normal form. 10/935 useless extension candidates. Maximal degree in co-relation 8534. Up to 265 conditions per place. [2022-12-06 00:31:04,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 261 transitions, 5624 flow [2022-12-06 00:31:04,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 778 [2022-12-06 00:31:04,955 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:31:04,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 00:31:04,956 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 261 transitions, 5624 flow [2022-12-06 00:31:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:04,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:04,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 00:31:04,956 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -851521790, now seen corresponding path program 2 times [2022-12-06 00:31:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:04,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882068904] [2022-12-06 00:31:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:05,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882068904] [2022-12-06 00:31:05,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882068904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335204834] [2022-12-06 00:31:05,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:31:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:05,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:05,049 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:05,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 00:31:05,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:31:05,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:31:05,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 00:31:05,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:05,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:31:05,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:31:05,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:31:05,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:31:05,433 INFO L321 Elim1Store]: treesize reduction 198, result has 12.0 percent of original size [2022-12-06 00:31:05,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 127 treesize of output 80 [2022-12-06 00:31:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:05,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:06,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335204834] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:06,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:06,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-06 00:31:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671640446] [2022-12-06 00:31:06,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:06,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:31:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:06,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:31:06,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=93, Unknown=3, NotChecked=0, Total=132 [2022-12-06 00:31:06,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 59 [2022-12-06 00:31:06,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 261 transitions, 5624 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:06,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:06,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 59 [2022-12-06 00:31:06,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:29,553 WARN L233 SmtUtils]: Spent 22.49s on a formula simplification. DAG size of input: 172 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:31:32,447 INFO L130 PetriNetUnfolder]: 1307/2500 cut-off events. [2022-12-06 00:31:32,447 INFO L131 PetriNetUnfolder]: For 80503/80503 co-relation queries the response was YES. [2022-12-06 00:31:32,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24510 conditions, 2500 events. 1307/2500 cut-off events. For 80503/80503 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16834 event pairs, 414 based on Foata normal form. 4/2494 useless extension candidates. Maximal degree in co-relation 23099. Up to 1994 conditions per place. [2022-12-06 00:31:32,467 INFO L137 encePairwiseOnDemand]: 13/59 looper letters, 199 selfloop transitions, 101 changer transitions 23/323 dead transitions. [2022-12-06 00:31:32,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 323 transitions, 7093 flow [2022-12-06 00:31:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:31:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:31:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2022-12-06 00:31:32,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17209908735332463 [2022-12-06 00:31:32,468 INFO L175 Difference]: Start difference. First operand has 182 places, 261 transitions, 5624 flow. Second operand 13 states and 132 transitions. [2022-12-06 00:31:32,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 323 transitions, 7093 flow [2022-12-06 00:31:32,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 323 transitions, 6925 flow, removed 84 selfloop flow, removed 0 redundant places. [2022-12-06 00:31:32,660 INFO L231 Difference]: Finished difference. Result has 195 places, 261 transitions, 5751 flow [2022-12-06 00:31:32,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=5512, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5751, PETRI_PLACES=195, PETRI_TRANSITIONS=261} [2022-12-06 00:31:32,660 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 174 predicate places. [2022-12-06 00:31:32,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:32,661 INFO L89 Accepts]: Start accepts. Operand has 195 places, 261 transitions, 5751 flow [2022-12-06 00:31:32,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:32,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:32,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 261 transitions, 5751 flow [2022-12-06 00:31:32,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 261 transitions, 5751 flow [2022-12-06 00:31:32,785 INFO L130 PetriNetUnfolder]: 269/935 cut-off events. [2022-12-06 00:31:32,785 INFO L131 PetriNetUnfolder]: For 30060/30192 co-relation queries the response was YES. [2022-12-06 00:31:32,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8934 conditions, 935 events. 269/935 cut-off events. For 30060/30192 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7855 event pairs, 35 based on Foata normal form. 16/923 useless extension candidates. Maximal degree in co-relation 8448. Up to 257 conditions per place. [2022-12-06 00:31:32,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 261 transitions, 5751 flow [2022-12-06 00:31:32,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 778 [2022-12-06 00:31:32,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_309| v_~f~0.base_212))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_212 (* v_~x2~0_297 4)))) (.cse9 (select .cse3 (+ v_~f~0.offset_212 (* v_~x1~0_409 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_212 (* .cse9 4)))) (.cse10 (select .cse3 (+ v_~f~0.offset_212 (* .cse1 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_212 (* .cse10 4)))) (.cse6 (select .cse3 (+ v_~f~0.offset_212 (* .cse2 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_212 (* .cse6 4)))) (.cse5 (select .cse3 (+ v_~f~0.offset_212 (* .cse0 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_212 (* .cse5 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_212 (* .cse7 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_326| 6) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187| 0)) (not (= (ite (and (< v_~x1~0_409 v_~size~0_220) (<= 0 v_~x1~0_409)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187|) (not (= (ite (and (< .cse0 v_~size~0_220) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_220) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_220) (<= 0 .cse2)) 1 0) 0)) (= v_~x1~0_407 (select .cse3 (+ v_~f~0.offset_212 (* 4 .cse4)))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_220)) 1 0) 0)) (not (= 0 (ite (and (< .cse6 v_~size~0_220) (<= 0 .cse6)) 1 0))) (not (= (ite (and (< .cse7 v_~size~0_220) (<= 0 .cse7)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235| 0)) (= (ite (and (< .cse8 v_~size~0_220) (<= 0 .cse8)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163|) (not (= (ite (and (< .cse9 v_~size~0_220) (<= 0 .cse9)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_212 (* .cse8 4))) v_~x2~0_295) (not (= (ite (and (< .cse10 v_~size~0_220) (<= 0 .cse10)) 1 0) 0)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_220)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_219|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_219| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_228|) (not (= (ite (and (< v_~x2~0_297 v_~size~0_220) (<= 0 v_~x2~0_297)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_326| 4294967295) 4294967296) (* (mod v_~n~0_219 2147483648) 2))))))))) InVars {~x2~0=v_~x2~0_297, ~size~0=v_~size~0_220, ~f~0.base=v_~f~0.base_212, #memory_int=|v_#memory_int_309|, ~n~0=v_~n~0_219, ~x1~0=v_~x1~0_409, ~f~0.offset=v_~f~0.offset_212} OutVars{~x2~0=v_~x2~0_295, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_237|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_149|, ~size~0=v_~size~0_220, ~f~0.base=v_~f~0.base_212, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_153|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_228|, ~x1~0=v_~x1~0_407, ~f~0.offset=v_~f~0.offset_212, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_219|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_326|, #memory_int=|v_#memory_int_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_235|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_139|, ~n~0=v_~n~0_219, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_139|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_245|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:31:34,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:34,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1808 [2022-12-06 00:31:34,469 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 261 transitions, 5783 flow [2022-12-06 00:31:34,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:34,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:34,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:34,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:34,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:34,676 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash 160914370, now seen corresponding path program 1 times [2022-12-06 00:31:34,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:34,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999532406] [2022-12-06 00:31:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:34,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999532406] [2022-12-06 00:31:34,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999532406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:34,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:34,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:31:34,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866958487] [2022-12-06 00:31:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:34,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:31:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:34,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:31:34,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:31:34,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 00:31:34,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 261 transitions, 5783 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:34,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:34,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 00:31:34,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:35,449 INFO L130 PetriNetUnfolder]: 1377/2641 cut-off events. [2022-12-06 00:31:35,450 INFO L131 PetriNetUnfolder]: For 88027/88027 co-relation queries the response was YES. [2022-12-06 00:31:35,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26052 conditions, 2641 events. 1377/2641 cut-off events. For 88027/88027 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 17913 event pairs, 520 based on Foata normal form. 4/2635 useless extension candidates. Maximal degree in co-relation 24462. Up to 2166 conditions per place. [2022-12-06 00:31:35,471 INFO L137 encePairwiseOnDemand]: 39/61 looper letters, 242 selfloop transitions, 65 changer transitions 3/310 dead transitions. [2022-12-06 00:31:35,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 310 transitions, 7232 flow [2022-12-06 00:31:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:31:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:31:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-06 00:31:35,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25136612021857924 [2022-12-06 00:31:35,472 INFO L175 Difference]: Start difference. First operand has 195 places, 261 transitions, 5783 flow. Second operand 6 states and 92 transitions. [2022-12-06 00:31:35,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 310 transitions, 7232 flow [2022-12-06 00:31:35,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 310 transitions, 6979 flow, removed 55 selfloop flow, removed 8 redundant places. [2022-12-06 00:31:35,668 INFO L231 Difference]: Finished difference. Result has 194 places, 271 transitions, 5951 flow [2022-12-06 00:31:35,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=5532, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5951, PETRI_PLACES=194, PETRI_TRANSITIONS=271} [2022-12-06 00:31:35,669 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 173 predicate places. [2022-12-06 00:31:35,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:35,669 INFO L89 Accepts]: Start accepts. Operand has 194 places, 271 transitions, 5951 flow [2022-12-06 00:31:35,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:35,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:35,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 271 transitions, 5951 flow [2022-12-06 00:31:35,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 271 transitions, 5951 flow [2022-12-06 00:31:35,811 INFO L130 PetriNetUnfolder]: 282/996 cut-off events. [2022-12-06 00:31:35,811 INFO L131 PetriNetUnfolder]: For 35009/35175 co-relation queries the response was YES. [2022-12-06 00:31:35,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9644 conditions, 996 events. 282/996 cut-off events. For 35009/35175 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8512 event pairs, 38 based on Foata normal form. 19/983 useless extension candidates. Maximal degree in co-relation 8997. Up to 272 conditions per place. [2022-12-06 00:31:35,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 271 transitions, 5951 flow [2022-12-06 00:31:35,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-06 00:31:35,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:31:36,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:31:36,132 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:36,132 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-06 00:31:36,132 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 272 transitions, 6005 flow [2022-12-06 00:31:36,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:36,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:36,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:36,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 00:31:36,133 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash -115552012, now seen corresponding path program 1 times [2022-12-06 00:31:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:36,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433349451] [2022-12-06 00:31:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:36,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433349451] [2022-12-06 00:31:36,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433349451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:36,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289759543] [2022-12-06 00:31:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:36,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:36,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:36,218 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:36,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 00:31:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:36,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 00:31:36,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:36,567 INFO L321 Elim1Store]: treesize reduction 198, result has 12.0 percent of original size [2022-12-06 00:31:36,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 213 treesize of output 86 [2022-12-06 00:31:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:36,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:39,758 INFO L321 Elim1Store]: treesize reduction 30, result has 96.4 percent of original size [2022-12-06 00:31:39,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 26 new quantified variables, introduced 91 case distinctions, treesize of input 744 treesize of output 966 [2022-12-06 00:32:02,487 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-06 00:32:04,186 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-06 00:32:32,828 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:32:39,388 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:32:41,646 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:32:51,263 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:32:51,631 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:32:51,953 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:32:55,600 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:33:00,192 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 00:33:22,826 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 00:33:38,328 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:33:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:33:59,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289759543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:33:59,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:33:59,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-12-06 00:33:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11288700] [2022-12-06 00:33:59,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:33:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:33:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:33:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:33:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:33:59,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 00:33:59,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 272 transitions, 6005 flow. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:33:59,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:33:59,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 00:33:59,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:00,390 INFO L130 PetriNetUnfolder]: 1462/2792 cut-off events. [2022-12-06 00:34:00,390 INFO L131 PetriNetUnfolder]: For 104342/104342 co-relation queries the response was YES. [2022-12-06 00:34:00,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28512 conditions, 2792 events. 1462/2792 cut-off events. For 104342/104342 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 19051 event pairs, 444 based on Foata normal form. 16/2798 useless extension candidates. Maximal degree in co-relation 26825. Up to 2293 conditions per place. [2022-12-06 00:34:00,410 INFO L137 encePairwiseOnDemand]: 18/63 looper letters, 215 selfloop transitions, 131 changer transitions 8/354 dead transitions. [2022-12-06 00:34:00,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 354 transitions, 8111 flow [2022-12-06 00:34:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:34:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:34:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2022-12-06 00:34:00,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16605616605616605 [2022-12-06 00:34:00,411 INFO L175 Difference]: Start difference. First operand has 194 places, 272 transitions, 6005 flow. Second operand 13 states and 136 transitions. [2022-12-06 00:34:00,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 354 transitions, 8111 flow [2022-12-06 00:34:00,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 354 transitions, 8055 flow, removed 28 selfloop flow, removed 0 redundant places. [2022-12-06 00:34:00,612 INFO L231 Difference]: Finished difference. Result has 211 places, 300 transitions, 7107 flow [2022-12-06 00:34:00,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=5918, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7107, PETRI_PLACES=211, PETRI_TRANSITIONS=300} [2022-12-06 00:34:00,613 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 190 predicate places. [2022-12-06 00:34:00,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:00,613 INFO L89 Accepts]: Start accepts. Operand has 211 places, 300 transitions, 7107 flow [2022-12-06 00:34:00,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:00,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:00,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 300 transitions, 7107 flow [2022-12-06 00:34:00,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 300 transitions, 7107 flow [2022-12-06 00:34:00,754 INFO L130 PetriNetUnfolder]: 305/1064 cut-off events. [2022-12-06 00:34:00,754 INFO L131 PetriNetUnfolder]: For 41300/41455 co-relation queries the response was YES. [2022-12-06 00:34:00,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10951 conditions, 1064 events. 305/1064 cut-off events. For 41300/41455 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9175 event pairs, 39 based on Foata normal form. 19/1053 useless extension candidates. Maximal degree in co-relation 10291. Up to 291 conditions per place. [2022-12-06 00:34:00,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 300 transitions, 7107 flow [2022-12-06 00:34:00,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 910 [2022-12-06 00:34:00,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_302| v_~f~0.base_206))) (let ((.cse0 (* 2 (mod v_~n~0_213 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_206 (* v_~x1~0_392 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_309| 4294967295) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_392 v_~size~0_214) (<= 0 v_~x1~0_392)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= v_~x1~0_390 (select .cse1 (+ v_~f~0.offset_206 (* .cse2 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_311| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_214)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_311| 2) |v_thread1Thread1of1ForFork0_~i~0#1_309|)))) InVars {~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_206, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_311|, #memory_int=|v_#memory_int_302|, ~n~0=v_~n~0_213, ~x1~0=v_~x1~0_392, ~f~0.offset=v_~f~0.offset_206} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_226|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_206, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, #memory_int=|v_#memory_int_302|, ~n~0=v_~n~0_213, ~x1~0=v_~x1~0_390, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_234|, ~f~0.offset=v_~f~0.offset_206} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:34:01,157 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [671] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_280| v_~f~0.base_190))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_190 (* v_~x1~0_344 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_190 (* .cse3 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_190 (* v_~x2~0_266 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse5)))) (.cse4 (select .cse0 (+ v_~f~0.offset_190 (* .cse7 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_190 (* .cse4 4)))) (.cse1 (select .cse0 (+ v_~f~0.offset_190 (* .cse6 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_192| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_203| 4) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_168| 0)) (= v_~x2~0_265 (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse1)))) (= (select .cse0 (+ v_~f~0.offset_190 (* 4 .cse2))) v_~x1~0_342) (not (= (ite (and (<= 0 v_~x1~0_344) (< v_~x1~0_344 v_~size~0_198)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_168|) (not (= (ite (and (< .cse3 v_~size~0_198) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_264| 5) (not (= (ite (and (< .cse4 v_~size~0_198) (<= 0 .cse4)) 1 0) 0)) (not (= 0 (ite (and (< .cse5 v_~size~0_198) (<= 0 .cse5)) 1 0))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_264| 4294967295) 4294967296) (* (mod v_~n~0_197 2147483648) 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176| (ite (and (< .cse2 v_~size~0_198) (<= 0 .cse2)) 1 0)) (not (= 0 (ite (and (<= 0 v_~x2~0_266) (< v_~x2~0_266 v_~size~0_198)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_198)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_192|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_198)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_198)) 1 0))))))))) InVars {~x2~0=v_~x2~0_266, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_190, #memory_int=|v_#memory_int_280|, ~n~0=v_~n~0_197, ~x1~0=v_~x1~0_344, ~f~0.offset=v_~f~0.offset_190} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_194|, ~x2~0=v_~x2~0_265, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_130|, ~size~0=v_~size~0_198, ~f~0.base=v_~f~0.base_190, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_134|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_203|, ~x1~0=v_~x1~0_342, ~f~0.offset=v_~f~0.offset_190, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_168|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_176|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_264|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_192|, #memory_int=|v_#memory_int_280|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_120|, ~n~0=v_~n~0_197, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_202|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_120|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 00:34:02,617 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:34:02,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2005 [2022-12-06 00:34:02,618 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 300 transitions, 7165 flow [2022-12-06 00:34:02,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:02,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:02,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:02,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 00:34:02,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:02,824 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash -699149452, now seen corresponding path program 2 times [2022-12-06 00:34:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:02,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089417503] [2022-12-06 00:34:02,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:02,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:02,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:02,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089417503] [2022-12-06 00:34:02,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089417503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:34:02,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:34:02,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:34:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750122727] [2022-12-06 00:34:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:34:02,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:34:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:34:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:34:02,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 00:34:02,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 300 transitions, 7165 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:02,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:02,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 00:34:02,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:03,642 INFO L130 PetriNetUnfolder]: 1465/2795 cut-off events. [2022-12-06 00:34:03,642 INFO L131 PetriNetUnfolder]: For 112785/112785 co-relation queries the response was YES. [2022-12-06 00:34:03,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30115 conditions, 2795 events. 1465/2795 cut-off events. For 112785/112785 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 18968 event pairs, 508 based on Foata normal form. 8/2793 useless extension candidates. Maximal degree in co-relation 28432. Up to 2074 conditions per place. [2022-12-06 00:34:03,663 INFO L137 encePairwiseOnDemand]: 20/65 looper letters, 197 selfloop transitions, 140 changer transitions 5/342 dead transitions. [2022-12-06 00:34:03,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 342 transitions, 8609 flow [2022-12-06 00:34:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:34:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:34:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2022-12-06 00:34:03,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2153846153846154 [2022-12-06 00:34:03,664 INFO L175 Difference]: Start difference. First operand has 211 places, 300 transitions, 7165 flow. Second operand 7 states and 98 transitions. [2022-12-06 00:34:03,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 342 transitions, 8609 flow [2022-12-06 00:34:03,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 342 transitions, 8057 flow, removed 233 selfloop flow, removed 3 redundant places. [2022-12-06 00:34:03,929 INFO L231 Difference]: Finished difference. Result has 216 places, 307 transitions, 7211 flow [2022-12-06 00:34:03,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=6669, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7211, PETRI_PLACES=216, PETRI_TRANSITIONS=307} [2022-12-06 00:34:03,929 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 195 predicate places. [2022-12-06 00:34:03,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:03,929 INFO L89 Accepts]: Start accepts. Operand has 216 places, 307 transitions, 7211 flow [2022-12-06 00:34:03,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:03,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:03,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 307 transitions, 7211 flow [2022-12-06 00:34:03,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 307 transitions, 7211 flow [2022-12-06 00:34:04,090 INFO L130 PetriNetUnfolder]: 311/1074 cut-off events. [2022-12-06 00:34:04,091 INFO L131 PetriNetUnfolder]: For 40205/40369 co-relation queries the response was YES. [2022-12-06 00:34:04,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11085 conditions, 1074 events. 311/1074 cut-off events. For 40205/40369 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9221 event pairs, 36 based on Foata normal form. 24/1068 useless extension candidates. Maximal degree in co-relation 10750. Up to 292 conditions per place. [2022-12-06 00:34:04,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 307 transitions, 7211 flow [2022-12-06 00:34:04,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 922 [2022-12-06 00:34:04,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [576] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_10| 4294967296) (* 2 (mod v_~n~0_In_5 2147483648)))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_10|, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:04,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:34:04,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-06 00:34:04,208 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 306 transitions, 7209 flow [2022-12-06 00:34:04,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:04,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:04,208 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:04,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 00:34:04,209 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -288095408, now seen corresponding path program 2 times [2022-12-06 00:34:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:04,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257974438] [2022-12-06 00:34:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:04,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:34:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:04,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257974438] [2022-12-06 00:34:04,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257974438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:34:04,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:34:04,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:34:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617635870] [2022-12-06 00:34:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:34:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:34:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:34:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:34:04,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 00:34:04,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 306 transitions, 7209 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:04,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:04,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 00:34:04,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:04,956 INFO L130 PetriNetUnfolder]: 1463/2787 cut-off events. [2022-12-06 00:34:04,956 INFO L131 PetriNetUnfolder]: For 110599/110599 co-relation queries the response was YES. [2022-12-06 00:34:04,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29963 conditions, 2787 events. 1463/2787 cut-off events. For 110599/110599 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18838 event pairs, 576 based on Foata normal form. 16/2793 useless extension candidates. Maximal degree in co-relation 28740. Up to 2310 conditions per place. [2022-12-06 00:34:04,976 INFO L137 encePairwiseOnDemand]: 41/66 looper letters, 253 selfloop transitions, 80 changer transitions 0/333 dead transitions. [2022-12-06 00:34:04,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 333 transitions, 8334 flow [2022-12-06 00:34:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:34:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:34:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 00:34:04,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2878787878787879 [2022-12-06 00:34:04,977 INFO L175 Difference]: Start difference. First operand has 214 places, 306 transitions, 7209 flow. Second operand 5 states and 95 transitions. [2022-12-06 00:34:04,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 333 transitions, 8334 flow [2022-12-06 00:34:05,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 333 transitions, 8227 flow, removed 30 selfloop flow, removed 2 redundant places. [2022-12-06 00:34:05,206 INFO L231 Difference]: Finished difference. Result has 217 places, 307 transitions, 7326 flow [2022-12-06 00:34:05,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=7102, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7326, PETRI_PLACES=217, PETRI_TRANSITIONS=307} [2022-12-06 00:34:05,207 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 196 predicate places. [2022-12-06 00:34:05,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:05,207 INFO L89 Accepts]: Start accepts. Operand has 217 places, 307 transitions, 7326 flow [2022-12-06 00:34:05,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:05,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:05,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 307 transitions, 7326 flow [2022-12-06 00:34:05,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 307 transitions, 7326 flow [2022-12-06 00:34:05,337 INFO L130 PetriNetUnfolder]: 312/1076 cut-off events. [2022-12-06 00:34:05,337 INFO L131 PetriNetUnfolder]: For 41203/41353 co-relation queries the response was YES. [2022-12-06 00:34:05,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11213 conditions, 1076 events. 312/1076 cut-off events. For 41203/41353 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9240 event pairs, 34 based on Foata normal form. 22/1070 useless extension candidates. Maximal degree in co-relation 10735. Up to 290 conditions per place. [2022-12-06 00:34:05,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 307 transitions, 7326 flow [2022-12-06 00:34:05,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 922 [2022-12-06 00:34:05,350 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:34:05,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 00:34:05,351 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 307 transitions, 7326 flow [2022-12-06 00:34:05,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:05,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:05,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:05,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 00:34:05,351 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:05,352 INFO L85 PathProgramCache]: Analyzing trace with hash -780764025, now seen corresponding path program 1 times [2022-12-06 00:34:05,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:05,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258221403] [2022-12-06 00:34:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:05,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258221403] [2022-12-06 00:34:05,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258221403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:34:05,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:34:05,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:34:05,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983170320] [2022-12-06 00:34:05,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:34:05,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:34:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:34:05,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:34:05,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 00:34:05,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 307 transitions, 7326 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:05,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:05,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 00:34:05,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:06,126 INFO L130 PetriNetUnfolder]: 1463/2794 cut-off events. [2022-12-06 00:34:06,126 INFO L131 PetriNetUnfolder]: For 111145/111145 co-relation queries the response was YES. [2022-12-06 00:34:06,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30207 conditions, 2794 events. 1463/2794 cut-off events. For 111145/111145 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 18950 event pairs, 681 based on Foata normal form. 2/2786 useless extension candidates. Maximal degree in co-relation 28991. Up to 2772 conditions per place. [2022-12-06 00:34:06,155 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 306 selfloop transitions, 5 changer transitions 6/317 dead transitions. [2022-12-06 00:34:06,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 317 transitions, 8086 flow [2022-12-06 00:34:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:34:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:34:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-06 00:34:06,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24545454545454545 [2022-12-06 00:34:06,156 INFO L175 Difference]: Start difference. First operand has 217 places, 307 transitions, 7326 flow. Second operand 5 states and 81 transitions. [2022-12-06 00:34:06,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 317 transitions, 8086 flow [2022-12-06 00:34:06,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 317 transitions, 7925 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 00:34:06,482 INFO L231 Difference]: Finished difference. Result has 219 places, 306 transitions, 7151 flow [2022-12-06 00:34:06,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=7165, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7151, PETRI_PLACES=219, PETRI_TRANSITIONS=306} [2022-12-06 00:34:06,482 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 198 predicate places. [2022-12-06 00:34:06,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:06,483 INFO L89 Accepts]: Start accepts. Operand has 219 places, 306 transitions, 7151 flow [2022-12-06 00:34:06,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:06,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:06,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 306 transitions, 7151 flow [2022-12-06 00:34:06,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 306 transitions, 7151 flow [2022-12-06 00:34:06,618 INFO L130 PetriNetUnfolder]: 309/1064 cut-off events. [2022-12-06 00:34:06,618 INFO L131 PetriNetUnfolder]: For 41140/41293 co-relation queries the response was YES. [2022-12-06 00:34:06,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11026 conditions, 1064 events. 309/1064 cut-off events. For 41140/41293 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9129 event pairs, 36 based on Foata normal form. 19/1054 useless extension candidates. Maximal degree in co-relation 10547. Up to 289 conditions per place. [2022-12-06 00:34:06,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 306 transitions, 7151 flow [2022-12-06 00:34:06,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-06 00:34:06,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:06,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:34:06,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 487 [2022-12-06 00:34:06,970 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 306 transitions, 7169 flow [2022-12-06 00:34:06,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:06,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:06,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:06,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 00:34:06,971 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:06,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash -623591662, now seen corresponding path program 3 times [2022-12-06 00:34:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:06,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603278878] [2022-12-06 00:34:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:06,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:07,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603278878] [2022-12-06 00:34:07,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603278878] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:34:07,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17885016] [2022-12-06 00:34:07,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:34:07,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:34:07,036 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:34:07,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 00:34:07,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 00:34:07,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:34:07,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:34:07,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:34:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:07,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:34:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:07,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17885016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:34:07,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:34:07,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 00:34:07,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144408653] [2022-12-06 00:34:07,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:34:07,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:34:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:34:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:34:07,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 00:34:07,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 306 transitions, 7169 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:07,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:07,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 00:34:07,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:08,149 INFO L130 PetriNetUnfolder]: 1475/2807 cut-off events. [2022-12-06 00:34:08,149 INFO L131 PetriNetUnfolder]: For 107846/107846 co-relation queries the response was YES. [2022-12-06 00:34:08,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30170 conditions, 2807 events. 1475/2807 cut-off events. For 107846/107846 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 18963 event pairs, 221 based on Foata normal form. 4/2801 useless extension candidates. Maximal degree in co-relation 28953. Up to 1969 conditions per place. [2022-12-06 00:34:08,173 INFO L137 encePairwiseOnDemand]: 21/67 looper letters, 241 selfloop transitions, 122 changer transitions 2/365 dead transitions. [2022-12-06 00:34:08,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 365 transitions, 8892 flow [2022-12-06 00:34:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:34:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:34:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-12-06 00:34:08,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14676616915422885 [2022-12-06 00:34:08,179 INFO L175 Difference]: Start difference. First operand has 218 places, 306 transitions, 7169 flow. Second operand 12 states and 118 transitions. [2022-12-06 00:34:08,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 365 transitions, 8892 flow [2022-12-06 00:34:08,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 365 transitions, 8866 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 00:34:08,428 INFO L231 Difference]: Finished difference. Result has 228 places, 310 transitions, 7553 flow [2022-12-06 00:34:08,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=7147, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7553, PETRI_PLACES=228, PETRI_TRANSITIONS=310} [2022-12-06 00:34:08,429 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 207 predicate places. [2022-12-06 00:34:08,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:08,429 INFO L89 Accepts]: Start accepts. Operand has 228 places, 310 transitions, 7553 flow [2022-12-06 00:34:08,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:08,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:08,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 310 transitions, 7553 flow [2022-12-06 00:34:08,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 310 transitions, 7553 flow [2022-12-06 00:34:08,569 INFO L130 PetriNetUnfolder]: 312/1067 cut-off events. [2022-12-06 00:34:08,569 INFO L131 PetriNetUnfolder]: For 42537/42721 co-relation queries the response was YES. [2022-12-06 00:34:08,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11310 conditions, 1067 events. 312/1067 cut-off events. For 42537/42721 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9150 event pairs, 36 based on Foata normal form. 25/1062 useless extension candidates. Maximal degree in co-relation 10825. Up to 288 conditions per place. [2022-12-06 00:34:08,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 310 transitions, 7553 flow [2022-12-06 00:34:08,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 940 [2022-12-06 00:34:08,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:08,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:09,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:09,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:09,353 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:09,492 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:09,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:09,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:10,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:10,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:10,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:10,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:10,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:10,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:10,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:11,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_276| v_~f~0.base_186))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_186 (* v_~x1~0_335 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_186 (* v_~x2~0_258 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_186 (* .cse2 4)))) (.cse0 (* 2 (mod v_~n~0_193 2147483648)))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_256| 4294967295) 4294967296) .cse0) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_196|) |v_thread2Thread1of1ForFork1_~i~1#1_195|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_194)) 1 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_194)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_335 v_~size~0_194) (<= 0 v_~x1~0_335)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_256| (+ |v_thread1Thread1of1ForFork0_~i~0#1_257| 3)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164| 0)) (= v_~x1~0_334 (select .cse3 (+ v_~f~0.offset_186 (* .cse4 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188| 0)) (not (= (ite (and (<= 0 v_~x2~0_258) (< v_~x2~0_258 v_~size~0_194)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_186 (* .cse1 4))) v_~x2~0_257) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_194)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_257| 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_196| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|))))) InVars {~x2~0=v_~x2~0_258, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, #memory_int=|v_#memory_int_276|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_196|, ~n~0=v_~n~0_193, ~x1~0=v_~x1~0_335, ~f~0.offset=v_~f~0.offset_186} OutVars{~x2~0=v_~x2~0_257, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_190|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_126|, ~size~0=v_~size~0_194, ~f~0.base=v_~f~0.base_186, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_195|, ~x1~0=v_~x1~0_334, ~f~0.offset=v_~f~0.offset_186, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_256|, #memory_int=|v_#memory_int_276|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_188|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_116|, ~n~0=v_~n~0_193, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_116|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:11,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_268| v_~f~0.base_178))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_178 (* v_~x2~0_241 4)))) (.cse2 (* (mod v_~n~0_185 2147483648) 2)) (.cse3 (select .cse0 (+ v_~f~0.offset_178 (* v_~x1~0_317 4))))) (and (= (select .cse0 (+ v_~f~0.offset_178 (* .cse1 4))) v_~x2~0_240) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_186)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_239| 4294967296) .cse2) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_179| 4294967296) .cse2) (not (= (ite (and (<= 0 v_~x2~0_241) (< v_~x2~0_241 v_~size~0_186)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_238| 4294967295) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_178| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_179|)) (not (= (ite (and (< v_~x1~0_317 v_~size~0_186) (<= 0 v_~x1~0_317)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_178 (* .cse3 4))) v_~x1~0_316) (= (ite (and (< .cse3 v_~size~0_186) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162|) (= |v_thread1Thread1of1ForFork0_~i~0#1_238| (+ |v_thread1Thread1of1ForFork0_~i~0#1_239| 2))))) InVars {~x2~0=v_~x2~0_241, ~size~0=v_~size~0_186, ~f~0.base=v_~f~0.base_178, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_239|, #memory_int=|v_#memory_int_268|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_179|, ~n~0=v_~n~0_185, ~x1~0=v_~x1~0_317, ~f~0.offset=v_~f~0.offset_178} OutVars{~x2~0=v_~x2~0_240, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_180|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, ~size~0=v_~size~0_186, ~f~0.base=v_~f~0.base_178, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_121|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_178|, ~x1~0=v_~x1~0_316, ~f~0.offset=v_~f~0.offset_178, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_155|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_162|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_238|, #memory_int=|v_#memory_int_268|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_107|, ~n~0=v_~n~0_185, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_107|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_188|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:11,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:12,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [667] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_274| v_~f~0.base_184))) (let ((.cse0 (* 2 (mod v_~n~0_191 2147483648))) (.cse1 (select .cse2 (+ v_~f~0.offset_184 (* v_~x2~0_253 4))))) (and (= (ite (and (< v_~x1~0_329 v_~size~0_192) (<= 0 v_~x1~0_329)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_251| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_253 v_~size~0_192) (<= 0 v_~x2~0_253)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_192) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_191|) |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= |v_thread1Thread1of1ForFork0_~i~0#1_250| (+ |v_thread1Thread1of1ForFork0_~i~0#1_251| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_191| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_184 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|) (= v_~x1~0_328 (select .cse2 (+ v_~f~0.offset_184 (* v_~x1~0_329 4))))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, #memory_int=|v_#memory_int_274|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_329, ~f~0.offset=v_~f~0.offset_184} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_123|, ~size~0=v_~size~0_192, ~f~0.base=v_~f~0.base_184, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_127|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_190|, ~x1~0=v_~x1~0_328, ~f~0.offset=v_~f~0.offset_184, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_161|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_250|, #memory_int=|v_#memory_int_274|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_184|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_113|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_113|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_194|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:12,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:12,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse1 (* (mod v_~n~0_139 2147483648) 2)) (.cse0 (select .cse2 (+ v_~f~0.offset_130 (* v_~x2~0_147 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_147) (< v_~x2~0_147 v_~size~0_140)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_161| 1) |v_thread1Thread1of1ForFork0_~i~0#1_160|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_113| 4294967296) .cse1) (= v_~x1~0_198 (select .cse2 (+ v_~f~0.offset_130 (* v_~x1~0_199 4)))) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_113|) |v_thread2Thread1of1ForFork1_~i~1#1_112|) (= (ite (and (< v_~x1~0_199 v_~size~0_140) (<= 0 v_~x1~0_199)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_161| 4294967296) .cse1) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_130 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0))))) InVars {~x2~0=v_~x2~0_147, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_161|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_113|, ~n~0=v_~n~0_139, ~x1~0=v_~x1~0_199, ~f~0.offset=v_~f~0.offset_130} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~x1~0=v_~x1~0_198, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_51|, ~n~0=v_~n~0_139, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:12,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_205| v_~f~0.base_128))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_128 (* v_~x2~0_143 4)))) (.cse1 (* 2 (mod v_~n~0_137 2147483648)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_138)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_157| 4294967296) .cse1) (= v_~x1~0_194 (select .cse2 (+ v_~f~0.offset_128 (* v_~x1~0_195 4)))) (not (= (ite (and (< v_~x2~0_143 v_~size~0_138) (<= 0 v_~x2~0_143)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_156| (+ |v_thread1Thread1of1ForFork0_~i~0#1_157| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~x1~0_195 v_~size~0_138) (<= 0 v_~x1~0_195)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_109|) |v_thread2Thread1of1ForFork1_~i~1#1_108|) (= (select .cse2 (+ v_~f~0.offset_128 (* .cse0 4))) v_~x2~0_142) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_109| 4294967296) .cse1)))) InVars {~x2~0=v_~x2~0_143, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~n~0=v_~n~0_137, ~x1~0=v_~x1~0_195, ~f~0.offset=v_~f~0.offset_128} OutVars{~x2~0=v_~x2~0_142, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_108|, ~x1~0=v_~x1~0_194, ~f~0.offset=v_~f~0.offset_128, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_205|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_137, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:13,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:13,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [696] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_323| v_~f~0.base_222))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_222 (* v_~x1~0_439 4))))) (let ((.cse0 (* (mod v_~n~0_229 2147483648) 2)) (.cse2 (select .cse1 (+ v_~f~0.offset_222 (* .cse3 4))))) (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_347| 4294967296) .cse0) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_347| 2) 4294967296) .cse0) (not (= 0 (ite (and (<= 0 v_~x1~0_439) (< v_~x1~0_439 v_~size~0_230)) 1 0))) (= |v_thread1Thread1of1ForFork0_~i~0#1_345| (+ |v_thread1Thread1of1ForFork0_~i~0#1_347| 3)) (= v_~x1~0_437 (select .cse1 (+ v_~f~0.offset_222 (* .cse2 4)))) (not (= (ite (and (< .cse3 v_~size~0_230) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254| 0)) (= (ite (and (< .cse2 v_~size~0_230) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254|))))) InVars {~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_222, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_347|, #memory_int=|v_#memory_int_323|, ~n~0=v_~n~0_229, ~x1~0=v_~x1~0_439, ~f~0.offset=v_~f~0.offset_222} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_256|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_238|, ~size~0=v_~size~0_230, ~f~0.base=v_~f~0.base_222, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_345|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_254|, #memory_int=|v_#memory_int_323|, ~n~0=v_~n~0_229, ~x1~0=v_~x1~0_437, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_264|, ~f~0.offset=v_~f~0.offset_222} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:13,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:13,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:13,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_302| v_~f~0.base_206))) (let ((.cse0 (* 2 (mod v_~n~0_213 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_206 (* v_~x1~0_392 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_309| 4294967295) 4294967296) .cse0) (not (= (ite (and (< v_~x1~0_392 v_~size~0_214) (<= 0 v_~x1~0_392)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224| 0)) (= v_~x1~0_390 (select .cse1 (+ v_~f~0.offset_206 (* .cse2 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_311| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_214)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_311| 2) |v_thread1Thread1of1ForFork0_~i~0#1_309|)))) InVars {~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_206, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_311|, #memory_int=|v_#memory_int_302|, ~n~0=v_~n~0_213, ~x1~0=v_~x1~0_392, ~f~0.offset=v_~f~0.offset_206} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_226|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_208|, ~size~0=v_~size~0_214, ~f~0.base=v_~f~0.base_206, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_224|, #memory_int=|v_#memory_int_302|, ~n~0=v_~n~0_213, ~x1~0=v_~x1~0_390, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_234|, ~f~0.offset=v_~f~0.offset_206} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:14,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_248| v_~f~0.base_158))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_158 (* v_~x2~0_199 4)))) (.cse1 (* (mod v_~n~0_165 2147483648) 2))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (and (< .cse0 v_~size~0_166) (<= 0 .cse0)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_199) (< v_~x2~0_199 v_~size~0_166)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_209| 4294967296) .cse1) (= v_~x2~0_198 (select .cse2 (+ v_~f~0.offset_158 (* .cse0 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_208| (+ |v_thread1Thread1of1ForFork0_~i~0#1_209| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|) (= (ite (and (<= 0 v_~x1~0_269) (< v_~x1~0_269 v_~size~0_166)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|) (= |v_thread2Thread1of1ForFork1_~i~1#1_152| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_153|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_153| 4294967296) .cse1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131| 0)) (= (select .cse2 (+ v_~f~0.offset_158 (* v_~x1~0_269 4))) v_~x1~0_268)))) InVars {~x2~0=v_~x2~0_199, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_158, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_209|, #memory_int=|v_#memory_int_248|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_153|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_269, ~f~0.offset=v_~f~0.offset_158} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_152|, ~x2~0=v_~x2~0_198, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_93|, ~size~0=v_~size~0_166, ~f~0.base=v_~f~0.base_158, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_97|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_152|, ~x1~0=v_~x1~0_268, ~f~0.offset=v_~f~0.offset_158, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_131|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_134|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_208|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_150|, #memory_int=|v_#memory_int_248|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_83|, ~n~0=v_~n~0_165, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_160|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_83|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:14,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:14,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_272| v_~f~0.base_182))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_182 (* v_~x2~0_249 4)))) (.cse2 (* (mod v_~n~0_189 2147483648) 2))) (and (= (select .cse0 (+ v_~f~0.offset_182 (* .cse1 4))) v_~x2~0_248) (= v_~x1~0_324 (select .cse0 (+ v_~f~0.offset_182 (* v_~x1~0_325 4)))) (not (= (ite (and (< v_~x2~0_249 v_~size~0_190) (<= 0 v_~x2~0_249)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_247| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| (ite (and (< .cse1 v_~size~0_190) (<= 0 .cse1)) 1 0)) (= (ite (and (< v_~x1~0_325 v_~size~0_190) (<= 0 v_~x1~0_325)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_186|) (= |v_thread1Thread1of1ForFork0_~i~0#1_246| (+ |v_thread1Thread1of1ForFork0_~i~0#1_247| 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|)))) InVars {~x2~0=v_~x2~0_249, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_182, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_247|, #memory_int=|v_#memory_int_272|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_189, ~x1~0=v_~x1~0_325, ~f~0.offset=v_~f~0.offset_182} OutVars{~x2~0=v_~x2~0_248, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_184|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_121|, ~size~0=v_~size~0_190, ~f~0.base=v_~f~0.base_182, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_135|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_186|, ~x1~0=v_~x1~0_324, ~f~0.offset=v_~f~0.offset_182, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_166|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_246|, #memory_int=|v_#memory_int_272|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_182|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_111|, ~n~0=v_~n~0_189, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_111|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_192|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:14,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [665] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_270| v_~f~0.base_180))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_180 (* v_~x1~0_321 4)))) (.cse0 (* 2 (mod v_~n~0_187 2147483648))) (.cse2 (select .cse1 (+ v_~f~0.offset_180 (* v_~x2~0_245 4))))) (and (not (= (ite (and (< v_~x1~0_321 v_~size~0_188) (<= 0 v_~x1~0_321)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_183|) |v_thread2Thread1of1ForFork1_~i~1#1_182|) (= |v_thread1Thread1of1ForFork0_~i~0#1_242| (+ |v_thread1Thread1of1ForFork0_~i~0#1_243| 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_242| 4294967295) 4294967296) .cse0) (= v_~x2~0_244 (select .cse1 (+ v_~f~0.offset_180 (* .cse2 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| (ite (and (< .cse3 v_~size~0_188) (<= 0 .cse3)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_243| 4294967296) .cse0) (= v_~x1~0_320 (select .cse1 (+ v_~f~0.offset_180 (* .cse3 4)))) (not (= (ite (and (< v_~x2~0_245 v_~size~0_188) (<= 0 v_~x2~0_245)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_183| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_188)) 1 0))))) InVars {~x2~0=v_~x2~0_245, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_243|, #memory_int=|v_#memory_int_270|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_183|, ~n~0=v_~n~0_187, ~x1~0=v_~x1~0_321, ~f~0.offset=v_~f~0.offset_180} OutVars{~x2~0=v_~x2~0_244, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_182|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, ~size~0=v_~size~0_188, ~f~0.base=v_~f~0.base_180, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_133|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_182|, ~x1~0=v_~x1~0_320, ~f~0.offset=v_~f~0.offset_180, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_242|, #memory_int=|v_#memory_int_270|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_180|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_109|, ~n~0=v_~n~0_187, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_190|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:15,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [629] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_205| v_~f~0.base_128))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_128 (* v_~x2~0_143 4)))) (.cse1 (* 2 (mod v_~n~0_137 2147483648)))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_138)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_157| 4294967296) .cse1) (= v_~x1~0_194 (select .cse2 (+ v_~f~0.offset_128 (* v_~x1~0_195 4)))) (not (= (ite (and (< v_~x2~0_143 v_~size~0_138) (<= 0 v_~x2~0_143)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_156| (+ |v_thread1Thread1of1ForFork0_~i~0#1_157| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (ite (and (< v_~x1~0_195 v_~size~0_138) (<= 0 v_~x1~0_195)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_109|) |v_thread2Thread1of1ForFork1_~i~1#1_108|) (= (select .cse2 (+ v_~f~0.offset_128 (* .cse0 4))) v_~x2~0_142) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_109| 4294967296) .cse1)))) InVars {~x2~0=v_~x2~0_143, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_109|, ~n~0=v_~n~0_137, ~x1~0=v_~x1~0_195, ~f~0.offset=v_~f~0.offset_128} OutVars{~x2~0=v_~x2~0_142, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~size~0=v_~size~0_138, ~f~0.base=v_~f~0.base_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_63|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_108|, ~x1~0=v_~x1~0_194, ~f~0.offset=v_~f~0.offset_128, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_97|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_90|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_156|, #memory_int=|v_#memory_int_205|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_49|, ~n~0=v_~n~0_137, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_49|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:15,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~f~0.base_130))) (let ((.cse1 (* (mod v_~n~0_139 2147483648) 2)) (.cse0 (select .cse2 (+ v_~f~0.offset_130 (* v_~x2~0_147 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_147) (< v_~x2~0_147 v_~size~0_140)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_140)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_161| 1) |v_thread1Thread1of1ForFork0_~i~0#1_160|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_113| 4294967296) .cse1) (= v_~x1~0_198 (select .cse2 (+ v_~f~0.offset_130 (* v_~x1~0_199 4)))) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_113|) |v_thread2Thread1of1ForFork1_~i~1#1_112|) (= (ite (and (< v_~x1~0_199 v_~size~0_140) (<= 0 v_~x1~0_199)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_161| 4294967296) .cse1) (= v_~x2~0_146 (select .cse2 (+ v_~f~0.offset_130 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99| 0))))) InVars {~x2~0=v_~x2~0_147, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_161|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_113|, ~n~0=v_~n~0_139, ~x1~0=v_~x1~0_199, ~f~0.offset=v_~f~0.offset_130} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~x2~0=v_~x2~0_146, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_140, ~f~0.base=v_~f~0.base_130, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_112|, ~x1~0=v_~x1~0_198, ~f~0.offset=v_~f~0.offset_130, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_99|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_160|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, #memory_int=|v_#memory_int_207|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_51|, ~n~0=v_~n~0_139, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:15,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:16,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [681] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_295| v_~f~0.base_202))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_202 (* v_~x2~0_277 4)))) (.cse0 (* (mod v_~n~0_209 2147483648) 2))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_211| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| (ite (and (< .cse1 v_~size~0_210) (<= 0 .cse1)) 1 0)) (= (ite (and (< v_~x1~0_379 v_~size~0_210) (<= 0 v_~x1~0_379)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|) (= v_~x2~0_276 (select .cse2 (+ v_~f~0.offset_202 (* 4 .cse1)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217| 0)) (not (= (ite (and (<= 0 v_~x2~0_277) (< v_~x2~0_277 v_~size~0_210)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_211|) |v_thread2Thread1of1ForFork1_~i~1#1_210|) (= v_~x1~0_378 (select .cse2 (+ v_~f~0.offset_202 (* v_~x1~0_379 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_301| 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_300| (+ |v_thread1Thread1of1ForFork0_~i~0#1_301| 1))))) InVars {~x2~0=v_~x2~0_277, ~size~0=v_~size~0_210, ~f~0.base=v_~f~0.base_202, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_301|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_211|, ~n~0=v_~n~0_209, ~x1~0=v_~x1~0_379, ~f~0.offset=v_~f~0.offset_202} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_219|, ~x2~0=v_~x2~0_276, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_137|, ~size~0=v_~size~0_210, ~f~0.base=v_~f~0.base_202, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_141|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_210|, ~x1~0=v_~x1~0_378, ~f~0.offset=v_~f~0.offset_202, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_175|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_201|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_300|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_217|, #memory_int=|v_#memory_int_295|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_127|, ~n~0=v_~n~0_209, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_227|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_127|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:16,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_221| v_~f~0.base_140))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_140 (* v_~x2~0_163 4)))) (.cse2 (* 2 (mod v_~n~0_149 2147483648)))) (and (= (ite (and (< .cse0 v_~size~0_150) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= (select .cse1 (+ v_~f~0.offset_140 (* v_~x1~0_227 4))) v_~x1~0_226) (= (ite (and (<= 0 v_~x1~0_227) (< v_~x1~0_227 v_~size~0_150)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_180| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_179| (+ |v_thread1Thread1of1ForFork0_~i~0#1_180| 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_127|) |v_thread2Thread1of1ForFork1_~i~1#1_126|) (= (select .cse1 (+ v_~f~0.offset_140 (* .cse0 4))) v_~x2~0_162) (not (= (ite (and (< v_~x2~0_163 v_~size~0_150) (<= 0 v_~x2~0_163)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_127| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|)))) InVars {~x2~0=v_~x2~0_163, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_140, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_180|, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_127|, ~n~0=v_~n~0_149, ~x1~0=v_~x1~0_227, ~f~0.offset=v_~f~0.offset_140} OutVars{~x2~0=v_~x2~0_162, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_127|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_71|, ~size~0=v_~size~0_150, ~f~0.base=v_~f~0.base_140, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_75|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_126|, ~x1~0=v_~x1~0_226, ~f~0.offset=v_~f~0.offset_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_109|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_109|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_179|, #memory_int=|v_#memory_int_221|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_61|, ~n~0=v_~n~0_149, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_135|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:16,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:16,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:17,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:17,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:17,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:17,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:17,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:17,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:17,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:18,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [619] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_183| v_~f~0.base_112))) (let ((.cse1 (select .cse0 (+ (* v_~x1~0_168 4) v_~f~0.offset_112)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (= v_~x1~0_166 (select .cse0 (+ v_~f~0.offset_112 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_124)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|) (not (= (ite (and (<= 0 v_~x1~0_168) (< v_~x1~0_168 v_~size~0_124)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_140| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_140| 4294967294) 4294967296) (* 2 (mod v_~n~0_123 2147483648)))))) InVars {~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_168, ~f~0.offset=v_~f~0.offset_112} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_74|, ~size~0=v_~size~0_124, ~f~0.base=v_~f~0.base_112, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_140|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_90|, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_123, ~x1~0=v_~x1~0_166, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_100|, ~f~0.offset=v_~f~0.offset_112} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:18,283 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:34:18,284 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9855 [2022-12-06 00:34:18,284 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 334 transitions, 8849 flow [2022-12-06 00:34:18,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:18,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:18,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:18,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 00:34:18,490 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,SelfDestructingSolverStorable48 [2022-12-06 00:34:18,490 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash 128844411, now seen corresponding path program 1 times [2022-12-06 00:34:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:18,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231791334] [2022-12-06 00:34:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:18,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:18,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231791334] [2022-12-06 00:34:18,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231791334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:34:18,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:34:18,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:34:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919724396] [2022-12-06 00:34:18,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:34:18,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:34:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:34:18,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:34:18,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 110 [2022-12-06 00:34:18,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 334 transitions, 8849 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:18,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:18,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 110 [2022-12-06 00:34:18,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:19,361 INFO L130 PetriNetUnfolder]: 1553/2997 cut-off events. [2022-12-06 00:34:19,361 INFO L131 PetriNetUnfolder]: For 125974/125974 co-relation queries the response was YES. [2022-12-06 00:34:19,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32252 conditions, 2997 events. 1553/2997 cut-off events. For 125974/125974 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 20980 event pairs, 344 based on Foata normal form. 6/2997 useless extension candidates. Maximal degree in co-relation 31024. Up to 1472 conditions per place. [2022-12-06 00:34:19,386 INFO L137 encePairwiseOnDemand]: 71/110 looper letters, 268 selfloop transitions, 73 changer transitions 13/354 dead transitions. [2022-12-06 00:34:19,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 354 transitions, 8957 flow [2022-12-06 00:34:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:34:19,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:34:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-12-06 00:34:19,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13787878787878788 [2022-12-06 00:34:19,387 INFO L175 Difference]: Start difference. First operand has 227 places, 334 transitions, 8849 flow. Second operand 6 states and 91 transitions. [2022-12-06 00:34:19,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 354 transitions, 8957 flow [2022-12-06 00:34:19,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 354 transitions, 8756 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 00:34:19,705 INFO L231 Difference]: Finished difference. Result has 228 places, 296 transitions, 7219 flow [2022-12-06 00:34:19,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=6736, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7219, PETRI_PLACES=228, PETRI_TRANSITIONS=296} [2022-12-06 00:34:19,706 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 207 predicate places. [2022-12-06 00:34:19,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:19,706 INFO L89 Accepts]: Start accepts. Operand has 228 places, 296 transitions, 7219 flow [2022-12-06 00:34:19,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:19,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:19,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 296 transitions, 7219 flow [2022-12-06 00:34:19,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 296 transitions, 7219 flow [2022-12-06 00:34:19,846 INFO L130 PetriNetUnfolder]: 308/1104 cut-off events. [2022-12-06 00:34:19,846 INFO L131 PetriNetUnfolder]: For 47364/47494 co-relation queries the response was YES. [2022-12-06 00:34:19,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11701 conditions, 1104 events. 308/1104 cut-off events. For 47364/47494 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9733 event pairs, 35 based on Foata normal form. 20/1096 useless extension candidates. Maximal degree in co-relation 11263. Up to 309 conditions per place. [2022-12-06 00:34:19,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 296 transitions, 7219 flow [2022-12-06 00:34:19,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 898 [2022-12-06 00:34:19,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [593] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_122| v_~f~0.base_72))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_72 (* v_~x2~0_102 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (< 0 (* (mod v_~n~0_82 2147483648) 2)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| 0)) (= v_~x2~0_101 (select .cse0 (+ v_~f~0.offset_72 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_102 v_~size~0_86) (<= 0 v_~x2~0_102)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_83|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_86)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)))) InVars {~x2~0=v_~x2~0_102, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, #memory_int=|v_#memory_int_122|, ~n~0=v_~n~0_82, ~f~0.offset=v_~f~0.offset_72} OutVars{~x2~0=v_~x2~0_101, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_37|, ~size~0=v_~size~0_86, ~f~0.base=v_~f~0.base_72, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_83|, ~f~0.offset=v_~f~0.offset_72, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, #memory_int=|v_#memory_int_122|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_27|, ~n~0=v_~n~0_82, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_27|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [579] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= (ite (and (<= 0 v_~x1~0_In_6) (< v_~x1~0_In_6 v_~size~0_In_11)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (select (select |v_#memory_int_In_25| v_~f~0.base_In_13) (+ v_~f~0.offset_In_13 (* v_~x1~0_In_6 4))) v_~x1~0_Out_14) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 4294967296) (* 2 (mod v_~n~0_In_9 2147483648))) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_14| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_7| 1))) InVars {~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_7|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_6, ~f~0.offset=v_~f~0.offset_In_13} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_11, ~f~0.base=v_~f~0.base_In_13, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_14|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_Out_14, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_12|, ~f~0.offset=v_~f~0.offset_In_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:20,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] L59-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_108| v_~f~0.base_62))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_62 (* v_~x2~0_89 4))))) (and (= (select .cse0 (+ v_~f~0.offset_62 (* 4 .cse1))) v_~x2~0_87) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_73| 4294967296) (* 2 (mod v_~n~0_70 2147483648))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_73|) |v_thread2Thread1of1ForFork1_~i~1#1_71|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_78)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (not (= (ite (and (< v_~x2~0_89 v_~size~0_78) (<= 0 v_~x2~0_89)) 1 0) 0))))) InVars {~x2~0=v_~x2~0_89, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_73|, ~n~0=v_~n~0_70, ~f~0.offset=v_~f~0.offset_62} OutVars{~x2~0=v_~x2~0_87, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_78, ~f~0.base=v_~f~0.base_62, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_71|, ~f~0.offset=v_~f~0.offset_62, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_23|, ~n~0=v_~n~0_70, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [675] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_284| v_~f~0.base_194))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_194 (* v_~x1~0_358 4)))) (.cse2 (* 2 (mod v_~n~0_201 2147483648)))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_279| 2) |v_thread1Thread1of1ForFork0_~i~0#1_277|) (not (= (ite (and (< v_~x1~0_358 v_~size~0_202) (<= 0 v_~x1~0_358)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_202) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186|) (= v_~x1~0_356 (select .cse1 (+ v_~f~0.offset_194 (* 4 .cse0)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_279| 1) 4294967296) .cse2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_279| 4294967296) .cse2)))) InVars {~size~0=v_~size~0_202, ~f~0.base=v_~f~0.base_194, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_279|, #memory_int=|v_#memory_int_284|, ~n~0=v_~n~0_201, ~x1~0=v_~x1~0_358, ~f~0.offset=v_~f~0.offset_194} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_204|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186|, ~size~0=v_~size~0_202, ~f~0.base=v_~f~0.base_194, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_277|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_202|, #memory_int=|v_#memory_int_284|, ~n~0=v_~n~0_201, ~x1~0=v_~x1~0_356, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_212|, ~f~0.offset=v_~f~0.offset_194} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:34:20,192 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:34:20,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 487 [2022-12-06 00:34:20,193 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 295 transitions, 7236 flow [2022-12-06 00:34:20,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:20,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:20,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:20,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 00:34:20,193 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:20,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1215562857, now seen corresponding path program 1 times [2022-12-06 00:34:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:20,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980357612] [2022-12-06 00:34:20,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:20,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:20,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:20,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980357612] [2022-12-06 00:34:20,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980357612] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:34:20,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549388556] [2022-12-06 00:34:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:34:20,340 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:34:20,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 00:34:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:20,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:34:20,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:34:20,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-06 00:34:20,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:34:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:20,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549388556] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:34:20,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:34:20,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 00:34:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626001043] [2022-12-06 00:34:20,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:34:20,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:34:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:34:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:34:20,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 00:34:20,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 295 transitions, 7236 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:20,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:20,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 00:34:20,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:21,771 INFO L130 PetriNetUnfolder]: 1565/3015 cut-off events. [2022-12-06 00:34:21,771 INFO L131 PetriNetUnfolder]: For 137424/137424 co-relation queries the response was YES. [2022-12-06 00:34:21,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33409 conditions, 3015 events. 1565/3015 cut-off events. For 137424/137424 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 21000 event pairs, 518 based on Foata normal form. 30/3039 useless extension candidates. Maximal degree in co-relation 32607. Up to 2119 conditions per place. [2022-12-06 00:34:21,798 INFO L137 encePairwiseOnDemand]: 15/65 looper letters, 194 selfloop transitions, 162 changer transitions 21/377 dead transitions. [2022-12-06 00:34:21,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 377 transitions, 9458 flow [2022-12-06 00:34:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:34:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:34:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-12-06 00:34:21,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2022-12-06 00:34:21,800 INFO L175 Difference]: Start difference. First operand has 224 places, 295 transitions, 7236 flow. Second operand 11 states and 130 transitions. [2022-12-06 00:34:21,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 377 transitions, 9458 flow [2022-12-06 00:34:22,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 377 transitions, 9138 flow, removed 100 selfloop flow, removed 5 redundant places. [2022-12-06 00:34:22,100 INFO L231 Difference]: Finished difference. Result has 234 places, 314 transitions, 7921 flow [2022-12-06 00:34:22,100 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=6936, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7921, PETRI_PLACES=234, PETRI_TRANSITIONS=314} [2022-12-06 00:34:22,100 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2022-12-06 00:34:22,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:22,100 INFO L89 Accepts]: Start accepts. Operand has 234 places, 314 transitions, 7921 flow [2022-12-06 00:34:22,101 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:22,101 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:22,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 314 transitions, 7921 flow [2022-12-06 00:34:22,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 314 transitions, 7921 flow [2022-12-06 00:34:22,270 INFO L130 PetriNetUnfolder]: 332/1152 cut-off events. [2022-12-06 00:34:22,270 INFO L131 PetriNetUnfolder]: For 52836/52983 co-relation queries the response was YES. [2022-12-06 00:34:22,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12905 conditions, 1152 events. 332/1152 cut-off events. For 52836/52983 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10126 event pairs, 39 based on Foata normal form. 23/1151 useless extension candidates. Maximal degree in co-relation 12559. Up to 315 conditions per place. [2022-12-06 00:34:22,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 314 transitions, 7921 flow [2022-12-06 00:34:22,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 926 [2022-12-06 00:34:22,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:34:22,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 375 [2022-12-06 00:34:22,475 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 313 transitions, 7909 flow [2022-12-06 00:34:22,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:22,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:22,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:22,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 00:34:22,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:22,679 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:22,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:22,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1596403635, now seen corresponding path program 2 times [2022-12-06 00:34:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:22,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160628658] [2022-12-06 00:34:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:22,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160628658] [2022-12-06 00:34:22,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160628658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:34:22,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:34:22,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:34:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818116995] [2022-12-06 00:34:22,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:34:22,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:34:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:22,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:34:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:34:22,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 00:34:22,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 313 transitions, 7909 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:22,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:22,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 00:34:22,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:23,654 INFO L130 PetriNetUnfolder]: 1553/2986 cut-off events. [2022-12-06 00:34:23,654 INFO L131 PetriNetUnfolder]: For 142210/142210 co-relation queries the response was YES. [2022-12-06 00:34:23,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34243 conditions, 2986 events. 1553/2986 cut-off events. For 142210/142210 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 20733 event pairs, 747 based on Foata normal form. 4/2984 useless extension candidates. Maximal degree in co-relation 32976. Up to 2944 conditions per place. [2022-12-06 00:34:23,676 INFO L137 encePairwiseOnDemand]: 47/65 looper letters, 293 selfloop transitions, 22 changer transitions 8/323 dead transitions. [2022-12-06 00:34:23,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 323 transitions, 8644 flow [2022-12-06 00:34:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:34:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:34:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-06 00:34:23,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24615384615384617 [2022-12-06 00:34:23,677 INFO L175 Difference]: Start difference. First operand has 233 places, 313 transitions, 7909 flow. Second operand 5 states and 80 transitions. [2022-12-06 00:34:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 323 transitions, 8644 flow [2022-12-06 00:34:23,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 323 transitions, 8409 flow, removed 102 selfloop flow, removed 2 redundant places. [2022-12-06 00:34:24,004 INFO L231 Difference]: Finished difference. Result has 236 places, 312 transitions, 7721 flow [2022-12-06 00:34:24,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=7652, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7721, PETRI_PLACES=236, PETRI_TRANSITIONS=312} [2022-12-06 00:34:24,004 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 215 predicate places. [2022-12-06 00:34:24,004 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:24,004 INFO L89 Accepts]: Start accepts. Operand has 236 places, 312 transitions, 7721 flow [2022-12-06 00:34:24,006 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:24,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:24,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 312 transitions, 7721 flow [2022-12-06 00:34:24,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 312 transitions, 7721 flow [2022-12-06 00:34:24,163 INFO L130 PetriNetUnfolder]: 325/1122 cut-off events. [2022-12-06 00:34:24,163 INFO L131 PetriNetUnfolder]: For 51097/51247 co-relation queries the response was YES. [2022-12-06 00:34:24,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12470 conditions, 1122 events. 325/1122 cut-off events. For 51097/51247 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9760 event pairs, 43 based on Foata normal form. 20/1119 useless extension candidates. Maximal degree in co-relation 11968. Up to 296 conditions per place. [2022-12-06 00:34:24,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 312 transitions, 7721 flow [2022-12-06 00:34:24,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 918 [2022-12-06 00:34:24,177 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:34:24,178 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:34:24,178 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 312 transitions, 7721 flow [2022-12-06 00:34:24,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:24,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:24,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:24,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 00:34:24,178 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1932087970, now seen corresponding path program 1 times [2022-12-06 00:34:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:24,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347416750] [2022-12-06 00:34:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:34:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:24,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347416750] [2022-12-06 00:34:24,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347416750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:34:24,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:34:24,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:34:24,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826859737] [2022-12-06 00:34:24,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:34:24,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:34:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:34:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:34:24,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 00:34:24,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 312 transitions, 7721 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:24,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:24,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 00:34:24,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:24,917 INFO L130 PetriNetUnfolder]: 1544/2966 cut-off events. [2022-12-06 00:34:24,918 INFO L131 PetriNetUnfolder]: For 137828/137828 co-relation queries the response was YES. [2022-12-06 00:34:24,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33570 conditions, 2966 events. 1544/2966 cut-off events. For 137828/137828 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 20440 event pairs, 652 based on Foata normal form. 2/2962 useless extension candidates. Maximal degree in co-relation 32301. Up to 2541 conditions per place. [2022-12-06 00:34:24,942 INFO L137 encePairwiseOnDemand]: 47/65 looper letters, 269 selfloop transitions, 55 changer transitions 0/324 dead transitions. [2022-12-06 00:34:24,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 324 transitions, 8577 flow [2022-12-06 00:34:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:34:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:34:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-06 00:34:24,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 00:34:24,943 INFO L175 Difference]: Start difference. First operand has 235 places, 312 transitions, 7721 flow. Second operand 3 states and 75 transitions. [2022-12-06 00:34:24,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 324 transitions, 8577 flow [2022-12-06 00:34:25,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 324 transitions, 8499 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 00:34:25,263 INFO L231 Difference]: Finished difference. Result has 234 places, 311 transitions, 7718 flow [2022-12-06 00:34:25,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=7608, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7718, PETRI_PLACES=234, PETRI_TRANSITIONS=311} [2022-12-06 00:34:25,263 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2022-12-06 00:34:25,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:25,263 INFO L89 Accepts]: Start accepts. Operand has 234 places, 311 transitions, 7718 flow [2022-12-06 00:34:25,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:25,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:25,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 311 transitions, 7718 flow [2022-12-06 00:34:25,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 311 transitions, 7718 flow [2022-12-06 00:34:25,433 INFO L130 PetriNetUnfolder]: 324/1121 cut-off events. [2022-12-06 00:34:25,433 INFO L131 PetriNetUnfolder]: For 51070/51220 co-relation queries the response was YES. [2022-12-06 00:34:25,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12443 conditions, 1121 events. 324/1121 cut-off events. For 51070/51220 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 9741 event pairs, 43 based on Foata normal form. 20/1118 useless extension candidates. Maximal degree in co-relation 11942. Up to 295 conditions per place. [2022-12-06 00:34:25,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 311 transitions, 7718 flow [2022-12-06 00:34:25,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 916 [2022-12-06 00:34:25,447 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:34:25,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:34:25,448 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 311 transitions, 7718 flow [2022-12-06 00:34:25,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:25,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:25,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:25,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 00:34:25,448 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2076325580, now seen corresponding path program 1 times [2022-12-06 00:34:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:25,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563955439] [2022-12-06 00:34:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:28,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563955439] [2022-12-06 00:34:28,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563955439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:34:28,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226501849] [2022-12-06 00:34:28,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:28,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:34:28,161 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:34:28,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 00:34:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:28,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 00:34:28,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:34:28,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:34:28,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 00:34:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:28,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:34:28,724 INFO L321 Elim1Store]: treesize reduction 20, result has 92.8 percent of original size [2022-12-06 00:34:28,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 308 [2022-12-06 00:34:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:29,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226501849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:34:29,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:34:29,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 00:34:29,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409930342] [2022-12-06 00:34:29,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:34:29,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:34:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:34:29,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:34:29,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 00:34:29,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 311 transitions, 7718 flow. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:29,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:29,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 00:34:29,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:31,959 INFO L130 PetriNetUnfolder]: 1613/3090 cut-off events. [2022-12-06 00:34:31,959 INFO L131 PetriNetUnfolder]: For 146250/146250 co-relation queries the response was YES. [2022-12-06 00:34:31,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35285 conditions, 3090 events. 1613/3090 cut-off events. For 146250/146250 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 21427 event pairs, 327 based on Foata normal form. 1/3085 useless extension candidates. Maximal degree in co-relation 34020. Up to 2719 conditions per place. [2022-12-06 00:34:31,987 INFO L137 encePairwiseOnDemand]: 21/64 looper letters, 271 selfloop transitions, 100 changer transitions 10/381 dead transitions. [2022-12-06 00:34:31,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 381 transitions, 9739 flow [2022-12-06 00:34:31,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:34:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:34:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-12-06 00:34:31,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2 [2022-12-06 00:34:31,988 INFO L175 Difference]: Start difference. First operand has 234 places, 311 transitions, 7718 flow. Second operand 10 states and 128 transitions. [2022-12-06 00:34:31,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 381 transitions, 9739 flow [2022-12-06 00:34:32,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 381 transitions, 9597 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 00:34:32,336 INFO L231 Difference]: Finished difference. Result has 243 places, 332 transitions, 8475 flow [2022-12-06 00:34:32,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=7588, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8475, PETRI_PLACES=243, PETRI_TRANSITIONS=332} [2022-12-06 00:34:32,336 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 222 predicate places. [2022-12-06 00:34:32,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:32,336 INFO L89 Accepts]: Start accepts. Operand has 243 places, 332 transitions, 8475 flow [2022-12-06 00:34:32,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:32,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:32,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 332 transitions, 8475 flow [2022-12-06 00:34:32,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 332 transitions, 8475 flow [2022-12-06 00:34:32,556 INFO L130 PetriNetUnfolder]: 340/1167 cut-off events. [2022-12-06 00:34:32,556 INFO L131 PetriNetUnfolder]: For 55828/55986 co-relation queries the response was YES. [2022-12-06 00:34:32,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13256 conditions, 1167 events. 340/1167 cut-off events. For 55828/55986 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10226 event pairs, 45 based on Foata normal form. 21/1165 useless extension candidates. Maximal degree in co-relation 12747. Up to 305 conditions per place. [2022-12-06 00:34:32,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 243 places, 332 transitions, 8475 flow [2022-12-06 00:34:32,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 984 [2022-12-06 00:34:32,572 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:34:32,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:34:32,573 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 332 transitions, 8475 flow [2022-12-06 00:34:32,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:32,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:32,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:32,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 00:34:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:32,774 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1059474184, now seen corresponding path program 2 times [2022-12-06 00:34:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:32,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646003420] [2022-12-06 00:34:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646003420] [2022-12-06 00:34:34,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646003420] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:34:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416561877] [2022-12-06 00:34:34,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:34:34,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:34,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:34:34,478 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:34:34,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 00:34:34,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:34:34,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:34:34,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:34:34,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:34:34,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:34:34,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-12-06 00:34:34,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:34:34,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 70 [2022-12-06 00:34:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:34,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:34:36,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:34:36,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 370 [2022-12-06 00:34:37,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:34:37,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-06 00:34:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:39,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416561877] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:34:39,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:34:39,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 00:34:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238325105] [2022-12-06 00:34:39,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:34:39,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:34:39,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:34:39,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:34:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=168, Unknown=3, NotChecked=0, Total=210 [2022-12-06 00:34:39,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 00:34:39,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 332 transitions, 8475 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:39,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:34:39,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 00:34:39,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:34:41,816 INFO L130 PetriNetUnfolder]: 1664/3175 cut-off events. [2022-12-06 00:34:41,817 INFO L131 PetriNetUnfolder]: For 157360/157360 co-relation queries the response was YES. [2022-12-06 00:34:41,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37169 conditions, 3175 events. 1664/3175 cut-off events. For 157360/157360 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 21959 event pairs, 330 based on Foata normal form. 1/3174 useless extension candidates. Maximal degree in co-relation 36058. Up to 2752 conditions per place. [2022-12-06 00:34:41,846 INFO L137 encePairwiseOnDemand]: 21/64 looper letters, 276 selfloop transitions, 114 changer transitions 13/403 dead transitions. [2022-12-06 00:34:41,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 403 transitions, 10654 flow [2022-12-06 00:34:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:34:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:34:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2022-12-06 00:34:41,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19140625 [2022-12-06 00:34:41,847 INFO L175 Difference]: Start difference. First operand has 243 places, 332 transitions, 8475 flow. Second operand 12 states and 147 transitions. [2022-12-06 00:34:41,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 403 transitions, 10654 flow [2022-12-06 00:34:42,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 403 transitions, 10419 flow, removed 102 selfloop flow, removed 2 redundant places. [2022-12-06 00:34:42,238 INFO L231 Difference]: Finished difference. Result has 254 places, 348 transitions, 9183 flow [2022-12-06 00:34:42,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=8240, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9183, PETRI_PLACES=254, PETRI_TRANSITIONS=348} [2022-12-06 00:34:42,239 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 233 predicate places. [2022-12-06 00:34:42,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:34:42,239 INFO L89 Accepts]: Start accepts. Operand has 254 places, 348 transitions, 9183 flow [2022-12-06 00:34:42,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:34:42,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:34:42,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 348 transitions, 9183 flow [2022-12-06 00:34:42,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 348 transitions, 9183 flow [2022-12-06 00:34:42,420 INFO L130 PetriNetUnfolder]: 354/1208 cut-off events. [2022-12-06 00:34:42,420 INFO L131 PetriNetUnfolder]: For 58983/59118 co-relation queries the response was YES. [2022-12-06 00:34:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13940 conditions, 1208 events. 354/1208 cut-off events. For 58983/59118 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 10658 event pairs, 49 based on Foata normal form. 15/1201 useless extension candidates. Maximal degree in co-relation 13472. Up to 312 conditions per place. [2022-12-06 00:34:42,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 348 transitions, 9183 flow [2022-12-06 00:34:42,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 1032 [2022-12-06 00:34:42,435 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:34:42,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:34:42,436 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 348 transitions, 9183 flow [2022-12-06 00:34:42,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:34:42,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:34:42,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:34:42,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 00:34:42,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:42,640 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:34:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:34:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1169013251, now seen corresponding path program 1 times [2022-12-06 00:34:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:34:42,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851996881] [2022-12-06 00:34:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:34:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:34:44,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851996881] [2022-12-06 00:34:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851996881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:34:44,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668882094] [2022-12-06 00:34:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:34:44,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:34:44,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:34:44,596 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:34:44,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 00:34:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:34:44,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 00:34:44,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:34:44,976 INFO L321 Elim1Store]: treesize reduction 198, result has 12.0 percent of original size [2022-12-06 00:34:44,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 28 case distinctions, treesize of input 225 treesize of output 86 [2022-12-06 00:34:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:34:45,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:34:49,753 INFO L321 Elim1Store]: treesize reduction 40, result has 96.3 percent of original size [2022-12-06 00:34:49,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 30 new quantified variables, introduced 120 case distinctions, treesize of input 558 treesize of output 1194 [2022-12-06 00:35:07,460 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:35:09,991 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:35:11,167 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 00:36:15,715 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:36:16,006 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-06 00:36:16,539 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-06 00:36:18,164 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-06 00:36:34,791 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-06 00:36:37,820 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-06 00:36:54,505 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2022-12-06 00:37:08,872 WARN L233 SmtUtils]: Spent 14.31s on a formula simplification that was a NOOP. DAG size: 1159 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-12-06 00:41:41,677 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 00:41:41,678 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 00:41:41,684 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:41:41,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 00:41:41,722 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:41:41,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-06 00:41:41,879 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 5 for 47ms.. [2022-12-06 00:41:41,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 00:41:41,880 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 00:41:41,881 INFO L458 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:41:41,882 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:41:41,882 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:41:41,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:41:41 BasicIcfg [2022-12-06 00:41:41,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:41:41,885 INFO L158 Benchmark]: Toolchain (without parser) took 808562.23ms. Allocated memory was 203.4MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 178.5MB in the beginning and 749.3MB in the end (delta: -570.7MB). Peak memory consumption was 735.9MB. Max. memory is 8.0GB. [2022-12-06 00:41:41,885 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 179.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:41:41,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.52ms. Allocated memory is still 203.4MB. Free memory was 178.5MB in the beginning and 167.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 00:41:41,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.21ms. Allocated memory is still 203.4MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:41:41,885 INFO L158 Benchmark]: Boogie Preprocessor took 45.95ms. Allocated memory is still 203.4MB. Free memory was 165.0MB in the beginning and 163.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:41:41,885 INFO L158 Benchmark]: RCFGBuilder took 418.94ms. Allocated memory is still 203.4MB. Free memory was 163.5MB in the beginning and 147.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 00:41:41,886 INFO L158 Benchmark]: TraceAbstraction took 807734.97ms. Allocated memory was 203.4MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 146.7MB in the beginning and 749.3MB in the end (delta: -602.6MB). Peak memory consumption was 704.4MB. Max. memory is 8.0GB. [2022-12-06 00:41:41,887 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.11ms. Allocated memory is still 203.4MB. Free memory is still 179.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.52ms. Allocated memory is still 203.4MB. Free memory was 178.5MB in the beginning and 167.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.21ms. Allocated memory is still 203.4MB. Free memory was 167.1MB in the beginning and 165.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.95ms. Allocated memory is still 203.4MB. Free memory was 165.0MB in the beginning and 163.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 418.94ms. Allocated memory is still 203.4MB. Free memory was 163.5MB in the beginning and 147.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 807734.97ms. Allocated memory was 203.4MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 146.7MB in the beginning and 749.3MB in the end (delta: -602.6MB). Peak memory consumption was 704.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 137 PlacesBefore, 21 PlacesAfterwards, 144 TransitionsBefore, 17 TransitionsAfterwards, 1942 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 47 ConcurrentYvCompositions, 11 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 1248, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1250, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1115, independent: 1113, independent conditional: 0, independent unconditional: 1113, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1250, independent: 135, independent conditional: 0, independent unconditional: 135, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1115, unknown conditional: 0, unknown unconditional: 1115] , Statistics on independence cache: Total cache size (in pairs): 2123, Positive cache size: 2121, Positive conditional cache size: 0, Positive unconditional cache size: 2121, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 36 PlacesBefore, 34 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 28, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 46 PlacesBefore, 46 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 53, Positive conditional cache size: 31, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 48 PlacesBefore, 48 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 57, Positive conditional cache size: 35, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 49 PlacesBefore, 49 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 59, Positive conditional cache size: 37, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 52 PlacesBefore, 51 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 39, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 62, Positive conditional cache size: 39, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 58 PlacesBefore, 58 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 40, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 67 PlacesBefore, 67 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 66, Positive conditional cache size: 43, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 78 PlacesBefore, 78 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 71, Positive conditional cache size: 48, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 71, Positive conditional cache size: 48, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 88 PlacesBefore, 88 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 72, Positive conditional cache size: 49, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 94 PlacesBefore, 95 PlacesAfterwards, 125 TransitionsBefore, 125 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 77, Positive conditional cache size: 53, Positive unconditional cache size: 24, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 110 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 129 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 91, Positive conditional cache size: 66, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 108 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 94, Positive conditional cache size: 69, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 94, Positive conditional cache size: 69, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 108 PlacesBefore, 109 PlacesAfterwards, 131 TransitionsBefore, 132 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 102, Positive conditional cache size: 77, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 102, Positive conditional cache size: 77, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 119 PlacesBefore, 120 PlacesAfterwards, 139 TransitionsBefore, 140 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 105, Positive conditional cache size: 80, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 123 PlacesBefore, 122 PlacesAfterwards, 151 TransitionsBefore, 150 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 106, Positive conditional cache size: 81, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 135 PlacesBefore, 135 PlacesAfterwards, 161 TransitionsBefore, 161 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 212, Positive conditional cache size: 183, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 140 PlacesBefore, 141 PlacesAfterwards, 166 TransitionsBefore, 167 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 215, Positive conditional cache size: 186, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 151 PlacesBefore, 150 PlacesAfterwards, 175 TransitionsBefore, 174 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 149 PlacesBefore, 149 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 219, Positive conditional cache size: 190, Positive unconditional cache size: 29, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 175 PlacesBefore, 175 PlacesAfterwards, 223 TransitionsBefore, 223 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 255, Positive cache size: 253, Positive conditional cache size: 223, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 178 PlacesBefore, 178 PlacesAfterwards, 227 TransitionsBefore, 227 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 254, Positive conditional cache size: 224, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 178 PlacesBefore, 178 PlacesAfterwards, 231 TransitionsBefore, 231 TransitionsAfterwards, 770 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): 256, Positive cache size: 254, Positive conditional cache size: 224, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 182 PlacesBefore, 182 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 778 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): 256, Positive cache size: 254, Positive conditional cache size: 224, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 195 PlacesBefore, 195 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 778 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 255, Positive conditional cache size: 225, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 194 PlacesBefore, 194 PlacesAfterwards, 271 TransitionsBefore, 272 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 265, Positive conditional cache size: 235, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 211 PlacesBefore, 211 PlacesAfterwards, 300 TransitionsBefore, 300 TransitionsAfterwards, 910 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 298, Positive cache size: 296, Positive conditional cache size: 265, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 215 PlacesBefore, 214 PlacesAfterwards, 307 TransitionsBefore, 306 TransitionsAfterwards, 922 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 296, Positive conditional cache size: 265, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 217 PlacesBefore, 217 PlacesAfterwards, 307 TransitionsBefore, 307 TransitionsAfterwards, 922 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): 298, Positive cache size: 296, Positive conditional cache size: 265, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 218 PlacesBefore, 218 PlacesAfterwards, 306 TransitionsBefore, 306 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 297, Positive conditional cache size: 266, Positive unconditional cache size: 31, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7s, 226 PlacesBefore, 227 PlacesAfterwards, 310 TransitionsBefore, 334 TransitionsAfterwards, 940 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 128, 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: 128, independent: 128, independent conditional: 128, 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: 128, independent: 128, independent conditional: 128, 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: 128, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 326, Positive conditional cache size: 272, Positive unconditional cache size: 54, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 225 PlacesBefore, 224 PlacesAfterwards, 296 TransitionsBefore, 295 TransitionsAfterwards, 898 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 328, Positive conditional cache size: 274, Positive unconditional cache size: 54, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 234 PlacesBefore, 233 PlacesAfterwards, 314 TransitionsBefore, 313 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 329, Positive conditional cache size: 275, Positive unconditional cache size: 54, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 235 PlacesBefore, 235 PlacesAfterwards, 312 TransitionsBefore, 312 TransitionsAfterwards, 918 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): 331, Positive cache size: 329, Positive conditional cache size: 275, Positive unconditional cache size: 54, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 234 PlacesBefore, 234 PlacesAfterwards, 311 TransitionsBefore, 311 TransitionsAfterwards, 916 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): 331, Positive cache size: 329, Positive conditional cache size: 275, Positive unconditional cache size: 54, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 243 PlacesBefore, 243 PlacesAfterwards, 332 TransitionsBefore, 332 TransitionsAfterwards, 984 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): 331, Positive cache size: 329, Positive conditional cache size: 275, Positive unconditional cache size: 54, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 254 PlacesBefore, 254 PlacesAfterwards, 348 TransitionsBefore, 348 TransitionsAfterwards, 1032 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): 331, Positive cache size: 329, Positive conditional cache size: 275, Positive unconditional cache size: 54, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 47ms.. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 47ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 47ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 189 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 807.6s, OverallIterations: 56, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 161.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 68 mSolverCounterUnknown, 1520 SdHoareTripleChecker+Valid, 22.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1520 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 20.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13081 IncrementalHoareTripleChecker+Invalid, 14293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1104 mSolverCounterUnsat, 5 mSDtfsCounter, 13081 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 484 SyntacticMatches, 14 SemanticMatches, 340 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 128.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9183occurred in iteration=55, InterpolantAutomatonStates: 347, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 174.7s InterpolantComputationTime, 987 NumberOfCodeBlocks, 987 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 1150 ConstructedInterpolants, 19 QuantifiedInterpolants, 24216 SizeOfPredicates, 186 NumberOfNonLiveVariables, 3571 ConjunctsInSsa, 499 ConjunctsInUnsatCore, 93 InterpolantComputations, 37 PerfectInterpolantSequences, 25/84 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