/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:53:44,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:53:44,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:53:44,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:53:44,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:53:44,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:53:44,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:53:44,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:53:44,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:53:44,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:53:44,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:53:44,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:53:44,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:53:44,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:53:44,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:53:44,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:53:44,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:53:44,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:53:44,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:53:44,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:53:44,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:53:44,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:53:44,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:53:44,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:53:44,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:53:44,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:53:44,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:53:44,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:53:44,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:53:44,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:53:44,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:53:44,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:53:44,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:53:44,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:53:44,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:53:44,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:53:44,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:53:44,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:53:44,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:53:44,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:53:44,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:53:44,367 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:53:44,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:53:44,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:53:44,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:53:44,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:53:44,381 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:53:44,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:53:44,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:53:44,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:53:44,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:53:44,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:53:44,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:53:44,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:53:44,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:53:44,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:53:44,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:53:44,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:53:44,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:53:44,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:53:44,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:53:44,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:53:44,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:53:44,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:53:44,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:53:44,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:53:44,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:53:44,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:53:44,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:53:44,384 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:53:44,385 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 07:53:44,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:53:44,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:53:44,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:53:44,588 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:53:44,588 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:53:44,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-06 07:53:45,511 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:53:45,734 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:53:45,735 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-06 07:53:45,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc701fd4/6763d9afdcf449ac85500ac7252f1ba9/FLAG677de02c6 [2022-12-06 07:53:46,118 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc701fd4/6763d9afdcf449ac85500ac7252f1ba9 [2022-12-06 07:53:46,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:53:46,124 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:53:46,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:53:46,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:53:46,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:53:46,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642e307c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46, skipping insertion in model container [2022-12-06 07:53:46,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:53:46,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:53:46,291 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-3.wvr.c[2500,2513] [2022-12-06 07:53:46,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:53:46,311 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:53:46,341 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-3.wvr.c[2500,2513] [2022-12-06 07:53:46,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:53:46,355 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:53:46,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46 WrapperNode [2022-12-06 07:53:46,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:53:46,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:53:46,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:53:46,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:53:46,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,402 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-06 07:53:46,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:53:46,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:53:46,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:53:46,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:53:46,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,428 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:53:46,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:53:46,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:53:46,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:53:46,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (1/1) ... [2022-12-06 07:53:46,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:53:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:46,485 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 07:53:46,508 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 07:53:46,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:53:46,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:53:46,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:53:46,546 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:53:46,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:53:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:53:46,547 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 07:53:46,640 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:53:46,641 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:53:46,832 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:53:46,838 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:53:46,838 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:53:46,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:53:46 BoogieIcfgContainer [2022-12-06 07:53:46,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:53:46,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:53:46,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:53:46,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:53:46,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:53:46" (1/3) ... [2022-12-06 07:53:46,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9de192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:53:46, skipping insertion in model container [2022-12-06 07:53:46,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:53:46" (2/3) ... [2022-12-06 07:53:46,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9de192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:53:46, skipping insertion in model container [2022-12-06 07:53:46,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:53:46" (3/3) ... [2022-12-06 07:53:46,860 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2022-12-06 07:53:46,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:53:46,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:53:46,872 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:53:46,946 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:53:46,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 167 transitions, 350 flow [2022-12-06 07:53:47,069 INFO L130 PetriNetUnfolder]: 15/165 cut-off events. [2022-12-06 07:53:47,069 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:47,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 15/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 165 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:53:47,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 167 transitions, 350 flow [2022-12-06 07:53:47,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 157 transitions, 326 flow [2022-12-06 07:53:47,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:47,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-06 07:53:47,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 157 transitions, 326 flow [2022-12-06 07:53:47,162 INFO L130 PetriNetUnfolder]: 15/157 cut-off events. [2022-12-06 07:53:47,163 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:47,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 15/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 146 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-06 07:53:47,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-06 07:53:47,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 2592 [2022-12-06 07:53:51,377 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 07:53:51,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:53:51,392 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;@60e4a26a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:53:51,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:53:51,395 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 07:53:51,395 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:51,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:51,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:51,396 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 07:53:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1887355417, now seen corresponding path program 1 times [2022-12-06 07:53:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:51,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386876683] [2022-12-06 07:53:51,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:51,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:51,703 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 07:53:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:51,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386876683] [2022-12-06 07:53:51,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386876683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:51,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:51,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:53:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514070031] [2022-12-06 07:53:51,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:53:51,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:53:51,730 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 07:53:51,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:51,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:53:51,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:51,809 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-06 07:53:51,809 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:53:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 19 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-06 07:53:51,811 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 07:53:51,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 07:53:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 07:53:51,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 07:53:51,820 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 07:53:51,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 07:53:51,822 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 07:53:51,823 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:51,824 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 07:53:51,827 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:53:51,827 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:51,828 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:51,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:51,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:51,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:51,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:51,835 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 07:53:51,836 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:53:51,836 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 3. Compared 11 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 07:53:51,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 07:53:51,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 07:53:52,452 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:52,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 627 [2022-12-06 07:53:52,454 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 07:53:52,454 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 07:53:52,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:52,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:52,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:53:52,455 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 07:53:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1661137616, now seen corresponding path program 1 times [2022-12-06 07:53:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:52,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062117004] [2022-12-06 07:53:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:52,689 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 07:53:52,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062117004] [2022-12-06 07:53:52,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062117004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:52,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:52,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:53:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209365519] [2022-12-06 07:53:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:52,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:52,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:52,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:53:52,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 07:53:52,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:52,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:52,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 07:53:52,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:52,734 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 07:53:52,735 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:52,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 320 event pairs, 9 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 07:53:52,739 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 07:53:52,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 07:53:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 07:53:52,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 07:53:52,740 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 07:53:52,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 07:53:52,741 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 07:53:52,741 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:52,742 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 07:53:52,742 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 07:53:52,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:52,742 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:52,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:52,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:52,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:52,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:52,746 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 07:53:52,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:53:52,746 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 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 07:53:52,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:52,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 07:53:52,747 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:52,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 07:53:52,748 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 07:53:52,748 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 07:53:52,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:52,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:52,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:53:52,748 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 07:53:52,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005448, now seen corresponding path program 1 times [2022-12-06 07:53:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:52,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957246040] [2022-12-06 07:53:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:52,909 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 07:53:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:52,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957246040] [2022-12-06 07:53:52,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957246040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:52,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:52,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:53:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866272451] [2022-12-06 07:53:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:52,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:53:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:53:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:53:52,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:53:52,914 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 07:53:52,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:52,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:53:52,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:53,020 INFO L130 PetriNetUnfolder]: 85/169 cut-off events. [2022-12-06 07:53:53,021 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 07:53:53,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 169 events. 85/169 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 578 event pairs, 26 based on Foata normal form. 12/180 useless extension candidates. Maximal degree in co-relation 140. Up to 86 conditions per place. [2022-12-06 07:53:53,023 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 8/42 dead transitions. [2022-12-06 07:53:53,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 202 flow [2022-12-06 07:53:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:53:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:53:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 07:53:53,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 07:53:53,024 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 41 transitions. [2022-12-06 07:53:53,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 202 flow [2022-12-06 07:53:53,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:53:53,026 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 07:53:53,026 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 07:53:53,027 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 07:53:53,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:53,027 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 07:53:53,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:53,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:53,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 07:53:53,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 07:53:53,047 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-06 07:53:53,047 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-06 07:53:53,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 38 events. 7/38 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 51. Up to 11 conditions per place. [2022-12-06 07:53:53,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 07:53:53,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 07:53:53,227 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:53,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 07:53:53,228 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 07:53:53,228 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 07:53:53,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:53,228 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:53,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:53:53,229 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 07:53:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1672318876, now seen corresponding path program 1 times [2022-12-06 07:53:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:53,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918638475] [2022-12-06 07:53:53,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:53,320 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 07:53:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918638475] [2022-12-06 07:53:53,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918638475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:53,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:53,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:53:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806117853] [2022-12-06 07:53:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:53,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:53:53,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 07:53:53,322 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 07:53:53,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:53,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 07:53:53,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:53,359 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-06 07:53:53,359 INFO L131 PetriNetUnfolder]: For 152/165 co-relation queries the response was YES. [2022-12-06 07:53:53,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 111 events. 59/111 cut-off events. For 152/165 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 326 event pairs, 14 based on Foata normal form. 7/116 useless extension candidates. Maximal degree in co-relation 287. Up to 76 conditions per place. [2022-12-06 07:53:53,360 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 20 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2022-12-06 07:53:53,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-06 07:53:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 07:53:53,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 07:53:53,362 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-06 07:53:53,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-06 07:53:53,363 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 07:53:53,363 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-06 07:53:53,364 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 07:53:53,364 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 07:53:53,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:53,364 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-06 07:53:53,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:53,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:53,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-06 07:53:53,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-06 07:53:53,368 INFO L130 PetriNetUnfolder]: 7/25 cut-off events. [2022-12-06 07:53:53,368 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:53:53,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 25 events. 7/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 28. Up to 10 conditions per place. [2022-12-06 07:53:53,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-06 07:53:53,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 07:53:53,369 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:53,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 07:53:53,369 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-06 07:53:53,369 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 07:53:53,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:53,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:53,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:53:53,370 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 07:53:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 526664714, now seen corresponding path program 1 times [2022-12-06 07:53:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:53,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099788120] [2022-12-06 07:53:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:53,418 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 07:53:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099788120] [2022-12-06 07:53:53,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099788120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:53,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:53,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650045088] [2022-12-06 07:53:53,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:53,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:53,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:53,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:53,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:53,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:53:53,420 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 07:53:53,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:53,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:53:53,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:53,483 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-06 07:53:53,483 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 07:53:53,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 111 events. 59/111 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 265 event pairs, 20 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 204. Up to 76 conditions per place. [2022-12-06 07:53:53,484 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-06 07:53:53,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 175 flow [2022-12-06 07:53:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 07:53:53,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 07:53:53,485 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 34 transitions. [2022-12-06 07:53:53,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 175 flow [2022-12-06 07:53:53,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 33 transitions, 160 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:53,486 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:53,486 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 07:53:53,487 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 07:53:53,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:53,487 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:53,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:53,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:53,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:53,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:53,490 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 07:53:53,490 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:53:53,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 27 events. 6/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 40. Up to 9 conditions per place. [2022-12-06 07:53:53,491 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 07:53:53,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 07:53:53,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:53:53,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 07:53:53,685 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-06 07:53:53,685 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 07:53:53,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:53,685 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:53,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:53:53,686 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 07:53:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1844971348, now seen corresponding path program 1 times [2022-12-06 07:53:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:53,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448102069] [2022-12-06 07:53:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:53,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 07:53:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:53,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448102069] [2022-12-06 07:53:53,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448102069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:53,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:53,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:53:53,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029163658] [2022-12-06 07:53:53,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:53,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:53:53,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:53:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:53:53,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:53:53,742 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 07:53:53,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:53,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:53:53,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:53,778 INFO L130 PetriNetUnfolder]: 42/78 cut-off events. [2022-12-06 07:53:53,778 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 07:53:53,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 78 events. 42/78 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 149 event pairs, 9 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 82. Up to 68 conditions per place. [2022-12-06 07:53:53,779 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 1/23 dead transitions. [2022-12-06 07:53:53,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 134 flow [2022-12-06 07:53:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:53:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:53:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 07:53:53,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 07:53:53,780 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 24 transitions. [2022-12-06 07:53:53,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 134 flow [2022-12-06 07:53:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 117 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:53,782 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-06 07:53:53,783 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 07:53:53,786 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 07:53:53,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:53,790 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-06 07:53:53,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:53,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:53,791 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-06 07:53:53,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-06 07:53:53,795 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-06 07:53:53,795 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:53:53,795 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 24. Up to 9 conditions per place. [2022-12-06 07:53:53,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-06 07:53:53,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 07:53:53,796 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:53,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:53:53,797 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-06 07:53:53,797 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 07:53:53,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:53,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:53,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:53:53,797 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 07:53:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash -854334181, now seen corresponding path program 1 times [2022-12-06 07:53:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:53,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550974649] [2022-12-06 07:53:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:53,958 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 07:53:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:53,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550974649] [2022-12-06 07:53:53,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550974649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:53:53,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:53:53,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:53:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98890886] [2022-12-06 07:53:53,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:53:53,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:53:53,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:53,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:53:53,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:53:53,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:53:53,960 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 07:53:53,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:53,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:53:53,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:54,056 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-06 07:53:54,057 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 07:53:54,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 94 events. 52/94 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 16 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 93. Up to 73 conditions per place. [2022-12-06 07:53:54,057 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2022-12-06 07:53:54,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 137 flow [2022-12-06 07:53:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:53:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:53:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 07:53:54,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-06 07:53:54,059 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 27 transitions. [2022-12-06 07:53:54,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 137 flow [2022-12-06 07:53:54,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 133 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:54,060 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 79 flow [2022-12-06 07:53:54,061 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-06 07:53:54,061 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 07:53:54,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:54,061 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 79 flow [2022-12-06 07:53:54,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:54,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:54,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-06 07:53:54,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 79 flow [2022-12-06 07:53:54,066 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-06 07:53:54,066 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 07:53:54,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 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 42 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 42. Up to 13 conditions per place. [2022-12-06 07:53:54,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-06 07:53:54,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 07:53:54,073 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:53:54,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:53:54,075 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 79 flow [2022-12-06 07:53:54,076 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 07:53:54,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:53:54,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:53:54,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:53:54,076 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 07:53:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:53:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash -503744373, now seen corresponding path program 1 times [2022-12-06 07:53:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:53:54,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705480514] [2022-12-06 07:53:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:53:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:54,409 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 07:53:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:53:54,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705480514] [2022-12-06 07:53:54,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705480514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:53:54,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316397266] [2022-12-06 07:53:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:53:54,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:53:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:53:54,413 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 07:53:54,464 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 07:53:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:53:54,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:53:54,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:53:54,591 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 07:53:54,615 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 07:53:54,634 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 07:53:54,747 INFO L321 Elim1Store]: treesize reduction 29, result has 58.0 percent of original size [2022-12-06 07:53:54,747 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 77 treesize of output 66 [2022-12-06 07:53:54,792 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 07:53:54,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:53:57,023 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 07:53:57,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316397266] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:53:57,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:53:57,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 07:53:57,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183799711] [2022-12-06 07:53:57,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:53:57,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:53:57,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:53:57,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:53:57,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=191, Unknown=3, NotChecked=0, Total=240 [2022-12-06 07:53:57,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:53:57,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 79 flow. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:53:57,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:53:57,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:53:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:53:57,896 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2022-12-06 07:53:57,896 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 07:53:57,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 256 events. 143/256 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 822 event pairs, 14 based on Foata normal form. 9/265 useless extension candidates. Maximal degree in co-relation 136. Up to 123 conditions per place. [2022-12-06 07:53:57,897 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 50 selfloop transitions, 14 changer transitions 24/88 dead transitions. [2022-12-06 07:53:57,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 88 transitions, 488 flow [2022-12-06 07:53:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:53:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:53:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-12-06 07:53:57,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28173374613003094 [2022-12-06 07:53:57,898 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 79 flow. Second operand 17 states and 91 transitions. [2022-12-06 07:53:57,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 88 transitions, 488 flow [2022-12-06 07:53:57,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 88 transitions, 465 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 07:53:57,900 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 156 flow [2022-12-06 07:53:57,900 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=156, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 07:53:57,900 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 07:53:57,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:53:57,900 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 156 flow [2022-12-06 07:53:57,901 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:53:57,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:53:57,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 156 flow [2022-12-06 07:53:57,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 156 flow [2022-12-06 07:53:57,906 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2022-12-06 07:53:57,906 INFO L131 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2022-12-06 07:53:57,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 48 events. 12/48 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 109 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 120. Up to 22 conditions per place. [2022-12-06 07:53:57,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 156 flow [2022-12-06 07:53:57,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:54:00,001 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:00,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2102 [2022-12-06 07:54:00,002 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 156 flow [2022-12-06 07:54:00,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:00,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:00,010 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 07:54:00,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:00,203 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 07:54:00,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1982835261, now seen corresponding path program 1 times [2022-12-06 07:54:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:00,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501410325] [2022-12-06 07:54:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:00,455 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 07:54:00,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:00,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501410325] [2022-12-06 07:54:00,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501410325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:00,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:00,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:00,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874047408] [2022-12-06 07:54:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:00,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:00,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:00,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:54:00,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:00,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:54:00,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:00,541 INFO L130 PetriNetUnfolder]: 99/187 cut-off events. [2022-12-06 07:54:00,541 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 07:54:00,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 187 events. 99/187 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 547 event pairs, 51 based on Foata normal form. 8/193 useless extension candidates. Maximal degree in co-relation 672. Up to 169 conditions per place. [2022-12-06 07:54:00,543 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-06 07:54:00,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 256 flow [2022-12-06 07:54:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 07:54:00,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-06 07:54:00,544 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 156 flow. Second operand 4 states and 30 transitions. [2022-12-06 07:54:00,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 256 flow [2022-12-06 07:54:00,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 225 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:00,545 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 146 flow [2022-12-06 07:54:00,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-06 07:54:00,546 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 07:54:00,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:00,546 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 146 flow [2022-12-06 07:54:00,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:00,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:00,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 146 flow [2022-12-06 07:54:00,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 146 flow [2022-12-06 07:54:00,552 INFO L130 PetriNetUnfolder]: 13/50 cut-off events. [2022-12-06 07:54:00,552 INFO L131 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2022-12-06 07:54:00,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 50 events. 13/50 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 123. Up to 24 conditions per place. [2022-12-06 07:54:00,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 146 flow [2022-12-06 07:54:00,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:54:00,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [641] L101-6-->L85-2: Formula: (and (= |v_#pthreadsForks_55| (+ |v_#pthreadsForks_56| 1)) (= v_~f~0.offset_85 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~f~0.base_85) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| (ite (< (mod v_~n~0_68 4294967296) 1431655765) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_133| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (= |v_ULTIMATE.start_main_#t~pre12#1_43| |v_#pthreadsForks_56|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_133|) (= (store |v_#memory_int_124| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_124| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_43|)) |v_#memory_int_123|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, #pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_124|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~n~0=v_~n~0_68, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ~f~0.base=v_~f~0.base_85, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~f~0.offset=v_~f~0.offset_85, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_133|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_31|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_31|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_42|, ~n~0=v_~n~0_68, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~f~0.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~f~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [656] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_182| v_~f~0.base_122))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_121 (* v_~x1~0_121 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= |v_thread1Thread1of1ForFork0_~i~0#1_73| 2) (= (ite (and (< .cse0 v_~size~0_125) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|) (= v_~x1~0_119 (select .cse1 (+ v_~f~0.offset_121 (* 4 .cse0)))) (not (= (ite (and (<= 0 v_~x1~0_121) (< v_~x1~0_121 v_~size~0_125)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_107) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51| 0))))) InVars {~size~0=v_~size~0_125, ~f~0.base=v_~f~0.base_122, #memory_int=|v_#memory_int_182|, ~n~0=v_~n~0_107, ~x1~0=v_~x1~0_121, ~f~0.offset=v_~f~0.offset_121} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, ~size~0=v_~size~0_125, ~f~0.base=v_~f~0.base_122, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_73|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_51|, ~n~0=v_~n~0_107, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_53|, ~x1~0=v_~x1~0_119, ~f~0.offset=v_~f~0.offset_121} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:00,909 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:54:00,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 363 [2022-12-06 07:54:00,910 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 140 flow [2022-12-06 07:54:00,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:00,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:00,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:00,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:54:00,910 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 07:54:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1626137748, now seen corresponding path program 1 times [2022-12-06 07:54:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:00,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579164802] [2022-12-06 07:54:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,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 07:54:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:01,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579164802] [2022-12-06 07:54:01,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579164802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:01,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:01,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629278329] [2022-12-06 07:54:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:01,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:54:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:01,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:54:01,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:54:01,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:54:01,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 140 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 07:54:01,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:01,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:54:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:01,459 INFO L130 PetriNetUnfolder]: 126/236 cut-off events. [2022-12-06 07:54:01,459 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2022-12-06 07:54:01,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 236 events. 126/236 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 775 event pairs, 38 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 842. Up to 108 conditions per place. [2022-12-06 07:54:01,460 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 37 selfloop transitions, 6 changer transitions 16/59 dead transitions. [2022-12-06 07:54:01,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 396 flow [2022-12-06 07:54:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:54:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:54:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 07:54:01,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 07:54:01,461 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 140 flow. Second operand 6 states and 56 transitions. [2022-12-06 07:54:01,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 396 flow [2022-12-06 07:54:01,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 364 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:01,462 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 159 flow [2022-12-06 07:54:01,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 07:54:01,463 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 07:54:01,463 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,463 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 159 flow [2022-12-06 07:54:01,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 159 flow [2022-12-06 07:54:01,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 159 flow [2022-12-06 07:54:01,469 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-06 07:54:01,469 INFO L131 PetriNetUnfolder]: For 77/79 co-relation queries the response was YES. [2022-12-06 07:54:01,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 62 events. 14/62 cut-off events. For 77/79 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 203 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 118. Up to 26 conditions per place. [2022-12-06 07:54:01,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 159 flow [2022-12-06 07:54:01,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 07:54:01,470 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:01,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:54:01,470 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 159 flow [2022-12-06 07:54:01,470 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 07:54:01,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:01,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:01,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:54:01,471 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 07:54:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1747909610, now seen corresponding path program 1 times [2022-12-06 07:54:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:01,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129075622] [2022-12-06 07:54:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,531 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 07:54:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129075622] [2022-12-06 07:54:01,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129075622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170884579] [2022-12-06 07:54:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:01,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:01,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:01,549 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 07:54:01,550 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 07:54:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:01,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:54:01,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:01,634 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 07:54:01,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:01,666 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 07:54:01,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170884579] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:01,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:01,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 07:54:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350606964] [2022-12-06 07:54:01,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:01,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:54:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:54:01,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:54:01,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:54:01,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 159 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 07:54:01,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:01,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:54:01,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:01,842 INFO L130 PetriNetUnfolder]: 123/239 cut-off events. [2022-12-06 07:54:01,842 INFO L131 PetriNetUnfolder]: For 415/415 co-relation queries the response was YES. [2022-12-06 07:54:01,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 239 events. 123/239 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 811 event pairs, 56 based on Foata normal form. 6/244 useless extension candidates. Maximal degree in co-relation 576. Up to 120 conditions per place. [2022-12-06 07:54:01,844 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 39 selfloop transitions, 4 changer transitions 10/53 dead transitions. [2022-12-06 07:54:01,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 363 flow [2022-12-06 07:54:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 07:54:01,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 07:54:01,848 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 159 flow. Second operand 5 states and 50 transitions. [2022-12-06 07:54:01,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 363 flow [2022-12-06 07:54:01,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:01,849 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 170 flow [2022-12-06 07:54:01,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-06 07:54:01,850 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 07:54:01,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:01,850 INFO L89 Accepts]: Start accepts. Operand has 43 places, 29 transitions, 170 flow [2022-12-06 07:54:01,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:01,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:01,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 29 transitions, 170 flow [2022-12-06 07:54:01,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 170 flow [2022-12-06 07:54:01,856 INFO L130 PetriNetUnfolder]: 13/59 cut-off events. [2022-12-06 07:54:01,856 INFO L131 PetriNetUnfolder]: For 75/78 co-relation queries the response was YES. [2022-12-06 07:54:01,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 59 events. 13/59 cut-off events. For 75/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 130. Up to 25 conditions per place. [2022-12-06 07:54:01,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 170 flow [2022-12-06 07:54:01,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:54:02,312 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:02,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-06 07:54:02,313 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 158 flow [2022-12-06 07:54:02,313 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 07:54:02,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:02,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:02,328 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 07:54:02,513 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,SelfDestructingSolverStorable10 [2022-12-06 07:54:02,513 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 07:54:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 181150205, now seen corresponding path program 1 times [2022-12-06 07:54:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:02,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584452730] [2022-12-06 07:54:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,675 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 07:54:02,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:02,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584452730] [2022-12-06 07:54:02,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584452730] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:02,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660395938] [2022-12-06 07:54:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:02,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:02,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:02,688 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 07:54:02,690 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 07:54:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:02,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:54:02,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:02,884 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 07:54:02,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:02,972 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 07:54:02,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660395938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:02,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:02,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 07:54:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284338879] [2022-12-06 07:54:02,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:02,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:54:02,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:02,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:54:02,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:54:02,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:54:02,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 158 flow. Second operand has 11 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 07:54:02,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:02,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:54:02,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:03,724 INFO L130 PetriNetUnfolder]: 250/457 cut-off events. [2022-12-06 07:54:03,724 INFO L131 PetriNetUnfolder]: For 1091/1091 co-relation queries the response was YES. [2022-12-06 07:54:03,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 457 events. 250/457 cut-off events. For 1091/1091 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1848 event pairs, 26 based on Foata normal form. 54/509 useless extension candidates. Maximal degree in co-relation 1517. Up to 221 conditions per place. [2022-12-06 07:54:03,727 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 81 selfloop transitions, 25 changer transitions 8/114 dead transitions. [2022-12-06 07:54:03,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 114 transitions, 866 flow [2022-12-06 07:54:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:54:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:54:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 112 transitions. [2022-12-06 07:54:03,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 07:54:03,728 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 158 flow. Second operand 14 states and 112 transitions. [2022-12-06 07:54:03,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 114 transitions, 866 flow [2022-12-06 07:54:03,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 114 transitions, 772 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:03,732 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 379 flow [2022-12-06 07:54:03,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=379, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-12-06 07:54:03,732 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2022-12-06 07:54:03,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:03,732 INFO L89 Accepts]: Start accepts. Operand has 57 places, 44 transitions, 379 flow [2022-12-06 07:54:03,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:03,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:03,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 379 flow [2022-12-06 07:54:03,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 379 flow [2022-12-06 07:54:03,744 INFO L130 PetriNetUnfolder]: 38/132 cut-off events. [2022-12-06 07:54:03,744 INFO L131 PetriNetUnfolder]: For 280/288 co-relation queries the response was YES. [2022-12-06 07:54:03,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 132 events. 38/132 cut-off events. For 280/288 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 549 event pairs, 6 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 370. Up to 71 conditions per place. [2022-12-06 07:54:03,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 379 flow [2022-12-06 07:54:03,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 07:54:06,058 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:54:06,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2326 [2022-12-06 07:54:06,058 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 362 flow [2022-12-06 07:54:06,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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 07:54:06,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:06,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:06,066 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 07:54:06,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:06,264 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 07:54:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1785931863, now seen corresponding path program 1 times [2022-12-06 07:54:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:06,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345632507] [2022-12-06 07:54:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:06,964 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 07:54:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:06,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345632507] [2022-12-06 07:54:06,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345632507] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:06,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650621387] [2022-12-06 07:54:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:06,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:06,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:06,966 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 07:54:06,968 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 07:54:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:07,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 07:54:07,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:07,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 07:54:07,065 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 07:54:07,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:07,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:54:07,340 INFO L321 Elim1Store]: treesize reduction 65, result has 69.5 percent of original size [2022-12-06 07:54:07,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 149 treesize of output 195 [2022-12-06 07:54:10,962 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 07:54:10,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:13,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_276 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* 4 (select .cse1 (+ c_~f~0.offset (* ~x2~0 4)))))) 4))) 4))) 4))))) (or (<= c_~size~0 .cse0) (= c_~x1~0 (select .cse1 (+ c_~f~0.offset (* .cse0 4)))) (< .cse0 0))))) is different from false [2022-12-06 07:54:13,321 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 07:54:13,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650621387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:13,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:13,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 07:54:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73844797] [2022-12-06 07:54:13,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:13,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:54:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:13,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:54:13,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=118, Unknown=2, NotChecked=22, Total=182 [2022-12-06 07:54:13,325 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:54:13,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 362 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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 07:54:13,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:13,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:54:13,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:13,595 INFO L130 PetriNetUnfolder]: 245/455 cut-off events. [2022-12-06 07:54:13,595 INFO L131 PetriNetUnfolder]: For 1483/1483 co-relation queries the response was YES. [2022-12-06 07:54:13,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 455 events. 245/455 cut-off events. For 1483/1483 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1781 event pairs, 73 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 1485. Up to 362 conditions per place. [2022-12-06 07:54:13,598 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 32 selfloop transitions, 5 changer transitions 21/58 dead transitions. [2022-12-06 07:54:13,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 557 flow [2022-12-06 07:54:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 07:54:13,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3565217391304348 [2022-12-06 07:54:13,599 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 362 flow. Second operand 5 states and 41 transitions. [2022-12-06 07:54:13,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 557 flow [2022-12-06 07:54:13,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 456 flow, removed 49 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:13,603 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 233 flow [2022-12-06 07:54:13,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-12-06 07:54:13,604 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 07:54:13,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:13,604 INFO L89 Accepts]: Start accepts. Operand has 58 places, 34 transitions, 233 flow [2022-12-06 07:54:13,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:13,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:13,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 34 transitions, 233 flow [2022-12-06 07:54:13,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 34 transitions, 233 flow [2022-12-06 07:54:13,612 INFO L130 PetriNetUnfolder]: 25/84 cut-off events. [2022-12-06 07:54:13,612 INFO L131 PetriNetUnfolder]: For 92/96 co-relation queries the response was YES. [2022-12-06 07:54:13,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 84 events. 25/84 cut-off events. For 92/96 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 277 event pairs, 4 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 235. Up to 47 conditions per place. [2022-12-06 07:54:13,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 34 transitions, 233 flow [2022-12-06 07:54:13,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 07:54:13,613 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:13,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 07:54:13,614 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 233 flow [2022-12-06 07:54:13,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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 07:54:13,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:13,614 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:13,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:54:13,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:13,818 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 07:54:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1577182119, now seen corresponding path program 1 times [2022-12-06 07:54:13,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:13,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760464585] [2022-12-06 07:54:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:13,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:15,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:15,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760464585] [2022-12-06 07:54:15,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760464585] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:15,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663562067] [2022-12-06 07:54:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:15,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:15,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:15,094 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 07:54:15,096 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 07:54:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:15,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:54:15,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:15,223 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 07:54:15,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 32 [2022-12-06 07:54:15,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:15,227 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 20 treesize of output 22 [2022-12-06 07:54:15,255 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 07:54:15,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:15,372 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 47 [2022-12-06 07:54:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:15,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:17,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663562067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:17,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:17,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 07:54:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478718866] [2022-12-06 07:54:17,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:17,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:54:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:54:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=245, Unknown=2, NotChecked=0, Total=306 [2022-12-06 07:54:17,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:54:17,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 233 flow. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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 07:54:17,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:17,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:54:17,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:18,357 INFO L130 PetriNetUnfolder]: 419/774 cut-off events. [2022-12-06 07:54:18,357 INFO L131 PetriNetUnfolder]: For 1967/1967 co-relation queries the response was YES. [2022-12-06 07:54:18,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 774 events. 419/774 cut-off events. For 1967/1967 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3511 event pairs, 52 based on Foata normal form. 4/778 useless extension candidates. Maximal degree in co-relation 2808. Up to 371 conditions per place. [2022-12-06 07:54:18,362 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 90 selfloop transitions, 46 changer transitions 2/138 dead transitions. [2022-12-06 07:54:18,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 138 transitions, 1047 flow [2022-12-06 07:54:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:54:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:54:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-12-06 07:54:18,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2022-12-06 07:54:18,363 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 233 flow. Second operand 13 states and 112 transitions. [2022-12-06 07:54:18,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 138 transitions, 1047 flow [2022-12-06 07:54:18,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 138 transitions, 961 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-12-06 07:54:18,369 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 627 flow [2022-12-06 07:54:18,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=627, PETRI_PLACES=58, PETRI_TRANSITIONS=77} [2022-12-06 07:54:18,371 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 07:54:18,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:18,371 INFO L89 Accepts]: Start accepts. Operand has 58 places, 77 transitions, 627 flow [2022-12-06 07:54:18,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:18,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:18,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 77 transitions, 627 flow [2022-12-06 07:54:18,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 77 transitions, 627 flow [2022-12-06 07:54:18,394 INFO L130 PetriNetUnfolder]: 54/212 cut-off events. [2022-12-06 07:54:18,394 INFO L131 PetriNetUnfolder]: For 301/305 co-relation queries the response was YES. [2022-12-06 07:54:18,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 212 events. 54/212 cut-off events. For 301/305 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1095 event pairs, 4 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 582. Up to 104 conditions per place. [2022-12-06 07:54:18,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 77 transitions, 627 flow [2022-12-06 07:54:18,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 07:54:18,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:18,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [648] $Ultimate##0-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| 1) (= v_~x1~0_84 (select (select |v_#memory_int_139| v_~f~0.base_97) (+ v_~f~0.offset_97 (* v_~x1~0_85 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_49| 4294967295) 4294967296) (mod (* v_~n~0_82 3) 4294967296)) (= (ite (and (<= 0 v_~x1~0_85) (< v_~x1~0_85 v_~size~0_103)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|)) InVars {~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_139|, ~n~0=v_~n~0_82, ~x1~0=v_~x1~0_85, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_27|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ~size~0=v_~size~0_103, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #memory_int=|v_#memory_int_139|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~n~0=v_~n~0_82, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~x1~0=v_~x1~0_84, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:54:18,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_273| v_~f~0.base_173))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_169 (* v_~x1~0_227 4))))) (and (not (= (ite (and (< v_~x1~0_227 v_~size~0_173) (<= 0 v_~x1~0_227)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_161) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= |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)) (= (ite (and (< .cse0 v_~size~0_173) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= v_~x1~0_225 (select .cse1 (+ v_~f~0.offset_169 (* .cse0 4))))))) InVars {~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, #memory_int=|v_#memory_int_273|, ~n~0=v_~n~0_161, ~x1~0=v_~x1~0_227, ~f~0.offset=v_~f~0.offset_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, ~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_273|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, ~n~0=v_~n~0_161, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, ~x1~0=v_~x1~0_225, ~f~0.offset=v_~f~0.offset_169} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:19,003 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_273| v_~f~0.base_173))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_169 (* v_~x1~0_227 4))))) (and (not (= (ite (and (< v_~x1~0_227 v_~size~0_173) (<= 0 v_~x1~0_227)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_161) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_149| 2) (= |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)) (= (ite (and (< .cse0 v_~size~0_173) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= v_~x1~0_225 (select .cse1 (+ v_~f~0.offset_169 (* .cse0 4))))))) InVars {~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, #memory_int=|v_#memory_int_273|, ~n~0=v_~n~0_161, ~x1~0=v_~x1~0_227, ~f~0.offset=v_~f~0.offset_169} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_102|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, ~size~0=v_~size~0_173, ~f~0.base=v_~f~0.base_173, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_149|, #memory_int=|v_#memory_int_273|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, ~n~0=v_~n~0_161, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_112|, ~x1~0=v_~x1~0_225, ~f~0.offset=v_~f~0.offset_169} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:54:19,203 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:19,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 834 [2022-12-06 07:54:19,205 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 649 flow [2022-12-06 07:54:19,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 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 07:54:19,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:19,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:19,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 07:54:19,412 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,SelfDestructingSolverStorable13 [2022-12-06 07:54:19,413 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 07:54:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1573603369, now seen corresponding path program 1 times [2022-12-06 07:54:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:19,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672831275] [2022-12-06 07:54:19,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:20,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 07:54:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672831275] [2022-12-06 07:54:20,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672831275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403833818] [2022-12-06 07:54:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:20,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:20,216 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 07:54:20,218 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 07:54:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:20,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 07:54:20,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:20,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:20,293 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 07:54:20,296 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 07:54:20,320 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 07:54:20,417 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 07:54:20,418 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 40 [2022-12-06 07:54:20,443 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 07:54:20,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:20,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 07:54:20,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403833818] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:20,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:20,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:54:20,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792812748] [2022-12-06 07:54:20,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:20,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:54:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:54:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=104, Unknown=2, NotChecked=0, Total=156 [2022-12-06 07:54:20,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:54:20,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 649 flow. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:20,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:20,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:54:20,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:23,053 INFO L130 PetriNetUnfolder]: 437/804 cut-off events. [2022-12-06 07:54:23,054 INFO L131 PetriNetUnfolder]: For 2243/2243 co-relation queries the response was YES. [2022-12-06 07:54:23,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 804 events. 437/804 cut-off events. For 2243/2243 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3562 event pairs, 218 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 2529. Up to 735 conditions per place. [2022-12-06 07:54:23,058 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 77 selfloop transitions, 23 changer transitions 2/102 dead transitions. [2022-12-06 07:54:23,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 977 flow [2022-12-06 07:54:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:54:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:54:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-12-06 07:54:23,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.285 [2022-12-06 07:54:23,059 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 649 flow. Second operand 8 states and 57 transitions. [2022-12-06 07:54:23,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 977 flow [2022-12-06 07:54:23,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 903 flow, removed 37 selfloop flow, removed 0 redundant places. [2022-12-06 07:54:23,065 INFO L231 Difference]: Finished difference. Result has 68 places, 84 transitions, 734 flow [2022-12-06 07:54:23,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=734, PETRI_PLACES=68, PETRI_TRANSITIONS=84} [2022-12-06 07:54:23,065 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-06 07:54:23,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:23,065 INFO L89 Accepts]: Start accepts. Operand has 68 places, 84 transitions, 734 flow [2022-12-06 07:54:23,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:23,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:23,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 84 transitions, 734 flow [2022-12-06 07:54:23,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 84 transitions, 734 flow [2022-12-06 07:54:23,083 INFO L130 PetriNetUnfolder]: 56/214 cut-off events. [2022-12-06 07:54:23,084 INFO L131 PetriNetUnfolder]: For 478/487 co-relation queries the response was YES. [2022-12-06 07:54:23,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 214 events. 56/214 cut-off events. For 478/487 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1053 event pairs, 1 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 710. Up to 68 conditions per place. [2022-12-06 07:54:23,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 84 transitions, 734 flow [2022-12-06 07:54:23,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 07:54:23,100 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:23,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [672] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_279| v_~f~0.base_177))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_173 (* v_~x2~0_197 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_173 (* .cse2 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_173 (* v_~x1~0_236 4))))) (and (= (select .cse0 (+ v_~f~0.offset_173 (* .cse1 4))) v_~x2~0_196) (< 1 (mod (* 3 v_~n~0_165) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_177)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (not (= (ite (and (< v_~x2~0_197 v_~size~0_177) (<= 0 v_~x2~0_197)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_236) (< v_~x1~0_236 v_~size~0_177)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_173 (* .cse3 4))) v_~x1~0_235) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116|) (= (ite (and (< .cse3 v_~size~0_177) (<= 0 .cse3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_100|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_119|) (= |v_thread1Thread1of1ForFork0_~i~0#1_155| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_116| 0)))))) InVars {~x2~0=v_~x2~0_197, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, #memory_int=|v_#memory_int_279|, ~n~0=v_~n~0_165, ~x1~0=v_~x1~0_236, ~f~0.offset=v_~f~0.offset_173} OutVars{~x2~0=v_~x2~0_196, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_108|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_83|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_177, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_119|, ~x1~0=v_~x1~0_235, ~f~0.offset=v_~f~0.offset_173, 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_100|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_155|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, #memory_int=|v_#memory_int_279|, 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_165, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_59|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_118|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:24,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:24,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [676] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_290| v_~f~0.base_183))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_179 (* v_~x2~0_203 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_179 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_127| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_166| 1) (= v_~x2~0_202 (select .cse0 (+ v_~f~0.offset_179 (* 4 .cse1)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127| 0)) (= (ite (and (< .cse1 v_~size~0_183) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_127|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_183)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_124|) |v_thread2Thread1of1ForFork1_~i~1#1_123|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111| (ite (and (<= 0 v_~x1~0_254) (< v_~x1~0_254 v_~size~0_183)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_124| 4294967296) (mod (* 3 v_~n~0_171) 4294967296)) (not (= (ite (and (< v_~x2~0_203 v_~size~0_183) (<= 0 v_~x2~0_203)) 1 0) 0)) (= v_~x1~0_253 (select .cse0 (+ v_~f~0.offset_179 (* v_~x1~0_254 4)))))))) InVars {~x2~0=v_~x2~0_203, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_183, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_124|, ~n~0=v_~n~0_171, ~x1~0=v_~x1~0_254, ~f~0.offset=v_~f~0.offset_179} OutVars{~x2~0=v_~x2~0_202, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_119|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_87|, ~size~0=v_~size~0_183, ~f~0.base=v_~f~0.base_183, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_59|, 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_123|, ~x1~0=v_~x1~0_253, ~f~0.offset=v_~f~0.offset_179, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_127|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_111|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_51|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_166|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, #memory_int=|v_#memory_int_290|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_127|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_59|, ~n~0=v_~n~0_171, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_63|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_129|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:25,085 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [650] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_143| v_~f~0.base_101))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_101 (* v_~x2~0_153 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_101 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| 0)) (= v_~x2~0_152 (select .cse0 (+ v_~f~0.offset_101 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_153 v_~size~0_107) (<= 0 v_~x2~0_153)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_107)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_93|) 4294967296) (mod (* v_~n~0_86 3) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_107)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_93|))))) InVars {~x2~0=v_~x2~0_153, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_143|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_101} OutVars{~x2~0=v_~x2~0_152, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_63|, ~size~0=v_~size~0_107, ~f~0.base=v_~f~0.base_101, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_35|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~f~0.offset=v_~f~0.offset_101, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_103|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_143|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_35|, ~n~0=v_~n~0_86, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [678] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_292| v_~f~0.base_185))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_181 (* v_~x1~0_259 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_129| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|) (= |v_thread1Thread1of1ForFork0_~i~0#1_168| 2) (= v_~x1~0_257 (select .cse0 (+ v_~f~0.offset_181 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x1~0_259) (< v_~x1~0_259 v_~size~0_185)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_173) 4294967296)) (= (ite (and (< .cse1 v_~size~0_185) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|)))) InVars {~size~0=v_~size~0_185, ~f~0.base=v_~f~0.base_185, #memory_int=|v_#memory_int_292|, ~n~0=v_~n~0_173, ~x1~0=v_~x1~0_259, ~f~0.offset=v_~f~0.offset_181} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, ~size~0=v_~size~0_185, ~f~0.base=v_~f~0.base_185, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_168|, #memory_int=|v_#memory_int_292|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_129|, ~n~0=v_~n~0_173, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_131|, ~x1~0=v_~x1~0_257, ~f~0.offset=v_~f~0.offset_181} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:25,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [673] $Ultimate##0-->L86-3: Formula: (let ((.cse1 (select |v_#memory_int_282| v_~f~0.base_179))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_175 (* v_~x1~0_240 4))))) (and (= |v_ULTIMATE.start_main_#t~pre14#1_97| |v_#pthreadsForks_155|) (= |v_thread1Thread1of1ForFork0_~i~0#1_157| 2) (= |v_#pthreadsForks_154| (+ |v_#pthreadsForks_155| 1)) (= (ite (and (< .cse0 v_~size~0_179) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (= v_~x1~0_239 (select .cse1 (+ v_~f~0.offset_175 (* .cse0 4)))) (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2~0#1.base_93| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2~0#1.base_93|) |v_ULTIMATE.start_main_~#t2~0#1.offset_89| |v_ULTIMATE.start_main_#t~pre14#1_97|)) |v_#memory_int_281|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118| 0)) (not (= (ite (and (<= 0 v_~x1~0_240) (< v_~x1~0_240 v_~size~0_179)) 1 0) 0)) (< 1 (mod (* 3 v_~n~0_167) 4294967296))))) InVars {#pthreadsForks=|v_#pthreadsForks_155|, ~size~0=v_~size~0_179, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_89|, ~f~0.base=v_~f~0.base_179, #memory_int=|v_#memory_int_282|, ~n~0=v_~n~0_167, ~x1~0=v_~x1~0_240, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_93|, ~f~0.offset=v_~f~0.offset_175} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_110|, ~size~0=v_~size~0_179, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_89|, ~f~0.base=v_~f~0.base_179, ~x1~0=v_~x1~0_239, ~f~0.offset=v_~f~0.offset_175, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_110|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_97|, #pthreadsForks=|v_#pthreadsForks_154|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_157|, #memory_int=|v_#memory_int_281|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_80|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_118|, ~n~0=v_~n~0_167, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_120|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_93|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:25,482 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:54:25,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2417 [2022-12-06 07:54:25,482 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 84 transitions, 809 flow [2022-12-06 07:54:25,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:25,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:25,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:25,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:25,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 07:54:25,689 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 07:54:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1541117875, now seen corresponding path program 1 times [2022-12-06 07:54:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:25,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380825101] [2022-12-06 07:54:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:26,383 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 07:54:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:26,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380825101] [2022-12-06 07:54:26,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380825101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:26,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:26,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:54:26,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461501401] [2022-12-06 07:54:26,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:26,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:26,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:26,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:26,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:54:26,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 84 transitions, 809 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 07:54:26,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:26,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:54:26,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:26,642 INFO L130 PetriNetUnfolder]: 454/846 cut-off events. [2022-12-06 07:54:26,642 INFO L131 PetriNetUnfolder]: For 3003/3003 co-relation queries the response was YES. [2022-12-06 07:54:26,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 846 events. 454/846 cut-off events. For 3003/3003 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3841 event pairs, 193 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 3297. Up to 713 conditions per place. [2022-12-06 07:54:26,646 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 73 selfloop transitions, 27 changer transitions 4/104 dead transitions. [2022-12-06 07:54:26,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 1123 flow [2022-12-06 07:54:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:54:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:54:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 07:54:26,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 07:54:26,648 INFO L175 Difference]: Start difference. First operand has 68 places, 84 transitions, 809 flow. Second operand 5 states and 56 transitions. [2022-12-06 07:54:26,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 1123 flow [2022-12-06 07:54:26,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 104 transitions, 1047 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:26,655 INFO L231 Difference]: Finished difference. Result has 72 places, 86 transitions, 824 flow [2022-12-06 07:54:26,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=824, PETRI_PLACES=72, PETRI_TRANSITIONS=86} [2022-12-06 07:54:26,656 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-06 07:54:26,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:26,656 INFO L89 Accepts]: Start accepts. Operand has 72 places, 86 transitions, 824 flow [2022-12-06 07:54:26,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:26,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:26,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 86 transitions, 824 flow [2022-12-06 07:54:26,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 86 transitions, 824 flow [2022-12-06 07:54:26,676 INFO L130 PetriNetUnfolder]: 57/229 cut-off events. [2022-12-06 07:54:26,677 INFO L131 PetriNetUnfolder]: For 680/684 co-relation queries the response was YES. [2022-12-06 07:54:26,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 229 events. 57/229 cut-off events. For 680/684 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1186 event pairs, 1 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 846. Up to 74 conditions per place. [2022-12-06 07:54:26,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 86 transitions, 824 flow [2022-12-06 07:54:26,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 07:54:26,826 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:27,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:27,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 360 [2022-12-06 07:54:27,016 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 86 transitions, 846 flow [2022-12-06 07:54:27,016 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 07:54:27,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:27,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:54:27,020 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 07:54:27,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 897559288, now seen corresponding path program 1 times [2022-12-06 07:54:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:27,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653783843] [2022-12-06 07:54:27,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:27,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:27,789 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 07:54:27,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:27,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653783843] [2022-12-06 07:54:27,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653783843] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:27,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084001216] [2022-12-06 07:54:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:27,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:27,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:27,800 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 07:54:27,802 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 07:54:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:27,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 07:54:27,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:27,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:27,892 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 22 treesize of output 22 [2022-12-06 07:54:27,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:27,942 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 07:54:27,951 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 07:54:27,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:28,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:28,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-06 07:54:28,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:28,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 92 [2022-12-06 07:54:28,617 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 07:54:28,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084001216] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:28,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:28,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:54:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134372065] [2022-12-06 07:54:28,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:28,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:54:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:54:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:54:28,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:54:28,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 86 transitions, 846 flow. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:28,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:28,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:54:28,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:29,318 INFO L130 PetriNetUnfolder]: 520/959 cut-off events. [2022-12-06 07:54:29,318 INFO L131 PetriNetUnfolder]: For 3666/3666 co-relation queries the response was YES. [2022-12-06 07:54:29,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4223 conditions, 959 events. 520/959 cut-off events. For 3666/3666 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4611 event pairs, 205 based on Foata normal form. 1/956 useless extension candidates. Maximal degree in co-relation 4161. Up to 743 conditions per place. [2022-12-06 07:54:29,323 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 92 selfloop transitions, 43 changer transitions 4/139 dead transitions. [2022-12-06 07:54:29,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 139 transitions, 1429 flow [2022-12-06 07:54:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:54:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:54:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-12-06 07:54:29,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24147727272727273 [2022-12-06 07:54:29,324 INFO L175 Difference]: Start difference. First operand has 69 places, 86 transitions, 846 flow. Second operand 11 states and 85 transitions. [2022-12-06 07:54:29,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 139 transitions, 1429 flow [2022-12-06 07:54:29,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 139 transitions, 1357 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-06 07:54:29,330 INFO L231 Difference]: Finished difference. Result has 77 places, 102 transitions, 1071 flow [2022-12-06 07:54:29,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1071, PETRI_PLACES=77, PETRI_TRANSITIONS=102} [2022-12-06 07:54:29,331 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2022-12-06 07:54:29,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:29,331 INFO L89 Accepts]: Start accepts. Operand has 77 places, 102 transitions, 1071 flow [2022-12-06 07:54:29,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:29,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:29,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 102 transitions, 1071 flow [2022-12-06 07:54:29,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 102 transitions, 1071 flow [2022-12-06 07:54:29,352 INFO L130 PetriNetUnfolder]: 65/257 cut-off events. [2022-12-06 07:54:29,353 INFO L131 PetriNetUnfolder]: For 810/814 co-relation queries the response was YES. [2022-12-06 07:54:29,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 257 events. 65/257 cut-off events. For 810/814 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1450 event pairs, 1 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 901. Up to 89 conditions per place. [2022-12-06 07:54:29,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 102 transitions, 1071 flow [2022-12-06 07:54:29,354 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 07:54:29,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [687] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_302| v_~f~0.base_195))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_191 (* v_~x2~0_228 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_191 (* .cse0 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_191 (* 4 .cse1))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_191 (* .cse2 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_191 (* 4 .cse3))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141| 0)) (not (= (ite (and (< v_~x2~0_228 v_~size~0_195) (<= 0 v_~x2~0_228)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|) (not (= (ite (and (< .cse0 v_~size~0_195) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_195)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_195) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_195)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_180| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|) (= (ite (and (< v_~x1~0_278 v_~size~0_195) (<= 0 v_~x1~0_278)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|) (= (select .cse4 (+ v_~f~0.offset_191 (* .cse5 4))) v_~x2~0_226) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_109| (ite (and (< .cse5 v_~size~0_195) (<= 0 .cse5)) 1 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_139| 4294967293) 4294967296) (mod (* 3 v_~n~0_183) 4294967296)) (= v_~x1~0_277 (select .cse4 (+ v_~f~0.offset_191 (* v_~x1~0_278 4)))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_139|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141| 0))))))))) InVars {~x2~0=v_~x2~0_228, ~size~0=v_~size~0_195, ~f~0.base=v_~f~0.base_195, #memory_int=|v_#memory_int_302|, ~n~0=v_~n~0_183, ~x1~0=v_~x1~0_278, ~f~0.offset=v_~f~0.offset_191} OutVars{~x2~0=v_~x2~0_226, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_133|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_101|, ~size~0=v_~size~0_195, ~f~0.base=v_~f~0.base_195, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_73|, 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_139|, ~x1~0=v_~x1~0_277, ~f~0.offset=v_~f~0.offset_191, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_125|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_65|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_180|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_63|, #memory_int=|v_#memory_int_302|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_73|, ~n~0=v_~n~0_183, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_77|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_143|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:30,437 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:30,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1107 [2022-12-06 07:54:30,438 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 1085 flow [2022-12-06 07:54:30,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:30,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:30,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:30,444 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 07:54:30,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:30,645 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 07:54:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash -439053155, now seen corresponding path program 1 times [2022-12-06 07:54:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:30,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824988858] [2022-12-06 07:54:30,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:30,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:30,711 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 07:54:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:30,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824988858] [2022-12-06 07:54:30,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824988858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:30,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:30,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062275618] [2022-12-06 07:54:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:30,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:30,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:30,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:30,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:54:30,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 102 transitions, 1085 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 07:54:30,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:30,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:54:30,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:31,023 INFO L130 PetriNetUnfolder]: 572/1077 cut-off events. [2022-12-06 07:54:31,023 INFO L131 PetriNetUnfolder]: For 4936/4936 co-relation queries the response was YES. [2022-12-06 07:54:31,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1077 events. 572/1077 cut-off events. For 4936/4936 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5668 event pairs, 106 based on Foata normal form. 20/1097 useless extension candidates. Maximal degree in co-relation 4176. Up to 491 conditions per place. [2022-12-06 07:54:31,029 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 151 selfloop transitions, 15 changer transitions 7/173 dead transitions. [2022-12-06 07:54:31,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 173 transitions, 2069 flow [2022-12-06 07:54:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:54:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:54:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 07:54:31,029 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27310924369747897 [2022-12-06 07:54:31,029 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 1085 flow. Second operand 7 states and 65 transitions. [2022-12-06 07:54:31,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 173 transitions, 2069 flow [2022-12-06 07:54:31,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 173 transitions, 1978 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:31,039 INFO L231 Difference]: Finished difference. Result has 83 places, 113 transitions, 1199 flow [2022-12-06 07:54:31,040 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1199, PETRI_PLACES=83, PETRI_TRANSITIONS=113} [2022-12-06 07:54:31,040 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 07:54:31,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:31,040 INFO L89 Accepts]: Start accepts. Operand has 83 places, 113 transitions, 1199 flow [2022-12-06 07:54:31,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:31,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:31,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 113 transitions, 1199 flow [2022-12-06 07:54:31,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 113 transitions, 1199 flow [2022-12-06 07:54:31,070 INFO L130 PetriNetUnfolder]: 78/311 cut-off events. [2022-12-06 07:54:31,070 INFO L131 PetriNetUnfolder]: For 1545/1554 co-relation queries the response was YES. [2022-12-06 07:54:31,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 311 events. 78/311 cut-off events. For 1545/1554 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1928 event pairs, 1 based on Foata normal form. 2/310 useless extension candidates. Maximal degree in co-relation 1255. Up to 94 conditions per place. [2022-12-06 07:54:31,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 113 transitions, 1199 flow [2022-12-06 07:54:31,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 07:54:31,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 3 v_~n~0_In_6) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:54:31,157 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [675] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_285| v_~f~0.base_181))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_177 (* v_~x1~0_245 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_177 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120| 0)) (= v_~x1~0_243 (select .cse0 (+ v_~f~0.offset_177 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_159| 3) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|) (not (= 0 (ite (and (< v_~x1~0_245 v_~size~0_181) (<= 0 v_~x1~0_245)) 1 0))) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (< 2 (mod (* 3 v_~n~0_169) 4294967296)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_181)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|))))) InVars {~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, #memory_int=|v_#memory_int_285|, ~n~0=v_~n~0_169, ~x1~0=v_~x1~0_245, ~f~0.offset=v_~f~0.offset_177} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_112|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_181, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_159|, #memory_int=|v_#memory_int_285|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_120|, ~n~0=v_~n~0_169, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_122|, ~x1~0=v_~x1~0_243, ~f~0.offset=v_~f~0.offset_177} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:31,427 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:31,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 390 [2022-12-06 07:54:31,430 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 112 transitions, 1210 flow [2022-12-06 07:54:31,430 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 07:54:31,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:31,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:31,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:54:31,430 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 07:54:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1743020586, now seen corresponding path program 1 times [2022-12-06 07:54:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:31,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498365921] [2022-12-06 07:54:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:32,124 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 07:54:32,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:32,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498365921] [2022-12-06 07:54:32,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498365921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:32,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:32,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085149254] [2022-12-06 07:54:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:32,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:54:32,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:32,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:54:32,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:54:32,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:54:32,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 112 transitions, 1210 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 07:54:32,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:32,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:54:32,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:32,463 INFO L130 PetriNetUnfolder]: 570/1070 cut-off events. [2022-12-06 07:54:32,463 INFO L131 PetriNetUnfolder]: For 6868/6868 co-relation queries the response was YES. [2022-12-06 07:54:32,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5483 conditions, 1070 events. 570/1070 cut-off events. For 6868/6868 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5451 event pairs, 228 based on Foata normal form. 1/1071 useless extension candidates. Maximal degree in co-relation 4704. Up to 908 conditions per place. [2022-12-06 07:54:32,470 INFO L137 encePairwiseOnDemand]: 13/35 looper letters, 92 selfloop transitions, 37 changer transitions 8/137 dead transitions. [2022-12-06 07:54:32,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1659 flow [2022-12-06 07:54:32,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:54:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:54:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 07:54:32,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2022-12-06 07:54:32,471 INFO L175 Difference]: Start difference. First operand has 81 places, 112 transitions, 1210 flow. Second operand 6 states and 62 transitions. [2022-12-06 07:54:32,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1659 flow [2022-12-06 07:54:32,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 137 transitions, 1577 flow, removed 41 selfloop flow, removed 1 redundant places. [2022-12-06 07:54:32,490 INFO L231 Difference]: Finished difference. Result has 87 places, 116 transitions, 1342 flow [2022-12-06 07:54:32,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1342, PETRI_PLACES=87, PETRI_TRANSITIONS=116} [2022-12-06 07:54:32,490 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2022-12-06 07:54:32,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:32,490 INFO L89 Accepts]: Start accepts. Operand has 87 places, 116 transitions, 1342 flow [2022-12-06 07:54:32,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:32,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:32,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 116 transitions, 1342 flow [2022-12-06 07:54:32,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 116 transitions, 1342 flow [2022-12-06 07:54:32,519 INFO L130 PetriNetUnfolder]: 80/328 cut-off events. [2022-12-06 07:54:32,519 INFO L131 PetriNetUnfolder]: For 1485/1489 co-relation queries the response was YES. [2022-12-06 07:54:32,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 328 events. 80/328 cut-off events. For 1485/1489 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2080 event pairs, 1 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 1277. Up to 97 conditions per place. [2022-12-06 07:54:32,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 116 transitions, 1342 flow [2022-12-06 07:54:32,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 07:54:32,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [671] $Ultimate##0-->L86-3: Formula: (and (= (ite (and (<= 0 v_~x1~0_232) (< v_~x1~0_232 v_~size~0_175)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|) (= |v_ULTIMATE.start_main_#t~pre14#1_95| |v_#pthreadsForks_151|) (= v_~x1~0_231 (select (select |v_#memory_int_276| v_~f~0.base_175) (+ v_~f~0.offset_171 (* v_~x1~0_232 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_153| 4294967295) 4294967296) (mod (* 3 v_~n~0_163) 4294967296)) (= (+ |v_#pthreadsForks_151| 1) |v_#pthreadsForks_150|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_153| 1) (= (store |v_#memory_int_276| |v_ULTIMATE.start_main_~#t2~0#1.base_91| (store (select |v_#memory_int_276| |v_ULTIMATE.start_main_~#t2~0#1.base_91|) |v_ULTIMATE.start_main_~#t2~0#1.offset_87| |v_ULTIMATE.start_main_#t~pre14#1_95|)) |v_#memory_int_275|)) InVars {#pthreadsForks=|v_#pthreadsForks_151|, ~size~0=v_~size~0_175, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_87|, ~f~0.base=v_~f~0.base_175, #memory_int=|v_#memory_int_276|, ~n~0=v_~n~0_163, ~x1~0=v_~x1~0_232, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_91|, ~f~0.offset=v_~f~0.offset_171} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_106|, ~size~0=v_~size~0_175, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_87|, ~f~0.base=v_~f~0.base_175, ~x1~0=v_~x1~0_231, ~f~0.offset=v_~f~0.offset_171, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_108|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_98|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_95|, #pthreadsForks=|v_#pthreadsForks_150|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_153|, #memory_int=|v_#memory_int_275|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_78|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_114|, ~n~0=v_~n~0_163, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_91|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:32,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:32,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 07:54:32,691 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 116 transitions, 1351 flow [2022-12-06 07:54:32,691 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 07:54:32,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:32,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:32,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:54:32,691 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 07:54:32,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash 609530576, now seen corresponding path program 1 times [2022-12-06 07:54:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:32,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067179020] [2022-12-06 07:54:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:32,756 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 07:54:32,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:32,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067179020] [2022-12-06 07:54:32,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067179020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897069783] [2022-12-06 07:54:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:32,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:32,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:32,758 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 07:54:32,813 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 07:54:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:32,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:54:32,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:32,902 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 07:54:32,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:32,967 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 07:54:32,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897069783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:32,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:32,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 07:54:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151080569] [2022-12-06 07:54:32,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:32,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:54:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:32,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:54:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:54:32,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:54:32,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 116 transitions, 1351 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 07:54:32,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:32,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:54:32,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:34,348 INFO L130 PetriNetUnfolder]: 553/1055 cut-off events. [2022-12-06 07:54:34,348 INFO L131 PetriNetUnfolder]: For 5972/5972 co-relation queries the response was YES. [2022-12-06 07:54:34,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5416 conditions, 1055 events. 553/1055 cut-off events. For 5972/5972 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5481 event pairs, 129 based on Foata normal form. 16/1071 useless extension candidates. Maximal degree in co-relation 4632. Up to 709 conditions per place. [2022-12-06 07:54:34,354 INFO L137 encePairwiseOnDemand]: 14/36 looper letters, 84 selfloop transitions, 65 changer transitions 16/165 dead transitions. [2022-12-06 07:54:34,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 165 transitions, 2071 flow [2022-12-06 07:54:34,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:54:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:54:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2022-12-06 07:54:34,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-06 07:54:34,356 INFO L175 Difference]: Start difference. First operand has 87 places, 116 transitions, 1351 flow. Second operand 12 states and 88 transitions. [2022-12-06 07:54:34,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 165 transitions, 2071 flow [2022-12-06 07:54:34,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 165 transitions, 2000 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:34,370 INFO L231 Difference]: Finished difference. Result has 101 places, 123 transitions, 1582 flow [2022-12-06 07:54:34,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1582, PETRI_PLACES=101, PETRI_TRANSITIONS=123} [2022-12-06 07:54:34,371 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-06 07:54:34,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:34,371 INFO L89 Accepts]: Start accepts. Operand has 101 places, 123 transitions, 1582 flow [2022-12-06 07:54:34,372 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:34,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:34,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 123 transitions, 1582 flow [2022-12-06 07:54:34,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 123 transitions, 1582 flow [2022-12-06 07:54:34,398 INFO L130 PetriNetUnfolder]: 74/317 cut-off events. [2022-12-06 07:54:34,398 INFO L131 PetriNetUnfolder]: For 2026/2030 co-relation queries the response was YES. [2022-12-06 07:54:34,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 317 events. 74/317 cut-off events. For 2026/2030 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2000 event pairs, 1 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 1489. Up to 100 conditions per place. [2022-12-06 07:54:34,400 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 123 transitions, 1582 flow [2022-12-06 07:54:34,400 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 07:54:34,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_320| v_~f~0.base_209))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_205 (* v_~x2~0_253 4)))) (.cse4 (select .cse2 (+ v_~f~0.offset_205 (* v_~x1~0_316 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_205 (* .cse4 4)))) (.cse3 (select .cse2 (+ v_~f~0.offset_205 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_209)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_148| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_164|) (= (ite (and (< .cse1 v_~size~0_209) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_148|) (= v_~x1~0_315 (select .cse2 (+ v_~f~0.offset_205 (* 4 .cse1)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157|) (< 2 (mod (* 3 v_~n~0_199) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_157| 0)) (= v_~x2~0_252 (select .cse2 (+ v_~f~0.offset_205 (* .cse3 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_164| 0)) (not (= (ite (and (<= 0 v_~x1~0_316) (< v_~x1~0_316 v_~size~0_209)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_209| 3) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_209)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_253) (< v_~x2~0_253 v_~size~0_209)) 1 0) 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_159|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_125| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_209)) 1 0)))))) InVars {~x2~0=v_~x2~0_253, ~size~0=v_~size~0_209, ~f~0.base=v_~f~0.base_209, #memory_int=|v_#memory_int_320|, ~n~0=v_~n~0_199, ~x1~0=v_~x1~0_316, ~f~0.offset=v_~f~0.offset_205} OutVars{~x2~0=v_~x2~0_252, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_156|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, ~size~0=v_~size~0_209, ~f~0.base=v_~f~0.base_209, 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_125|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~x1~0=v_~x1~0_315, ~f~0.offset=v_~f~0.offset_205, 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_148|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_81|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_209|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_79|, #memory_int=|v_#memory_int_320|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_164|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_89|, ~n~0=v_~n~0_199, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_93|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_166|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 3 v_~n~0_In_6) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:54:34,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:35,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:35,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:35,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:35,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:35,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:35,572 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:35,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1201 [2022-12-06 07:54:35,573 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 123 transitions, 1624 flow [2022-12-06 07:54:35,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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 07:54:35,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:35,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:35,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 07:54:35,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:35,773 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 07:54:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:35,774 INFO L85 PathProgramCache]: Analyzing trace with hash -370844362, now seen corresponding path program 1 times [2022-12-06 07:54:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:35,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284012417] [2022-12-06 07:54:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:36,849 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 07:54:36,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:36,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284012417] [2022-12-06 07:54:36,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284012417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:36,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203651509] [2022-12-06 07:54:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:36,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:36,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:36,852 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 07:54:36,855 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 07:54:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:36,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 07:54:36,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:36,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:36,977 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 22 treesize of output 24 [2022-12-06 07:54:37,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:37,047 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 07:54:37,060 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 07:54:37,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:37,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:37,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-06 07:54:37,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:54:37,228 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 07:54:38,439 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 07:54:38,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203651509] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:38,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:38,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:54:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054687362] [2022-12-06 07:54:38,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:38,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:54:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:38,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:54:38,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 07:54:38,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:54:38,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 123 transitions, 1624 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 07:54:38,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:38,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:54:38,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:39,213 INFO L130 PetriNetUnfolder]: 577/1104 cut-off events. [2022-12-06 07:54:39,213 INFO L131 PetriNetUnfolder]: For 8148/8148 co-relation queries the response was YES. [2022-12-06 07:54:39,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 1104 events. 577/1104 cut-off events. For 8148/8148 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5818 event pairs, 90 based on Foata normal form. 1/1105 useless extension candidates. Maximal degree in co-relation 5842. Up to 835 conditions per place. [2022-12-06 07:54:39,220 INFO L137 encePairwiseOnDemand]: 15/41 looper letters, 113 selfloop transitions, 55 changer transitions 4/172 dead transitions. [2022-12-06 07:54:39,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 172 transitions, 2323 flow [2022-12-06 07:54:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:54:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:54:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2022-12-06 07:54:39,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20842572062084258 [2022-12-06 07:54:39,221 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 1624 flow. Second operand 11 states and 94 transitions. [2022-12-06 07:54:39,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 172 transitions, 2323 flow [2022-12-06 07:54:39,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 172 transitions, 2174 flow, removed 59 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:39,247 INFO L231 Difference]: Finished difference. Result has 110 places, 131 transitions, 1796 flow [2022-12-06 07:54:39,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1796, PETRI_PLACES=110, PETRI_TRANSITIONS=131} [2022-12-06 07:54:39,248 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 07:54:39,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:39,248 INFO L89 Accepts]: Start accepts. Operand has 110 places, 131 transitions, 1796 flow [2022-12-06 07:54:39,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:39,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:39,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 131 transitions, 1796 flow [2022-12-06 07:54:39,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 131 transitions, 1796 flow [2022-12-06 07:54:39,282 INFO L130 PetriNetUnfolder]: 79/335 cut-off events. [2022-12-06 07:54:39,282 INFO L131 PetriNetUnfolder]: For 2368/2372 co-relation queries the response was YES. [2022-12-06 07:54:39,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 335 events. 79/335 cut-off events. For 2368/2372 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2161 event pairs, 1 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 1532. Up to 104 conditions per place. [2022-12-06 07:54:39,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 131 transitions, 1796 flow [2022-12-06 07:54:39,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 07:54:39,286 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:39,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 07:54:39,288 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 131 transitions, 1796 flow [2022-12-06 07:54:39,288 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 07:54:39,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:39,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:39,305 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 07:54:39,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:39,492 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 07:54:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1667431495, now seen corresponding path program 1 times [2022-12-06 07:54:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:39,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620254555] [2022-12-06 07:54:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:39,535 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 07:54:39,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:39,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620254555] [2022-12-06 07:54:39,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620254555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:39,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:39,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:54:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020232978] [2022-12-06 07:54:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:39,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:54:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:54:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:54:39,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:54:39,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 131 transitions, 1796 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:39,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:39,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:54:39,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:39,755 INFO L130 PetriNetUnfolder]: 558/1051 cut-off events. [2022-12-06 07:54:39,755 INFO L131 PetriNetUnfolder]: For 9622/9622 co-relation queries the response was YES. [2022-12-06 07:54:39,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 1051 events. 558/1051 cut-off events. For 9622/9622 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5337 event pairs, 136 based on Foata normal form. 8/1059 useless extension candidates. Maximal degree in co-relation 5297. Up to 629 conditions per place. [2022-12-06 07:54:39,762 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 157 selfloop transitions, 8 changer transitions 5/170 dead transitions. [2022-12-06 07:54:39,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 170 transitions, 2609 flow [2022-12-06 07:54:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:54:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:54:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 07:54:39,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2022-12-06 07:54:39,763 INFO L175 Difference]: Start difference. First operand has 109 places, 131 transitions, 1796 flow. Second operand 3 states and 49 transitions. [2022-12-06 07:54:39,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 170 transitions, 2609 flow [2022-12-06 07:54:39,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 170 transitions, 2469 flow, removed 46 selfloop flow, removed 6 redundant places. [2022-12-06 07:54:39,787 INFO L231 Difference]: Finished difference. Result has 105 places, 127 transitions, 1609 flow [2022-12-06 07:54:39,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1609, PETRI_PLACES=105, PETRI_TRANSITIONS=127} [2022-12-06 07:54:39,788 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 07:54:39,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:39,788 INFO L89 Accepts]: Start accepts. Operand has 105 places, 127 transitions, 1609 flow [2022-12-06 07:54:39,788 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:39,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:39,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 127 transitions, 1609 flow [2022-12-06 07:54:39,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 127 transitions, 1609 flow [2022-12-06 07:54:39,818 INFO L130 PetriNetUnfolder]: 78/320 cut-off events. [2022-12-06 07:54:39,818 INFO L131 PetriNetUnfolder]: For 1973/1977 co-relation queries the response was YES. [2022-12-06 07:54:39,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 320 events. 78/320 cut-off events. For 1973/1977 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1958 event pairs, 1 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1443. Up to 101 conditions per place. [2022-12-06 07:54:39,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 127 transitions, 1609 flow [2022-12-06 07:54:39,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 07:54:39,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_271| v_~f~0.base_171))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_167 (* v_~x2~0_193 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_167 (* .cse1 4))))) (and (= (ite (and (< .cse0 v_~size~0_171) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (= |v_thread1Thread1of1ForFork0_~i~0#1_147| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (= (ite (and (< v_~x1~0_222 v_~size~0_171) (<= 0 v_~x1~0_222)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_171)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (= v_~x1~0_221 (select .cse2 (+ v_~f~0.offset_167 (* v_~x1~0_222 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_147| 4294967295) 4294967296) (mod (* 3 v_~n~0_159) 4294967296)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_117|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| 0)) (= (select .cse2 (+ v_~f~0.offset_167 (* .cse0 4))) v_~x2~0_192) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (<= 0 v_~x2~0_193) (< v_~x2~0_193 v_~size~0_171)) 1 0) 0)))))) InVars {~x2~0=v_~x2~0_193, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, #memory_int=|v_#memory_int_271|, ~n~0=v_~n~0_159, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_167} OutVars{~x2~0=v_~x2~0_192, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_53|, 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_117|, ~x1~0=v_~x1~0_221, ~f~0.offset=v_~f~0.offset_167, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_147|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ~n~0=v_~n~0_159, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_57|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_110|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [693] L49-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_312| v_~f~0.base_203))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_199 (* v_~x2~0_237 4))))) (let ((.cse0 (mod (* 3 v_~n~0_191) 4294967296)) (.cse3 (select .cse2 (+ v_~f~0.offset_199 (* .cse1 4))))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_146| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147| 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_146|) |v_thread2Thread1of1ForFork1_~i~1#1_145|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|) (not (= (ite (and (< .cse1 v_~size~0_203) (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_199 (* v_~x1~0_298 4))) v_~x1~0_297) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_153|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_153| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137| (ite (and (<= 0 v_~x1~0_298) (< v_~x1~0_298 v_~size~0_203)) 1 0)) (not (= (ite (and (< v_~x2~0_237 v_~size~0_203) (<= 0 v_~x2~0_237)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_195| 1) |v_thread1Thread1of1ForFork0_~i~0#1_194|) (= (select .cse2 (+ v_~f~0.offset_199 (* 4 .cse3))) v_~x2~0_236) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_195| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| (ite (and (< .cse3 v_~size~0_203) (<= 0 .cse3)) 1 0)))))) InVars {~x2~0=v_~x2~0_237, ~size~0=v_~size~0_203, ~f~0.base=v_~f~0.base_203, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_195|, #memory_int=|v_#memory_int_312|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_146|, ~n~0=v_~n~0_191, ~x1~0=v_~x1~0_298, ~f~0.offset=v_~f~0.offset_199} OutVars{~x2~0=v_~x2~0_236, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_145|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, ~size~0=v_~size~0_203, ~f~0.base=v_~f~0.base_203, 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_115|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_145|, ~x1~0=v_~x1~0_297, ~f~0.offset=v_~f~0.offset_199, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_71|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_194|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_69|, #memory_int=|v_#memory_int_312|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_79|, ~n~0=v_~n~0_191, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_83|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_155|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:54:40,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_271| v_~f~0.base_171))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_167 (* v_~x2~0_193 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_167 (* .cse1 4))))) (and (= (ite (and (< .cse0 v_~size~0_171) (<= 0 .cse0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (= |v_thread1Thread1of1ForFork0_~i~0#1_147| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (= (ite (and (< v_~x1~0_222 v_~size~0_171) (<= 0 v_~x1~0_222)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_171)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (= v_~x1~0_221 (select .cse2 (+ v_~f~0.offset_167 (* v_~x1~0_222 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_147| 4294967295) 4294967296) (mod (* 3 v_~n~0_159) 4294967296)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_117|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| 0)) (= (select .cse2 (+ v_~f~0.offset_167 (* .cse0 4))) v_~x2~0_192) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_89|) (not (= (ite (and (<= 0 v_~x2~0_193) (< v_~x2~0_193 v_~size~0_171)) 1 0) 0)))))) InVars {~x2~0=v_~x2~0_193, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, #memory_int=|v_#memory_int_271|, ~n~0=v_~n~0_159, ~x1~0=v_~x1~0_222, ~f~0.offset=v_~f~0.offset_167} OutVars{~x2~0=v_~x2~0_192, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_100|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_81|, ~size~0=v_~size~0_171, ~f~0.base=v_~f~0.base_171, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_53|, 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_117|, ~x1~0=v_~x1~0_221, ~f~0.offset=v_~f~0.offset_167, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_147|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, #memory_int=|v_#memory_int_271|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ~n~0=v_~n~0_159, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_57|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_110|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [692] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_310| v_~f~0.base_201))) (let ((.cse2 (mod (* 3 v_~n~0_189) 4294967296)) (.cse1 (select .cse0 (+ v_~f~0.offset_197 (* v_~x1~0_293 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|) (= (select .cse0 (+ v_~f~0.offset_197 (* .cse1 4))) v_~x1~0_291) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_190| 1) 4294967296) .cse2) (not (= 0 (ite (and (< v_~x1~0_293 v_~size~0_201) (<= 0 v_~x1~0_293)) 1 0))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_190| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_188| (+ |v_thread1Thread1of1ForFork0_~i~0#1_190| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133| (ite (and (< .cse1 v_~size~0_201) (<= 0 .cse1)) 1 0))))) InVars {~size~0=v_~size~0_201, ~f~0.base=v_~f~0.base_201, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_190|, #memory_int=|v_#memory_int_310|, ~n~0=v_~n~0_189, ~x1~0=v_~x1~0_293, ~f~0.offset=v_~f~0.offset_197} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_141|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_133|, ~size~0=v_~size~0_201, ~f~0.base=v_~f~0.base_201, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_188|, #memory_int=|v_#memory_int_310|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_149|, ~n~0=v_~n~0_189, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_151|, ~x1~0=v_~x1~0_291, ~f~0.offset=v_~f~0.offset_197} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:41,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [715] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_349| v_~f~0.base_233))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_229 (* v_~x2~0_281 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_229 (* v_~x1~0_374 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_229 (* .cse3 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_229 (* .cse0 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_233)) 1 0) 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_190|) (= (select .cse1 (+ v_~f~0.offset_229 (* 4 .cse2))) v_~x1~0_372) (not (= (ite (and (< v_~x2~0_281 v_~size~0_233) (<= 0 v_~x2~0_281)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_233) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176| 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_233)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|) (not (= (ite (and (< v_~x1~0_374 v_~size~0_233) (<= 0 v_~x1~0_374)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_253| 3) (< 2 (mod (* 3 v_~n~0_223) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_144| (ite (and (< .cse4 v_~size~0_233) (<= 0 .cse4)) 1 0)) (= (select .cse1 (+ v_~f~0.offset_229 (* .cse4 4))) v_~x2~0_280))))) InVars {~x2~0=v_~x2~0_281, ~size~0=v_~size~0_233, ~f~0.base=v_~f~0.base_233, #memory_int=|v_#memory_int_349|, ~n~0=v_~n~0_223, ~x1~0=v_~x1~0_374, ~f~0.offset=v_~f~0.offset_229} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_188|, ~x2~0=v_~x2~0_280, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_136|, ~size~0=v_~size~0_233, ~f~0.base=v_~f~0.base_233, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_108|, 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_190|, ~x1~0=v_~x1~0_372, ~f~0.offset=v_~f~0.offset_229, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_180|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_100|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_253|, #memory_int=|v_#memory_int_349|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_196|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_98|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_108|, ~n~0=v_~n~0_223, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_198|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_112|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:41,593 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:41,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1805 [2022-12-06 07:54:41,593 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1658 flow [2022-12-06 07:54:41,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:41,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:41,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:41,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:54:41,594 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 07:54:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 825073917, now seen corresponding path program 2 times [2022-12-06 07:54:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:41,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397740660] [2022-12-06 07:54:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:41,655 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 07:54:41,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:41,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397740660] [2022-12-06 07:54:41,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397740660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:41,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:41,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468210449] [2022-12-06 07:54:41,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:41,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:41,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:54:41,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1658 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 07:54:41,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:41,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:54:41,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:41,982 INFO L130 PetriNetUnfolder]: 550/1082 cut-off events. [2022-12-06 07:54:41,982 INFO L131 PetriNetUnfolder]: For 8885/8885 co-relation queries the response was YES. [2022-12-06 07:54:41,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6289 conditions, 1082 events. 550/1082 cut-off events. For 8885/8885 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5826 event pairs, 110 based on Foata normal form. 12/1092 useless extension candidates. Maximal degree in co-relation 5702. Up to 520 conditions per place. [2022-12-06 07:54:41,988 INFO L137 encePairwiseOnDemand]: 19/41 looper letters, 155 selfloop transitions, 32 changer transitions 12/199 dead transitions. [2022-12-06 07:54:41,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 199 transitions, 2734 flow [2022-12-06 07:54:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-06 07:54:41,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23035230352303523 [2022-12-06 07:54:41,989 INFO L175 Difference]: Start difference. First operand has 105 places, 127 transitions, 1658 flow. Second operand 9 states and 85 transitions. [2022-12-06 07:54:41,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 199 transitions, 2734 flow [2022-12-06 07:54:42,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 199 transitions, 2677 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:42,007 INFO L231 Difference]: Finished difference. Result has 112 places, 127 transitions, 1680 flow [2022-12-06 07:54:42,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1680, PETRI_PLACES=112, PETRI_TRANSITIONS=127} [2022-12-06 07:54:42,008 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-06 07:54:42,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:42,008 INFO L89 Accepts]: Start accepts. Operand has 112 places, 127 transitions, 1680 flow [2022-12-06 07:54:42,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:42,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:42,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 127 transitions, 1680 flow [2022-12-06 07:54:42,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 127 transitions, 1680 flow [2022-12-06 07:54:42,038 INFO L130 PetriNetUnfolder]: 80/329 cut-off events. [2022-12-06 07:54:42,038 INFO L131 PetriNetUnfolder]: For 2232/2236 co-relation queries the response was YES. [2022-12-06 07:54:42,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 329 events. 80/329 cut-off events. For 2232/2236 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2023 event pairs, 1 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1679. Up to 99 conditions per place. [2022-12-06 07:54:42,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 127 transitions, 1680 flow [2022-12-06 07:54:42,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 07:54:42,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_304| v_~f~0.base_197))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_193 (* v_~x2~0_233 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_193 (* v_~x1~0_282 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_193 (* .cse3 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|) (= (ite (and (< .cse0 v_~size~0_197) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_197)) 1 0)) (= v_~x1~0_281 (select .cse2 (+ v_~f~0.offset_193 (* .cse0 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|) (not (= (ite (and (< .cse3 v_~size~0_197) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_282 v_~size~0_197) (<= 0 v_~x1~0_282)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145| 0)) (= v_~x2~0_232 (select .cse2 (+ v_~f~0.offset_193 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_143|) (= |v_thread1Thread1of1ForFork0_~i~0#1_182| 2) (not (= 0 (ite (and (<= 0 v_~x2~0_233) (< v_~x2~0_233 v_~size~0_197)) 1 0))) (< 1 (mod (* 3 v_~n~0_185) 4294967296)))))) InVars {~x2~0=v_~x2~0_233, ~size~0=v_~size~0_197, ~f~0.base=v_~f~0.base_197, #memory_int=|v_#memory_int_304|, ~n~0=v_~n~0_185, ~x1~0=v_~x1~0_282, ~f~0.offset=v_~f~0.offset_193} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_135|, ~x2~0=v_~x2~0_232, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_197, ~f~0.base=v_~f~0.base_197, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_77|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_113|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_143|, ~x1~0=v_~x1~0_281, ~f~0.offset=v_~f~0.offset_193, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_145|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_127|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_69|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_182|, #memory_int=|v_#memory_int_304|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_143|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_67|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_77|, ~n~0=v_~n~0_185, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_145|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_81|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:54:42,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:42,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 941 [2022-12-06 07:54:42,949 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 1702 flow [2022-12-06 07:54:42,949 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 07:54:42,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:42,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:42,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 07:54:42,949 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 07:54:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 145999250, now seen corresponding path program 1 times [2022-12-06 07:54:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:42,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521855024] [2022-12-06 07:54:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:43,434 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 07:54:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:43,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521855024] [2022-12-06 07:54:43,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521855024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:43,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:43,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:54:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714510383] [2022-12-06 07:54:43,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:43,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:43,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:54:43,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 127 transitions, 1702 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 07:54:43,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:43,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:54:43,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:43,751 INFO L130 PetriNetUnfolder]: 545/1040 cut-off events. [2022-12-06 07:54:43,752 INFO L131 PetriNetUnfolder]: For 9018/9018 co-relation queries the response was YES. [2022-12-06 07:54:43,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6402 conditions, 1040 events. 545/1040 cut-off events. For 9018/9018 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5324 event pairs, 244 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 6060. Up to 960 conditions per place. [2022-12-06 07:54:43,758 INFO L137 encePairwiseOnDemand]: 18/40 looper letters, 102 selfloop transitions, 32 changer transitions 8/142 dead transitions. [2022-12-06 07:54:43,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 2097 flow [2022-12-06 07:54:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 07:54:43,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 07:54:43,761 INFO L175 Difference]: Start difference. First operand has 106 places, 127 transitions, 1702 flow. Second operand 4 states and 55 transitions. [2022-12-06 07:54:43,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 142 transitions, 2097 flow [2022-12-06 07:54:43,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 142 transitions, 1990 flow, removed 45 selfloop flow, removed 5 redundant places. [2022-12-06 07:54:43,784 INFO L231 Difference]: Finished difference. Result has 105 places, 126 transitions, 1685 flow [2022-12-06 07:54:43,784 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1685, PETRI_PLACES=105, PETRI_TRANSITIONS=126} [2022-12-06 07:54:43,785 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 07:54:43,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:43,785 INFO L89 Accepts]: Start accepts. Operand has 105 places, 126 transitions, 1685 flow [2022-12-06 07:54:43,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:43,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:43,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 126 transitions, 1685 flow [2022-12-06 07:54:43,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 126 transitions, 1685 flow [2022-12-06 07:54:43,813 INFO L130 PetriNetUnfolder]: 79/326 cut-off events. [2022-12-06 07:54:43,813 INFO L131 PetriNetUnfolder]: For 2051/2055 co-relation queries the response was YES. [2022-12-06 07:54:43,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 326 events. 79/326 cut-off events. For 2051/2055 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2020 event pairs, 1 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 1679. Up to 99 conditions per place. [2022-12-06 07:54:43,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 126 transitions, 1685 flow [2022-12-06 07:54:43,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 07:54:45,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_351| v_~f~0.base_235))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_231 (* v_~x2~0_286 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_231 (* .cse2 4))))) (let ((.cse5 (select .cse0 (+ (* .cse7 4) v_~f~0.offset_231)))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_231 (* .cse5 4)))) (.cse3 (select .cse0 (+ v_~f~0.offset_231 (* v_~x1~0_379 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_231 (* .cse3 4)))) (.cse6 (select .cse0 (+ v_~f~0.offset_231 (* .cse4 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_286) (< v_~x2~0_286 v_~size~0_235)) 1 0) 0)) (= v_~x1~0_378 (select .cse0 (+ v_~f~0.offset_231 (* .cse1 4)))) (not (= 0 (ite (and (< .cse2 v_~size~0_235) (<= 0 .cse2)) 1 0))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_235)) 1 0) 0)) (= (ite (and (< .cse1 v_~size~0_235) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_235)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_235)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_257| 3) (not (= (ite (and (< v_~x1~0_379 v_~size~0_235) (<= 0 v_~x1~0_379)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| (ite (and (< .cse6 v_~size~0_235) (<= 0 .cse6)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_235) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_178|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_178| 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_192|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|) (= (select .cse0 (+ v_~f~0.offset_231 (* .cse6 4))) v_~x2~0_284) (< 3 (mod (* 3 v_~n~0_225) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200| 0))))))))) InVars {~x2~0=v_~x2~0_286, ~size~0=v_~size~0_235, ~f~0.base=v_~f~0.base_235, #memory_int=|v_#memory_int_351|, ~n~0=v_~n~0_225, ~x1~0=v_~x1~0_379, ~f~0.offset=v_~f~0.offset_231} OutVars{~x2~0=v_~x2~0_284, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_192|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_138|, ~size~0=v_~size~0_235, ~f~0.base=v_~f~0.base_235, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_110|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_192|, ~x1~0=v_~x1~0_378, ~f~0.offset=v_~f~0.offset_231, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_178|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_184|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_102|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_257|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_100|, #memory_int=|v_#memory_int_351|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_200|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_110|, ~n~0=v_~n~0_225, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_114|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_202|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [631] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 3 v_~n~0_In_6) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_6, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:54:45,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:45,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_298| v_~f~0.base_191))) (let ((.cse4 (select .cse2 (+ (* v_~x2~0_218 4) v_~f~0.offset_187)))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_187 (* 4 .cse4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_187 (* .cse5 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_187 (* 4 .cse0))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_187 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (not (= (ite (and (< .cse0 v_~size~0_191) (<= 0 .cse0)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_133|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_103| (ite (and (< .cse1 v_~size~0_191) (<= 0 .cse1)) 1 0)) (= v_~x2~0_216 (select .cse2 (+ v_~f~0.offset_187 (* .cse1 4)))) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_191)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_191) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_218) (< v_~x2~0_218 v_~size~0_191)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_191)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_133| 4294967293) 4294967296) (mod (* 3 v_~n~0_179) 4294967296))))))))) InVars {~x2~0=v_~x2~0_218, ~size~0=v_~size~0_191, ~f~0.base=v_~f~0.base_191, #memory_int=|v_#memory_int_298|, ~n~0=v_~n~0_179, ~f~0.offset=v_~f~0.offset_187} OutVars{~x2~0=v_~x2~0_216, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, ~size~0=v_~size~0_191, ~f~0.base=v_~f~0.base_191, 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_103|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_133|, ~f~0.offset=v_~f~0.offset_187, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_59|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_57|, #memory_int=|v_#memory_int_298|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_67|, ~n~0=v_~n~0_179, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:46,429 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:54:46,429 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2644 [2022-12-06 07:54:46,429 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 1762 flow [2022-12-06 07:54:46,429 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 07:54:46,429 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:46,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:46,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 07:54:46,430 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 07:54:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1882138312, now seen corresponding path program 1 times [2022-12-06 07:54:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:46,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267238007] [2022-12-06 07:54:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:46,510 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 07:54:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:46,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267238007] [2022-12-06 07:54:46,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267238007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:46,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:46,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:54:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200269755] [2022-12-06 07:54:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:54:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:54:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:54:46,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 07:54:46,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 1762 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 07:54:46,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:46,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 07:54:46,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:46,743 INFO L130 PetriNetUnfolder]: 509/945 cut-off events. [2022-12-06 07:54:46,744 INFO L131 PetriNetUnfolder]: For 7455/7455 co-relation queries the response was YES. [2022-12-06 07:54:46,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5958 conditions, 945 events. 509/945 cut-off events. For 7455/7455 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4507 event pairs, 219 based on Foata normal form. 30/973 useless extension candidates. Maximal degree in co-relation 5635. Up to 798 conditions per place. [2022-12-06 07:54:46,750 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 95 selfloop transitions, 27 changer transitions 17/139 dead transitions. [2022-12-06 07:54:46,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 2196 flow [2022-12-06 07:54:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:54:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:54:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 07:54:46,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-06 07:54:46,751 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 1762 flow. Second operand 4 states and 56 transitions. [2022-12-06 07:54:46,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 2196 flow [2022-12-06 07:54:46,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 2115 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-06 07:54:46,767 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 1591 flow [2022-12-06 07:54:46,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1591, PETRI_PLACES=103, PETRI_TRANSITIONS=115} [2022-12-06 07:54:46,767 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 07:54:46,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:46,767 INFO L89 Accepts]: Start accepts. Operand has 103 places, 115 transitions, 1591 flow [2022-12-06 07:54:46,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:46,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:46,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 115 transitions, 1591 flow [2022-12-06 07:54:46,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 115 transitions, 1591 flow [2022-12-06 07:54:46,792 INFO L130 PetriNetUnfolder]: 76/273 cut-off events. [2022-12-06 07:54:46,792 INFO L131 PetriNetUnfolder]: For 2002/2006 co-relation queries the response was YES. [2022-12-06 07:54:46,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 273 events. 76/273 cut-off events. For 2002/2006 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1477 event pairs, 1 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 1459. Up to 101 conditions per place. [2022-12-06 07:54:46,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 115 transitions, 1591 flow [2022-12-06 07:54:46,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 07:54:46,795 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:46,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 07:54:46,797 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 115 transitions, 1591 flow [2022-12-06 07:54:46,797 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 07:54:46,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:46,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:46,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:54:46,797 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 07:54:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -845534643, now seen corresponding path program 1 times [2022-12-06 07:54:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:46,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136552472] [2022-12-06 07:54:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:46,884 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 07:54:46,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:46,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136552472] [2022-12-06 07:54:46,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136552472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:46,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:46,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:46,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643585736] [2022-12-06 07:54:46,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:46,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:46,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:46,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:54:46,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 115 transitions, 1591 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:46,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:46,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:54:46,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:47,099 INFO L130 PetriNetUnfolder]: 487/891 cut-off events. [2022-12-06 07:54:47,100 INFO L131 PetriNetUnfolder]: For 7030/7030 co-relation queries the response was YES. [2022-12-06 07:54:47,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 891 events. 487/891 cut-off events. For 7030/7030 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4132 event pairs, 213 based on Foata normal form. 4/895 useless extension candidates. Maximal degree in co-relation 5214. Up to 771 conditions per place. [2022-12-06 07:54:47,105 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 95 selfloop transitions, 38 changer transitions 3/136 dead transitions. [2022-12-06 07:54:47,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 136 transitions, 2085 flow [2022-12-06 07:54:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:54:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:54:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-06 07:54:47,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2606837606837607 [2022-12-06 07:54:47,106 INFO L175 Difference]: Start difference. First operand has 97 places, 115 transitions, 1591 flow. Second operand 6 states and 61 transitions. [2022-12-06 07:54:47,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 136 transitions, 2085 flow [2022-12-06 07:54:47,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 2031 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:47,122 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 1698 flow [2022-12-06 07:54:47,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1698, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2022-12-06 07:54:47,122 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 81 predicate places. [2022-12-06 07:54:47,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:47,122 INFO L89 Accepts]: Start accepts. Operand has 102 places, 118 transitions, 1698 flow [2022-12-06 07:54:47,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:47,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:47,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 118 transitions, 1698 flow [2022-12-06 07:54:47,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 118 transitions, 1698 flow [2022-12-06 07:54:47,148 INFO L130 PetriNetUnfolder]: 78/275 cut-off events. [2022-12-06 07:54:47,148 INFO L131 PetriNetUnfolder]: For 2352/2356 co-relation queries the response was YES. [2022-12-06 07:54:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 275 events. 78/275 cut-off events. For 2352/2356 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1478 event pairs, 1 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 1540. Up to 100 conditions per place. [2022-12-06 07:54:47,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 118 transitions, 1698 flow [2022-12-06 07:54:47,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 07:54:47,150 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:54:47,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 07:54:47,151 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 1698 flow [2022-12-06 07:54:47,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:54:47,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:47,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:47,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 07:54:47,151 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 07:54:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -180227545, now seen corresponding path program 1 times [2022-12-06 07:54:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:47,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173864292] [2022-12-06 07:54:47,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:47,223 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 07:54:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:47,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173864292] [2022-12-06 07:54:47,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173864292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:47,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933368607] [2022-12-06 07:54:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:47,225 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 07:54:47,267 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 07:54:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:47,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 07:54:47,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:47,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:47,349 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 07:54:47,351 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 07:54:47,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:54:47,380 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 22 treesize of output 22 [2022-12-06 07:54:47,712 INFO L321 Elim1Store]: treesize reduction 259, result has 10.4 percent of original size [2022-12-06 07:54:47,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 17 new quantified variables, introduced 36 case distinctions, treesize of input 115 treesize of output 88 [2022-12-06 07:54:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:47,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:54:48,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933368607] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:48,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:48,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 07:54:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690326124] [2022-12-06 07:54:48,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:48,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:54:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:48,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:54:48,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:54:48,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:54:48,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 118 transitions, 1698 flow. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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 07:54:48,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:48,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:54:48,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:51,622 INFO L130 PetriNetUnfolder]: 545/1004 cut-off events. [2022-12-06 07:54:51,622 INFO L131 PetriNetUnfolder]: For 9715/9715 co-relation queries the response was YES. [2022-12-06 07:54:51,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6575 conditions, 1004 events. 545/1004 cut-off events. For 9715/9715 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4944 event pairs, 195 based on Foata normal form. 17/1021 useless extension candidates. Maximal degree in co-relation 6059. Up to 683 conditions per place. [2022-12-06 07:54:51,629 INFO L137 encePairwiseOnDemand]: 12/39 looper letters, 93 selfloop transitions, 47 changer transitions 40/180 dead transitions. [2022-12-06 07:54:51,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 180 transitions, 2674 flow [2022-12-06 07:54:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:54:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:54:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-12-06 07:54:51,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17467948717948717 [2022-12-06 07:54:51,637 INFO L175 Difference]: Start difference. First operand has 102 places, 118 transitions, 1698 flow. Second operand 16 states and 109 transitions. [2022-12-06 07:54:51,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 180 transitions, 2674 flow [2022-12-06 07:54:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 2593 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 07:54:51,668 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 1690 flow [2022-12-06 07:54:51,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1690, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2022-12-06 07:54:51,669 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 07:54:51,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:51,669 INFO L89 Accepts]: Start accepts. Operand has 121 places, 115 transitions, 1690 flow [2022-12-06 07:54:51,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:51,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:51,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 115 transitions, 1690 flow [2022-12-06 07:54:51,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 1690 flow [2022-12-06 07:54:51,699 INFO L130 PetriNetUnfolder]: 70/268 cut-off events. [2022-12-06 07:54:51,699 INFO L131 PetriNetUnfolder]: For 2447/2451 co-relation queries the response was YES. [2022-12-06 07:54:51,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 268 events. 70/268 cut-off events. For 2447/2451 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1493 event pairs, 1 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 1592. Up to 92 conditions per place. [2022-12-06 07:54:51,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 1690 flow [2022-12-06 07:54:51,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 07:54:51,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:52,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [697] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_318| v_~f~0.base_207))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_203 (* v_~x2~0_248 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_203 (* .cse4 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_203 (* .cse0 4))))) (let ((.cse7 (select .cse3 (+ (* 4 .cse5) v_~f~0.offset_203)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_203 (* .cse7 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_203 (* .cse2 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_203 (* .cse8 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_203 (* 4 .cse6))))) (and (not (= (ite (and (< .cse0 v_~size~0_207) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_207)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_207)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_153|) (= v_~x2~0_246 (select .cse3 (+ v_~f~0.offset_203 (* .cse1 4)))) (not (= (ite (and (< v_~x2~0_248 v_~size~0_207) (<= 0 v_~x2~0_248)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_121| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_207)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_207) (<= 0 .cse5)) 1 0) 0)) (= (ite (and (< v_~x1~0_312 v_~size~0_207) (<= 0 v_~x1~0_312)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_146|) (= |v_thread1Thread1of1ForFork0_~i~0#1_205| 1) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_153| 4294967293) 4294967296) (mod (* 3 v_~n~0_195) 4294967296)) (= v_~x1~0_311 (select .cse3 (+ v_~f~0.offset_203 (* v_~x1~0_312 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162| 0)) (not (= (ite (and (< .cse6 v_~size~0_207) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_207)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_146| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_207)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_248, ~size~0=v_~size~0_207, ~f~0.base=v_~f~0.base_207, #memory_int=|v_#memory_int_318|, ~n~0=v_~n~0_195, ~x1~0=v_~x1~0_312, ~f~0.offset=v_~f~0.offset_203} OutVars{~x2~0=v_~x2~0_246, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_113|, ~size~0=v_~size~0_207, ~f~0.base=v_~f~0.base_207, 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_121|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_153|, ~x1~0=v_~x1~0_311, ~f~0.offset=v_~f~0.offset_203, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_146|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_77|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_205|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_75|, #memory_int=|v_#memory_int_318|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_85|, ~n~0=v_~n~0_195, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_89|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_164|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:57,304 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:54:57,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5636 [2022-12-06 07:54:57,305 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 1767 flow [2022-12-06 07:54:57,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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 07:54:57,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:57,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:57,311 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 07:54:57,506 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,SelfDestructingSolverStorable26 [2022-12-06 07:54:57,506 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 07:54:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -358287517, now seen corresponding path program 1 times [2022-12-06 07:54:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:57,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761713284] [2022-12-06 07:54:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:57,564 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 07:54:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:57,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761713284] [2022-12-06 07:54:57,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761713284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:57,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:57,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237196900] [2022-12-06 07:54:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:57,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:57,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:54:57,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 1767 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 07:54:57,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:57,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:54:57,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:57,866 INFO L130 PetriNetUnfolder]: 487/921 cut-off events. [2022-12-06 07:54:57,867 INFO L131 PetriNetUnfolder]: For 10906/10906 co-relation queries the response was YES. [2022-12-06 07:54:57,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6176 conditions, 921 events. 487/921 cut-off events. For 10906/10906 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4559 event pairs, 93 based on Foata normal form. 8/927 useless extension candidates. Maximal degree in co-relation 5990. Up to 457 conditions per place. [2022-12-06 07:54:57,872 INFO L137 encePairwiseOnDemand]: 17/39 looper letters, 129 selfloop transitions, 47 changer transitions 4/180 dead transitions. [2022-12-06 07:54:57,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 180 transitions, 2932 flow [2022-12-06 07:54:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-12-06 07:54:57,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21082621082621084 [2022-12-06 07:54:57,873 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 1767 flow. Second operand 9 states and 74 transitions. [2022-12-06 07:54:57,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 180 transitions, 2932 flow [2022-12-06 07:54:57,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 180 transitions, 2528 flow, removed 180 selfloop flow, removed 11 redundant places. [2022-12-06 07:54:57,896 INFO L231 Difference]: Finished difference. Result has 116 places, 129 transitions, 1785 flow [2022-12-06 07:54:57,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1785, PETRI_PLACES=116, PETRI_TRANSITIONS=129} [2022-12-06 07:54:57,896 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2022-12-06 07:54:57,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:57,897 INFO L89 Accepts]: Start accepts. Operand has 116 places, 129 transitions, 1785 flow [2022-12-06 07:54:57,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:57,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:57,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 129 transitions, 1785 flow [2022-12-06 07:54:57,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 129 transitions, 1785 flow [2022-12-06 07:54:57,925 INFO L130 PetriNetUnfolder]: 78/292 cut-off events. [2022-12-06 07:54:57,925 INFO L131 PetriNetUnfolder]: For 2436/2440 co-relation queries the response was YES. [2022-12-06 07:54:57,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 292 events. 78/292 cut-off events. For 2436/2440 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1655 event pairs, 1 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 1658. Up to 86 conditions per place. [2022-12-06 07:54:57,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 129 transitions, 1785 flow [2022-12-06 07:54:57,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 07:54:57,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:58,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:58,132 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:58,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 07:54:58,133 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 128 transitions, 1793 flow [2022-12-06 07:54:58,133 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 07:54:58,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:58,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:54:58,133 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 07:54:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1517225268, now seen corresponding path program 1 times [2022-12-06 07:54:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:58,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141926198] [2022-12-06 07:54:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:58,196 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 07:54:58,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:58,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141926198] [2022-12-06 07:54:58,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141926198] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:54:58,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003994206] [2022-12-06 07:54:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:54:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:54:58,213 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 07:54:58,253 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 07:54:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:58,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:54:58,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:54:58,489 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 07:54:58,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:54:58,506 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 07:54:58,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003994206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:54:58,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:54:58,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 07:54:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246573246] [2022-12-06 07:54:58,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:54:58,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:54:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:54:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:54:58,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:54:58,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 128 transitions, 1793 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 07:54:58,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:58,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:54:58,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:58,839 INFO L130 PetriNetUnfolder]: 497/936 cut-off events. [2022-12-06 07:54:58,839 INFO L131 PetriNetUnfolder]: For 8553/8553 co-relation queries the response was YES. [2022-12-06 07:54:58,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6126 conditions, 936 events. 497/936 cut-off events. For 8553/8553 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4523 event pairs, 220 based on Foata normal form. 12/948 useless extension candidates. Maximal degree in co-relation 5857. Up to 764 conditions per place. [2022-12-06 07:54:58,845 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 99 selfloop transitions, 17 changer transitions 33/149 dead transitions. [2022-12-06 07:54:58,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 149 transitions, 2365 flow [2022-12-06 07:54:58,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:54:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:54:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 07:54:58,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22142857142857142 [2022-12-06 07:54:58,846 INFO L175 Difference]: Start difference. First operand has 114 places, 128 transitions, 1793 flow. Second operand 7 states and 62 transitions. [2022-12-06 07:54:58,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 149 transitions, 2365 flow [2022-12-06 07:54:58,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 2278 flow, removed 35 selfloop flow, removed 2 redundant places. [2022-12-06 07:54:58,868 INFO L231 Difference]: Finished difference. Result has 121 places, 109 transitions, 1494 flow [2022-12-06 07:54:58,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1494, PETRI_PLACES=121, PETRI_TRANSITIONS=109} [2022-12-06 07:54:58,871 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 07:54:58,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:58,871 INFO L89 Accepts]: Start accepts. Operand has 121 places, 109 transitions, 1494 flow [2022-12-06 07:54:58,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:58,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:58,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 109 transitions, 1494 flow [2022-12-06 07:54:58,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 1494 flow [2022-12-06 07:54:58,900 INFO L130 PetriNetUnfolder]: 65/270 cut-off events. [2022-12-06 07:54:58,900 INFO L131 PetriNetUnfolder]: For 2352/2356 co-relation queries the response was YES. [2022-12-06 07:54:58,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 270 events. 65/270 cut-off events. For 2352/2356 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1536 event pairs, 1 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 1505. Up to 77 conditions per place. [2022-12-06 07:54:58,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 1494 flow [2022-12-06 07:54:58,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 07:54:58,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:54:59,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:54:59,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 501 [2022-12-06 07:54:59,372 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 1512 flow [2022-12-06 07:54:59,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 07:54:59,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:54:59,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:59,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 07:54:59,582 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,SelfDestructingSolverStorable28 [2022-12-06 07:54:59,582 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 07:54:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:54:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1186155491, now seen corresponding path program 2 times [2022-12-06 07:54:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:54:59,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374248784] [2022-12-06 07:54:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:54:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:54:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:54:59,676 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 07:54:59,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:54:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374248784] [2022-12-06 07:54:59,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374248784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:54:59,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:54:59,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:54:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090668343] [2022-12-06 07:54:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:54:59,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:54:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:54:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:54:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:54:59,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 07:54:59,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 1512 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 07:54:59,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:54:59,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 07:54:59,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:54:59,968 INFO L130 PetriNetUnfolder]: 476/930 cut-off events. [2022-12-06 07:54:59,968 INFO L131 PetriNetUnfolder]: For 8838/8838 co-relation queries the response was YES. [2022-12-06 07:54:59,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5897 conditions, 930 events. 476/930 cut-off events. For 8838/8838 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4669 event pairs, 222 based on Foata normal form. 8/938 useless extension candidates. Maximal degree in co-relation 5736. Up to 760 conditions per place. [2022-12-06 07:54:59,973 INFO L137 encePairwiseOnDemand]: 18/35 looper letters, 103 selfloop transitions, 30 changer transitions 9/142 dead transitions. [2022-12-06 07:54:59,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 142 transitions, 2076 flow [2022-12-06 07:54:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:54:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:54:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-12-06 07:54:59,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23174603174603176 [2022-12-06 07:54:59,974 INFO L175 Difference]: Start difference. First operand has 116 places, 109 transitions, 1512 flow. Second operand 9 states and 73 transitions. [2022-12-06 07:54:59,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 142 transitions, 2076 flow [2022-12-06 07:54:59,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 142 transitions, 1982 flow, removed 22 selfloop flow, removed 7 redundant places. [2022-12-06 07:54:59,993 INFO L231 Difference]: Finished difference. Result has 121 places, 112 transitions, 1561 flow [2022-12-06 07:54:59,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1561, PETRI_PLACES=121, PETRI_TRANSITIONS=112} [2022-12-06 07:54:59,994 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 07:54:59,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:54:59,994 INFO L89 Accepts]: Start accepts. Operand has 121 places, 112 transitions, 1561 flow [2022-12-06 07:54:59,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:54:59,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:54:59,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 112 transitions, 1561 flow [2022-12-06 07:54:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 112 transitions, 1561 flow [2022-12-06 07:55:00,024 INFO L130 PetriNetUnfolder]: 76/300 cut-off events. [2022-12-06 07:55:00,024 INFO L131 PetriNetUnfolder]: For 2930/2935 co-relation queries the response was YES. [2022-12-06 07:55:00,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 300 events. 76/300 cut-off events. For 2930/2935 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1779 event pairs, 10 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 1682. Up to 82 conditions per place. [2022-12-06 07:55:00,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 112 transitions, 1561 flow [2022-12-06 07:55:00,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 07:55:00,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_396| v_~f~0.base_277))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_273 (* v_~x2~0_387 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_273 (* 4 .cse3))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_273 (* .cse5 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_273 (* .cse2 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_273 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_277)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_277)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_277)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_277)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_387 v_~size~0_277) (<= 0 v_~x2~0_387)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_273 (* .cse0 4))) v_~x2~0_385) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_240| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_240|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_264|) (< 3 (mod (* 3 v_~n~0_267) 4294967296)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_277)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_387, ~size~0=v_~size~0_277, ~f~0.base=v_~f~0.base_277, #memory_int=|v_#memory_int_396|, ~n~0=v_~n~0_267, ~f~0.offset=v_~f~0.offset_273} OutVars{~x2~0=v_~x2~0_385, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_200|, ~size~0=v_~size~0_277, ~f~0.base=v_~f~0.base_277, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_172|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_208|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_264|, ~f~0.offset=v_~f~0.offset_273, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_240|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_164|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_162|, #memory_int=|v_#memory_int_396|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_172|, ~n~0=v_~n~0_267, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_176|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:01,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_398| v_~f~0.base_279)) (.cse2 (select (select |v_#memory_int_399| v_~f~0.base_279) (+ v_~f~0.offset_275 (* v_~x1~0_466 4))))) (let ((.cse1 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_275)))) (and (not (= (ite (and (< v_~x1~0_466 v_~size~0_279) (<= 0 v_~x1~0_466)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249| 0)) (= v_~x1~0_464 (select .cse0 (+ v_~f~0.offset_275 (* .cse1 4)))) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_279)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233|) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_279)) 1 0) 0)) (= (+ |v_#pthreadsForks_172| 1) |v_#pthreadsForks_171|) (= (store |v_#memory_int_399| |v_ULTIMATE.start_main_~#t2~0#1.base_99| (store (select |v_#memory_int_399| |v_ULTIMATE.start_main_~#t2~0#1.base_99|) |v_ULTIMATE.start_main_~#t2~0#1.offset_95| |v_ULTIMATE.start_main_#t~pre14#1_113|)) |v_#memory_int_398|) (= |v_ULTIMATE.start_main_#t~pre14#1_113| |v_#pthreadsForks_172|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|) (= |v_thread1Thread1of1ForFork0_~i~0#1_319| 3) (< 2 (mod (* 3 v_~n~0_269) 4294967296))))) InVars {~size~0=v_~size~0_279, #pthreadsForks=|v_#pthreadsForks_172|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_95|, ~f~0.base=v_~f~0.base_279, #memory_int=|v_#memory_int_399|, ~n~0=v_~n~0_269, ~x1~0=v_~x1~0_466, ~f~0.offset=v_~f~0.offset_275, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_99|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_241|, ~size~0=v_~size~0_279, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_95|, ~f~0.base=v_~f~0.base_279, ~x1~0=v_~x1~0_464, ~f~0.offset=v_~f~0.offset_275, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_233|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_121|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_113|, #pthreadsForks=|v_#pthreadsForks_171|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_319|, #memory_int=|v_#memory_int_398|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_249|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_91|, ~n~0=v_~n~0_269, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_251|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_99|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, thread1Thread1of1ForFork0_~i~0#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:55:01,736 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:55:01,737 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1743 [2022-12-06 07:55:01,737 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 111 transitions, 1594 flow [2022-12-06 07:55:01,737 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 07:55:01,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:01,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:01,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 07:55:01,738 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 07:55:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash 161593546, now seen corresponding path program 1 times [2022-12-06 07:55:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:01,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545646409] [2022-12-06 07:55:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:01,786 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 07:55:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:01,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545646409] [2022-12-06 07:55:01,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545646409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:01,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:01,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:55:01,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454442062] [2022-12-06 07:55:01,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:01,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:55:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:01,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:55:01,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:55:01,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:55:01,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 111 transitions, 1594 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:01,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:01,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:55:01,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:01,985 INFO L130 PetriNetUnfolder]: 446/866 cut-off events. [2022-12-06 07:55:01,985 INFO L131 PetriNetUnfolder]: For 8543/8543 co-relation queries the response was YES. [2022-12-06 07:55:01,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5645 conditions, 866 events. 446/866 cut-off events. For 8543/8543 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4224 event pairs, 235 based on Foata normal form. 10/876 useless extension candidates. Maximal degree in co-relation 5245. Up to 802 conditions per place. [2022-12-06 07:55:01,990 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 93 selfloop transitions, 20 changer transitions 5/118 dead transitions. [2022-12-06 07:55:01,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 118 transitions, 1860 flow [2022-12-06 07:55:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:55:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:55:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 07:55:01,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-06 07:55:01,991 INFO L175 Difference]: Start difference. First operand has 117 places, 111 transitions, 1594 flow. Second operand 5 states and 46 transitions. [2022-12-06 07:55:01,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 118 transitions, 1860 flow [2022-12-06 07:55:02,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 118 transitions, 1769 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-06 07:55:02,010 INFO L231 Difference]: Finished difference. Result has 115 places, 107 transitions, 1485 flow [2022-12-06 07:55:02,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1485, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2022-12-06 07:55:02,010 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 07:55:02,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:02,011 INFO L89 Accepts]: Start accepts. Operand has 115 places, 107 transitions, 1485 flow [2022-12-06 07:55:02,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:02,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:02,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 1485 flow [2022-12-06 07:55:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 107 transitions, 1485 flow [2022-12-06 07:55:02,037 INFO L130 PetriNetUnfolder]: 71/287 cut-off events. [2022-12-06 07:55:02,037 INFO L131 PetriNetUnfolder]: For 2641/2646 co-relation queries the response was YES. [2022-12-06 07:55:02,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 287 events. 71/287 cut-off events. For 2641/2646 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1662 event pairs, 9 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 1658. Up to 80 conditions per place. [2022-12-06 07:55:02,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 107 transitions, 1485 flow [2022-12-06 07:55:02,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 07:55:02,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:02,660 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:55:02,661 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 650 [2022-12-06 07:55:02,661 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 1483 flow [2022-12-06 07:55:02,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:02,661 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:02,661 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:02,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 07:55:02,661 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 07:55:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1382851794, now seen corresponding path program 1 times [2022-12-06 07:55:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:02,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103408743] [2022-12-06 07:55:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:02,757 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 07:55:02,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:02,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103408743] [2022-12-06 07:55:02,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103408743] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:02,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726946351] [2022-12-06 07:55:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:02,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:02,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:02,759 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 07:55:02,815 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 07:55:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:03,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:55:03,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:03,037 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 07:55:03,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:03,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 07:55:03,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726946351] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:03,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:03,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:55:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807680583] [2022-12-06 07:55:03,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:55:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:55:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:55:03,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:55:03,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 1483 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:55:03,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:03,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:55:03,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:03,319 INFO L130 PetriNetUnfolder]: 416/789 cut-off events. [2022-12-06 07:55:03,319 INFO L131 PetriNetUnfolder]: For 7600/7600 co-relation queries the response was YES. [2022-12-06 07:55:03,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5121 conditions, 789 events. 416/789 cut-off events. For 7600/7600 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3646 event pairs, 195 based on Foata normal form. 18/807 useless extension candidates. Maximal degree in co-relation 5074. Up to 661 conditions per place. [2022-12-06 07:55:03,323 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 78 selfloop transitions, 0 changer transitions 39/117 dead transitions. [2022-12-06 07:55:03,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 117 transitions, 1829 flow [2022-12-06 07:55:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:55:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:55:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 07:55:03,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27647058823529413 [2022-12-06 07:55:03,324 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 1483 flow. Second operand 5 states and 47 transitions. [2022-12-06 07:55:03,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 117 transitions, 1829 flow [2022-12-06 07:55:03,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 117 transitions, 1751 flow, removed 3 selfloop flow, removed 9 redundant places. [2022-12-06 07:55:03,340 INFO L231 Difference]: Finished difference. Result has 109 places, 78 transitions, 838 flow [2022-12-06 07:55:03,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=838, PETRI_PLACES=109, PETRI_TRANSITIONS=78} [2022-12-06 07:55:03,340 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 07:55:03,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:03,340 INFO L89 Accepts]: Start accepts. Operand has 109 places, 78 transitions, 838 flow [2022-12-06 07:55:03,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:03,341 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:03,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 78 transitions, 838 flow [2022-12-06 07:55:03,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 78 transitions, 838 flow [2022-12-06 07:55:03,360 INFO L130 PetriNetUnfolder]: 55/220 cut-off events. [2022-12-06 07:55:03,360 INFO L131 PetriNetUnfolder]: For 1493/1498 co-relation queries the response was YES. [2022-12-06 07:55:03,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 220 events. 55/220 cut-off events. For 1493/1498 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1129 event pairs, 7 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 1068. Up to 58 conditions per place. [2022-12-06 07:55:03,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 78 transitions, 838 flow [2022-12-06 07:55:03,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 07:55:03,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:55:03,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_369| v_~f~0.base_253))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_249 (* v_~x2~0_330 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_249 (* .cse1 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_249 (* .cse7 4))))) (let ((.cse0 (select .cse8 (+ (* .cse3 4) v_~f~0.offset_249)))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_249 (* .cse0 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_249 (* .cse6 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_249 (* .cse4 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_249 (* .cse2 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_253)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_253)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_253) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_253)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_218|) (not (= (ite (and (< .cse4 v_~size~0_253) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_330) (< v_~x2~0_330 v_~size~0_253)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_253)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_253) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_253) (<= 0 .cse7)) 1 0) 0)) (= (select .cse8 (+ (* 4 .cse5) v_~f~0.offset_249)) v_~x2~0_328) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_218| 4294967293) 4294967296) (mod (* 3 v_~n~0_243) 4294967296)))))))))))) InVars {~x2~0=v_~x2~0_330, ~size~0=v_~size~0_253, ~f~0.base=v_~f~0.base_253, #memory_int=|v_#memory_int_369|, ~n~0=v_~n~0_243, ~f~0.offset=v_~f~0.offset_249} OutVars{~x2~0=v_~x2~0_328, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_253, ~f~0.base=v_~f~0.base_253, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_136|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_218|, ~f~0.offset=v_~f~0.offset_249, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_128|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_126|, #memory_int=|v_#memory_int_369|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_136|, ~n~0=v_~n~0_243, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_140|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [762] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_420| v_~f~0.base_297))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_293 (* v_~x1~0_499 4))))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_297)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_252|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_348| 4294967295) 4294967296) (mod (* 3 v_~n~0_287) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_348| 2) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_268| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_252| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_268|) (not (= (ite (and (<= 0 v_~x1~0_499) (< v_~x1~0_499 v_~size~0_297)) 1 0) 0)) (= v_~x1~0_497 (select .cse1 (+ v_~f~0.offset_293 (* .cse0 4))))))) InVars {~size~0=v_~size~0_297, ~f~0.base=v_~f~0.base_297, #memory_int=|v_#memory_int_420|, ~n~0=v_~n~0_287, ~x1~0=v_~x1~0_499, ~f~0.offset=v_~f~0.offset_293} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_252|, ~size~0=v_~size~0_297, ~f~0.base=v_~f~0.base_297, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_348|, #memory_int=|v_#memory_int_420|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_268|, ~n~0=v_~n~0_287, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_270|, ~x1~0=v_~x1~0_497, ~f~0.offset=v_~f~0.offset_293} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:05,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_369| v_~f~0.base_253))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_249 (* v_~x2~0_330 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_249 (* .cse1 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_249 (* .cse7 4))))) (let ((.cse0 (select .cse8 (+ (* .cse3 4) v_~f~0.offset_249)))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_249 (* .cse0 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_249 (* .cse6 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_249 (* .cse4 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_249 (* .cse2 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_253)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_253)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_253) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_253)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_218|) (not (= (ite (and (< .cse4 v_~size~0_253) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_330) (< v_~x2~0_330 v_~size~0_253)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_253)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_253) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_253) (<= 0 .cse7)) 1 0) 0)) (= (select .cse8 (+ (* 4 .cse5) v_~f~0.offset_249)) v_~x2~0_328) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_218| 4294967293) 4294967296) (mod (* 3 v_~n~0_243) 4294967296)))))))))))) InVars {~x2~0=v_~x2~0_330, ~size~0=v_~size~0_253, ~f~0.base=v_~f~0.base_253, #memory_int=|v_#memory_int_369|, ~n~0=v_~n~0_243, ~f~0.offset=v_~f~0.offset_249} OutVars{~x2~0=v_~x2~0_328, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_164|, ~size~0=v_~size~0_253, ~f~0.base=v_~f~0.base_253, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_136|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_218|, ~f~0.offset=v_~f~0.offset_249, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_204|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_128|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_126|, #memory_int=|v_#memory_int_369|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_136|, ~n~0=v_~n~0_243, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_140|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [760] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_418| v_~f~0.base_295))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_291 (* v_~x2~0_425 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_291 (* .cse2 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_294| 4294967296) (mod (* 3 v_~n~0_285) 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_293| (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_294|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_295)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266| 0)) (not (= (ite (and (<= 0 v_~x2~0_425) (< v_~x2~0_425 v_~size~0_295)) 1 0) 0)) (= v_~x2~0_424 (select .cse1 (+ v_~f~0.offset_291 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_295)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_250| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266|) (= (ite (and (< v_~x1~0_494 v_~size~0_295) (<= 0 v_~x1~0_494)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_250|) (= |v_thread1Thread1of1ForFork0_~i~0#1_346| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263|) (= v_~x1~0_493 (select .cse1 (+ (* v_~x1~0_494 4) v_~f~0.offset_291))))))) InVars {~x2~0=v_~x2~0_425, ~size~0=v_~size~0_295, ~f~0.base=v_~f~0.base_295, #memory_int=|v_#memory_int_418|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_294|, ~n~0=v_~n~0_285, ~x1~0=v_~x1~0_494, ~f~0.offset=v_~f~0.offset_291} OutVars{~x2~0=v_~x2~0_424, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_258|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_223|, ~size~0=v_~size~0_295, ~f~0.base=v_~f~0.base_295, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_195|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_293|, ~x1~0=v_~x1~0_493, ~f~0.offset=v_~f~0.offset_291, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_263|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_250|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_187|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_346|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_185|, #memory_int=|v_#memory_int_418|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_266|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_195|, ~n~0=v_~n~0_285, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_199|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_268|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:55:06,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] L59-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_416| v_~f~0.base_293))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_289 (* v_~x2~0_420 4))))) (let ((.cse3 (mod (* 3 v_~n~0_283) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_289 (* .cse0 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_338| 1) |v_thread1Thread1of1ForFork0_~i~0#1_337|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_293)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_245| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_261|) (= (select .cse1 (+ v_~f~0.offset_289 (* .cse2 4))) v_~x2~0_419) (not (= (ite (and (< v_~x2~0_420 v_~size~0_293) (<= 0 v_~x2~0_420)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_289| 4294967296) .cse3) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_338| 4294967296) .cse3) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_289|) |v_thread2Thread1of1ForFork1_~i~1#1_288|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|) (= v_~x1~0_486 (select .cse1 (+ v_~f~0.offset_289 (* v_~x1~0_487 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_261| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228| (ite (and (< .cse2 v_~size~0_293) (<= 0 .cse2)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_245| (ite (and (<= 0 v_~x1~0_487) (< v_~x1~0_487 v_~size~0_293)) 1 0)))))) InVars {~x2~0=v_~x2~0_420, ~size~0=v_~size~0_293, ~f~0.base=v_~f~0.base_293, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_338|, #memory_int=|v_#memory_int_416|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_289|, ~n~0=v_~n~0_283, ~x1~0=v_~x1~0_487, ~f~0.offset=v_~f~0.offset_289} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_253|, ~x2~0=v_~x2~0_419, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_220|, ~size~0=v_~size~0_293, ~f~0.base=v_~f~0.base_293, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_192|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_288|, ~x1~0=v_~x1~0_486, ~f~0.offset=v_~f~0.offset_289, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_260|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_184|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_337|, #memory_int=|v_#memory_int_416|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_261|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_182|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_192|, ~n~0=v_~n~0_283, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_263|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_196|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:55:07,256 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:55:07,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3916 [2022-12-06 07:55:07,256 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 897 flow [2022-12-06 07:55:07,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:55:07,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:07,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:07,262 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 07:55:07,459 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,SelfDestructingSolverStorable31 [2022-12-06 07:55:07,459 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 07:55:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1980791574, now seen corresponding path program 1 times [2022-12-06 07:55:07,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:07,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007988138] [2022-12-06 07:55:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:07,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:07,556 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 07:55:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:07,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007988138] [2022-12-06 07:55:07,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007988138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:07,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:07,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:55:07,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842673314] [2022-12-06 07:55:07,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:07,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:55:07,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:07,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:55:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:55:07,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:55:07,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 897 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:07,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:07,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:55:07,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:07,832 INFO L130 PetriNetUnfolder]: 369/704 cut-off events. [2022-12-06 07:55:07,832 INFO L131 PetriNetUnfolder]: For 5869/5869 co-relation queries the response was YES. [2022-12-06 07:55:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 704 events. 369/704 cut-off events. For 5869/5869 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3093 event pairs, 186 based on Foata normal form. 14/716 useless extension candidates. Maximal degree in co-relation 4089. Up to 643 conditions per place. [2022-12-06 07:55:07,836 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 77 selfloop transitions, 13 changer transitions 8/98 dead transitions. [2022-12-06 07:55:07,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 1308 flow [2022-12-06 07:55:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:55:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:55:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 07:55:07,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25225225225225223 [2022-12-06 07:55:07,837 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 897 flow. Second operand 6 states and 56 transitions. [2022-12-06 07:55:07,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 1308 flow [2022-12-06 07:55:07,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 98 transitions, 1173 flow, removed 44 selfloop flow, removed 11 redundant places. [2022-12-06 07:55:07,847 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 871 flow [2022-12-06 07:55:07,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=871, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2022-12-06 07:55:07,848 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 71 predicate places. [2022-12-06 07:55:07,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:07,848 INFO L89 Accepts]: Start accepts. Operand has 92 places, 81 transitions, 871 flow [2022-12-06 07:55:07,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:07,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:07,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 81 transitions, 871 flow [2022-12-06 07:55:07,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 81 transitions, 871 flow [2022-12-06 07:55:07,869 INFO L130 PetriNetUnfolder]: 57/225 cut-off events. [2022-12-06 07:55:07,869 INFO L131 PetriNetUnfolder]: For 1427/1432 co-relation queries the response was YES. [2022-12-06 07:55:07,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 225 events. 57/225 cut-off events. For 1427/1432 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1130 event pairs, 7 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 1023. Up to 64 conditions per place. [2022-12-06 07:55:07,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 81 transitions, 871 flow [2022-12-06 07:55:07,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 07:55:08,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:55:08,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 07:55:08,047 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 878 flow [2022-12-06 07:55:08,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:08,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:08,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:08,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 07:55:08,047 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 07:55:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1760395956, now seen corresponding path program 1 times [2022-12-06 07:55:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496196383] [2022-12-06 07:55:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:08,143 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 07:55:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:08,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496196383] [2022-12-06 07:55:08,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496196383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:08,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:08,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:55:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687675248] [2022-12-06 07:55:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:08,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:55:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:55:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:55:08,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:55:08,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 878 flow. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:08,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:08,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:55:08,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:08,495 INFO L130 PetriNetUnfolder]: 350/683 cut-off events. [2022-12-06 07:55:08,495 INFO L131 PetriNetUnfolder]: For 4945/4945 co-relation queries the response was YES. [2022-12-06 07:55:08,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 683 events. 350/683 cut-off events. For 4945/4945 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3125 event pairs, 70 based on Foata normal form. 8/689 useless extension candidates. Maximal degree in co-relation 3836. Up to 349 conditions per place. [2022-12-06 07:55:08,498 INFO L137 encePairwiseOnDemand]: 18/36 looper letters, 107 selfloop transitions, 21 changer transitions 8/136 dead transitions. [2022-12-06 07:55:08,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 136 transitions, 1731 flow [2022-12-06 07:55:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:55:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:55:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-12-06 07:55:08,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21296296296296297 [2022-12-06 07:55:08,499 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 878 flow. Second operand 9 states and 69 transitions. [2022-12-06 07:55:08,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 136 transitions, 1731 flow [2022-12-06 07:55:08,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 136 transitions, 1637 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-06 07:55:08,510 INFO L231 Difference]: Finished difference. Result has 98 places, 84 transitions, 929 flow [2022-12-06 07:55:08,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=929, PETRI_PLACES=98, PETRI_TRANSITIONS=84} [2022-12-06 07:55:08,510 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 07:55:08,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:08,510 INFO L89 Accepts]: Start accepts. Operand has 98 places, 84 transitions, 929 flow [2022-12-06 07:55:08,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:08,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:08,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 84 transitions, 929 flow [2022-12-06 07:55:08,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 84 transitions, 929 flow [2022-12-06 07:55:08,532 INFO L130 PetriNetUnfolder]: 60/234 cut-off events. [2022-12-06 07:55:08,532 INFO L131 PetriNetUnfolder]: For 1742/1747 co-relation queries the response was YES. [2022-12-06 07:55:08,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 234 events. 60/234 cut-off events. For 1742/1747 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1179 event pairs, 6 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 1215. Up to 76 conditions per place. [2022-12-06 07:55:08,534 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 84 transitions, 929 flow [2022-12-06 07:55:08,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 07:55:08,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_426| v_~f~0.base_303))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_299 (* v_~x2~0_440 4))))) (let ((.cse11 (select .cse0 (+ v_~f~0.offset_299 (* .cse8 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_299 (* 4 .cse11))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_299 (* 4 .cse4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_299 (* 4 .cse3))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_299 (* .cse5 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_299 (* .cse7 4))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_299 (* .cse6 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_299 (* .cse9 4))))) (let ((.cse10 (select .cse0 (+ v_~f~0.offset_299 (* .cse2 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_299 (* .cse10 4))))) (and (= (select .cse0 (+ v_~f~0.offset_299 (* .cse1 4))) v_~x2~0_438) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_303)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_303)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_299 (* v_~x1~0_508 4))) v_~x1~0_507) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_303)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_303| 4294967293) 4294967296) (mod (* 3 v_~n~0_293) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_303)) 1 0)) (= (ite (and (<= 0 v_~x1~0_508) (< v_~x1~0_508 v_~size~0_303)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_258|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_303)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_354| 1) (not (= (ite (and (< .cse6 v_~size~0_303) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_303) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_440) (< v_~x2~0_440 v_~size~0_303)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_303| 12) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_274| 0)) (not (= (ite (and (< .cse8 v_~size~0_303) (<= 0 .cse8)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_258| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_274|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_303)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_303) (<= 0 .cse10)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_303)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_440, ~size~0=v_~size~0_303, ~f~0.base=v_~f~0.base_303, #memory_int=|v_#memory_int_426|, ~n~0=v_~n~0_293, ~x1~0=v_~x1~0_508, ~f~0.offset=v_~f~0.offset_299} OutVars{~x2~0=v_~x2~0_438, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_266|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_231|, ~size~0=v_~size~0_303, ~f~0.base=v_~f~0.base_303, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_203|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_303|, ~x1~0=v_~x1~0_507, ~f~0.offset=v_~f~0.offset_299, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_258|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_195|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_354|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_193|, #memory_int=|v_#memory_int_426|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_274|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_203|, ~n~0=v_~n~0_293, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_207|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_276|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:09,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:11,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_430| v_~f~0.base_307))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_303 (* v_~x2~0_452 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_303 (* 4 .cse1))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_303 (* 4 .cse0))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_303 (* .cse6 4))))) (let ((.cse5 (mod (* 3 v_~n~0_297) 4294967296)) (.cse4 (select .cse3 (+ v_~f~0.offset_303 (* .cse2 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_307) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_307)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_307) (<= 0 .cse2)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_303 (* .cse4 4))) v_~x2~0_450) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_311| (+ 6 |v_thread2Thread1of1ForFork1_~i~1#1_313|)) (< (mod (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_313|) 4294967296) .cse5) (not (= (ite (and (< .cse6 v_~size~0_307) (<= 0 .cse6)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_313| 4294967296) .cse5) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_307)) 1 0)) (not (= 0 (ite (and (< v_~x2~0_452 v_~size~0_307) (<= 0 v_~x2~0_452)) 1 0)))))))))) InVars {~x2~0=v_~x2~0_452, ~size~0=v_~size~0_307, ~f~0.base=v_~f~0.base_307, #memory_int=|v_#memory_int_430|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_313|, ~n~0=v_~n~0_297, ~f~0.offset=v_~f~0.offset_303} OutVars{~x2~0=v_~x2~0_450, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_239|, ~size~0=v_~size~0_307, ~f~0.base=v_~f~0.base_307, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_211|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_247|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_311|, ~f~0.offset=v_~f~0.offset_303, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_203|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_201|, #memory_int=|v_#memory_int_430|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_211|, ~n~0=v_~n~0_297, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_215|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:55:12,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse11 (select |v_#memory_int_442| v_~f~0.base_319))) (let ((.cse7 (select .cse11 (+ v_~f~0.offset_315 (* v_~x2~0_477 4))))) (let ((.cse5 (select .cse11 (+ v_~f~0.offset_315 (* .cse7 4))))) (let ((.cse3 (select .cse11 (+ v_~f~0.offset_315 (* 4 .cse5))))) (let ((.cse4 (select .cse11 (+ (* .cse3 4) v_~f~0.offset_315)))) (let ((.cse9 (select .cse11 (+ v_~f~0.offset_315 (* .cse4 4))))) (let ((.cse2 (select .cse11 (+ v_~f~0.offset_315 (* 4 .cse9))))) (let ((.cse0 (select .cse11 (+ v_~f~0.offset_315 (* .cse2 4))))) (let ((.cse6 (select .cse11 (+ v_~f~0.offset_315 (* .cse0 4))))) (let ((.cse1 (select .cse11 (+ v_~f~0.offset_315 (* .cse6 4))))) (let ((.cse12 (select .cse11 (+ v_~f~0.offset_315 (* .cse1 4))))) (let ((.cse10 (select .cse11 (+ v_~f~0.offset_315 (* .cse12 4)))) (.cse8 (mod (* 3 v_~n~0_309) 4294967296))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_319)) 1 0) 0)) (= (ite (and (<= 0 v_~x1~0_526) (< v_~x1~0_526 v_~size~0_319)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_295| 0)) (not (= (ite (and (< .cse1 v_~size~0_319) (<= 0 .cse1)) 1 0) 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_67|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_67| 0) (not (= 0 (ite (and (< .cse2 v_~size~0_319) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< .cse3 v_~size~0_319) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_284|) (not (= (ite (and (< .cse4 v_~size~0_319) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_295|) (not (= (ite (and (< v_~x2~0_477 v_~size~0_319) (<= 0 v_~x2~0_477)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_319) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_319) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_319)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_337| 12) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_337| 4294967293) 4294967296) .cse8) (not (= (ite (and (< .cse9 v_~size~0_319) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263| (ite (and (< .cse10 v_~size~0_319) (<= 0 .cse10)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_284| 0)) (= v_~x1~0_525 (select .cse11 (+ v_~f~0.offset_315 (* v_~x1~0_526 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_368| 1) (= v_~x2~0_476 (select .cse11 (+ v_~f~0.offset_315 (* .cse10 4)))) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_337| 4294967296) .cse8)) (not (= (ite (and (< .cse12 v_~size~0_319) (<= 0 .cse12)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_477, ~size~0=v_~size~0_319, ~f~0.base=v_~f~0.base_319, #memory_int=|v_#memory_int_442|, ~n~0=v_~n~0_309, ~x1~0=v_~x1~0_526, ~f~0.offset=v_~f~0.offset_315} OutVars{~x2~0=v_~x2~0_476, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_276|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_255|, ~size~0=v_~size~0_319, ~f~0.base=v_~f~0.base_319, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_67|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_227|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_263|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_337|, ~x1~0=v_~x1~0_525, ~f~0.offset=v_~f~0.offset_315, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_295|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_268|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_67|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_219|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_368|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_217|, #memory_int=|v_#memory_int_442|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_284|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_227|, ~n~0=v_~n~0_309, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_231|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_286|} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:13,193 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:55:13,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4683 [2022-12-06 07:55:13,193 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 967 flow [2022-12-06 07:55:13,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:13,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:13,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:13,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 07:55:13,194 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 07:55:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash -121155449, now seen corresponding path program 1 times [2022-12-06 07:55:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:13,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415418725] [2022-12-06 07:55:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:13,322 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 07:55:13,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:13,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415418725] [2022-12-06 07:55:13,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415418725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:13,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688227143] [2022-12-06 07:55:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:13,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:13,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:13,325 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 07:55:13,327 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 07:55:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:13,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:55:13,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:13,543 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 07:55:13,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:13,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688227143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:13,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:13,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 07:55:13,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535298728] [2022-12-06 07:55:13,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:13,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:55:13,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:13,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:55:13,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 07:55:13,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:55:13,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 967 flow. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:13,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:13,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:55:13,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:15,301 INFO L130 PetriNetUnfolder]: 386/723 cut-off events. [2022-12-06 07:55:15,302 INFO L131 PetriNetUnfolder]: For 7170/7170 co-relation queries the response was YES. [2022-12-06 07:55:15,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4816 conditions, 723 events. 386/723 cut-off events. For 7170/7170 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3128 event pairs, 66 based on Foata normal form. 30/745 useless extension candidates. Maximal degree in co-relation 4650. Up to 488 conditions per place. [2022-12-06 07:55:15,305 INFO L137 encePairwiseOnDemand]: 15/37 looper letters, 62 selfloop transitions, 24 changer transitions 61/147 dead transitions. [2022-12-06 07:55:15,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 147 transitions, 2055 flow [2022-12-06 07:55:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:55:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:55:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2022-12-06 07:55:15,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15789473684210525 [2022-12-06 07:55:15,313 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 967 flow. Second operand 19 states and 111 transitions. [2022-12-06 07:55:15,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 147 transitions, 2055 flow [2022-12-06 07:55:15,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 147 transitions, 1943 flow, removed 39 selfloop flow, removed 5 redundant places. [2022-12-06 07:55:15,325 INFO L231 Difference]: Finished difference. Result has 115 places, 74 transitions, 897 flow [2022-12-06 07:55:15,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=897, PETRI_PLACES=115, PETRI_TRANSITIONS=74} [2022-12-06 07:55:15,325 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 07:55:15,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:15,325 INFO L89 Accepts]: Start accepts. Operand has 115 places, 74 transitions, 897 flow [2022-12-06 07:55:15,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:15,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:15,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 74 transitions, 897 flow [2022-12-06 07:55:15,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 74 transitions, 897 flow [2022-12-06 07:55:15,379 INFO L130 PetriNetUnfolder]: 55/198 cut-off events. [2022-12-06 07:55:15,379 INFO L131 PetriNetUnfolder]: For 3178/3201 co-relation queries the response was YES. [2022-12-06 07:55:15,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 198 events. 55/198 cut-off events. For 3178/3201 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 879 event pairs, 4 based on Foata normal form. 2/196 useless extension candidates. Maximal degree in co-relation 1225. Up to 76 conditions per place. [2022-12-06 07:55:15,381 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 74 transitions, 897 flow [2022-12-06 07:55:15,381 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 07:55:15,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:17,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:17,564 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:55:17,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2239 [2022-12-06 07:55:17,564 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 72 transitions, 903 flow [2022-12-06 07:55:17,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:17,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:17,565 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:17,570 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 07:55:17,765 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,SelfDestructingSolverStorable34 [2022-12-06 07:55:17,765 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 07:55:17,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1887829318, now seen corresponding path program 1 times [2022-12-06 07:55:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:17,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830211063] [2022-12-06 07:55:17,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:18,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:18,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830211063] [2022-12-06 07:55:18,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830211063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:18,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949880739] [2022-12-06 07:55:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:18,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:18,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:18,243 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 07:55:18,244 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 07:55:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:18,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 07:55:18,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:18,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:55:18,374 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 07:55:18,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:18,437 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-06 07:55:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:18,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:18,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:18,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-06 07:55:18,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:55:18,601 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 07:55:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:19,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949880739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:19,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:19,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:55:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738106946] [2022-12-06 07:55:19,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:19,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:55:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:55:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:55:19,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:55:19,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 72 transitions, 903 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 07:55:19,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:19,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:55:19,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:20,460 INFO L130 PetriNetUnfolder]: 541/1008 cut-off events. [2022-12-06 07:55:20,460 INFO L131 PetriNetUnfolder]: For 20123/20123 co-relation queries the response was YES. [2022-12-06 07:55:20,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8422 conditions, 1008 events. 541/1008 cut-off events. For 20123/20123 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4745 event pairs, 81 based on Foata normal form. 3/1011 useless extension candidates. Maximal degree in co-relation 7110. Up to 598 conditions per place. [2022-12-06 07:55:20,465 INFO L137 encePairwiseOnDemand]: 10/28 looper letters, 101 selfloop transitions, 54 changer transitions 8/163 dead transitions. [2022-12-06 07:55:20,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 163 transitions, 2523 flow [2022-12-06 07:55:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:55:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:55:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 106 transitions. [2022-12-06 07:55:20,466 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2523809523809524 [2022-12-06 07:55:20,466 INFO L175 Difference]: Start difference. First operand has 95 places, 72 transitions, 903 flow. Second operand 15 states and 106 transitions. [2022-12-06 07:55:20,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 163 transitions, 2523 flow [2022-12-06 07:55:20,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 163 transitions, 2035 flow, removed 174 selfloop flow, removed 17 redundant places. [2022-12-06 07:55:20,490 INFO L231 Difference]: Finished difference. Result has 98 places, 110 transitions, 1503 flow [2022-12-06 07:55:20,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1503, PETRI_PLACES=98, PETRI_TRANSITIONS=110} [2022-12-06 07:55:20,491 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 07:55:20,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:20,491 INFO L89 Accepts]: Start accepts. Operand has 98 places, 110 transitions, 1503 flow [2022-12-06 07:55:20,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:20,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:20,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 110 transitions, 1503 flow [2022-12-06 07:55:20,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 110 transitions, 1503 flow [2022-12-06 07:55:20,520 INFO L130 PetriNetUnfolder]: 94/338 cut-off events. [2022-12-06 07:55:20,520 INFO L131 PetriNetUnfolder]: For 2694/2711 co-relation queries the response was YES. [2022-12-06 07:55:20,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 338 events. 94/338 cut-off events. For 2694/2711 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1892 event pairs, 8 based on Foata normal form. 3/334 useless extension candidates. Maximal degree in co-relation 1937. Up to 138 conditions per place. [2022-12-06 07:55:20,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 110 transitions, 1503 flow [2022-12-06 07:55:20,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 07:55:20,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [788] $Ultimate##0-->L59-2: Formula: (let ((.cse14 (select |v_#memory_int_453| v_~f~0.base_329))) (let ((.cse4 (select .cse14 (+ v_~f~0.offset_325 (* v_~x2~0_499 4))))) (let ((.cse5 (select .cse14 (+ v_~f~0.offset_325 (* .cse4 4))))) (let ((.cse0 (select .cse14 (+ v_~f~0.offset_325 (* 4 .cse5))))) (let ((.cse11 (select .cse14 (+ v_~f~0.offset_325 (* .cse0 4))))) (let ((.cse10 (select .cse14 (+ (* .cse11 4) v_~f~0.offset_325)))) (let ((.cse2 (select .cse14 (+ v_~f~0.offset_325 (* .cse10 4))))) (let ((.cse16 (select .cse14 (+ v_~f~0.offset_325 (* .cse2 4))))) (let ((.cse9 (select .cse14 (+ v_~f~0.offset_325 (* .cse16 4))))) (let ((.cse6 (select .cse14 (+ v_~f~0.offset_325 (* .cse9 4))))) (let ((.cse1 (select .cse14 (+ v_~f~0.offset_325 (* .cse6 4))))) (let ((.cse17 (select .cse14 (+ v_~f~0.offset_325 (* .cse1 4))))) (let ((.cse3 (select .cse14 (+ v_~f~0.offset_325 (* .cse17 4))))) (let ((.cse7 (select .cse14 (+ v_~f~0.offset_325 (* .cse3 4))))) (let ((.cse15 (select .cse14 (+ (* .cse7 4) v_~f~0.offset_325)))) (let ((.cse13 (select .cse14 (+ v_~f~0.offset_325 (* .cse15 4))))) (let ((.cse12 (select .cse14 (+ v_~f~0.offset_325 (* .cse13 4))))) (let ((.cse8 (select .cse14 (+ (* .cse12 4) v_~f~0.offset_325)))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_329)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_329) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_329) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_329)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_329) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_329)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_329)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_329)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_356| 18) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_329)) 1 0)) (not (= (ite (and (< .cse9 v_~size~0_329) (<= 0 .cse9)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_282| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_356| 4294967293) 4294967296) (mod (* 3 v_~n~0_319) 4294967296)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_329)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_329) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_329) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_282| (ite (and (< v_~x1~0_550 v_~size~0_329) (<= 0 v_~x1~0_550)) 1 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_329)) 1 0) 0)) (= (select .cse14 (+ v_~f~0.offset_325 (* v_~x1~0_550 4))) v_~x1~0_549) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_329)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309| 0)) (not (= 0 (ite (and (< .cse16 v_~size~0_329) (<= 0 .cse16)) 1 0))) (= (select .cse14 (+ v_~f~0.offset_325 (* .cse8 4))) v_~x2~0_497) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|) (not (= (ite (and (< v_~x2~0_499 v_~size~0_329) (<= 0 v_~x2~0_499)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_387| 1) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_329)) 1 0) 0))))))))))))))))))))) InVars {~x2~0=v_~x2~0_499, ~size~0=v_~size~0_329, ~f~0.base=v_~f~0.base_329, #memory_int=|v_#memory_int_453|, ~n~0=v_~n~0_319, ~x1~0=v_~x1~0_550, ~f~0.offset=v_~f~0.offset_325} OutVars{~x2~0=v_~x2~0_497, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_290|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_269|, ~size~0=v_~size~0_329, ~f~0.base=v_~f~0.base_329, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_241|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_356|, ~x1~0=v_~x1~0_549, ~f~0.offset=v_~f~0.offset_325, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_282|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_233|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_387|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_231|, #memory_int=|v_#memory_int_453|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_298|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_241|, ~n~0=v_~n~0_319, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_300|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:24,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] $Ultimate##0-->L59-2: Formula: (let ((.cse11 (select |v_#memory_int_424| v_~f~0.base_301))) (let ((.cse2 (select .cse11 (+ v_~f~0.offset_297 (* v_~x2~0_434 4))))) (let ((.cse0 (select .cse11 (+ v_~f~0.offset_297 (* .cse2 4))))) (let ((.cse9 (select .cse11 (+ v_~f~0.offset_297 (* .cse0 4))))) (let ((.cse6 (select .cse11 (+ v_~f~0.offset_297 (* .cse9 4))))) (let ((.cse1 (select .cse11 (+ v_~f~0.offset_297 (* .cse6 4))))) (let ((.cse3 (select .cse11 (+ v_~f~0.offset_297 (* .cse1 4))))) (let ((.cse8 (select .cse11 (+ v_~f~0.offset_297 (* 4 .cse3))))) (let ((.cse5 (select .cse11 (+ v_~f~0.offset_297 (* .cse8 4))))) (let ((.cse4 (select .cse11 (+ v_~f~0.offset_297 (* .cse5 4))))) (let ((.cse10 (select .cse11 (+ v_~f~0.offset_297 (* 4 .cse4))))) (let ((.cse7 (select .cse11 (+ v_~f~0.offset_297 (* .cse10 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_301) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_301)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_434 v_~size~0_301) (<= 0 v_~x2~0_434)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_301)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_301)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|) (< 9 (mod (* 3 v_~n~0_291) 4294967296)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_299| 12) (not (= (ite (and (< .cse6 v_~size~0_301) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_301)) 1 0)) (not (= (ite (and (< .cse8 v_~size~0_301) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_301) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_301) (<= 0 .cse10)) 1 0) 0)) (= v_~x2~0_432 (select .cse11 (+ v_~f~0.offset_297 (* .cse7 4))))))))))))))))) InVars {~x2~0=v_~x2~0_434, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, #memory_int=|v_#memory_int_424|, ~n~0=v_~n~0_291, ~f~0.offset=v_~f~0.offset_297} OutVars{~x2~0=v_~x2~0_432, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_227|, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_199|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_299|, ~f~0.offset=v_~f~0.offset_297, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_191|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_189|, #memory_int=|v_#memory_int_424|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_199|, ~n~0=v_~n~0_291, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_203|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:26,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_145| v_~f~0.base_103))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_103 (* v_~x2~0_157 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (= (select .cse0 (+ v_~f~0.offset_103 (* 4 .cse1))) v_~x2~0_156) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_109)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_73|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (not (= (ite (and (<= 0 v_~x2~0_157) (< v_~x2~0_157 v_~size~0_109)) 1 0) 0)) (< (mod (+ 4294967293 |v_thread2Thread1of1ForFork1_~i~1#1_99|) 4294967296) (mod (* v_~n~0_90 3) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_109)) 1 0))))))) InVars {~x2~0=v_~x2~0_157, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, #memory_int=|v_#memory_int_145|, ~n~0=v_~n~0_90, ~f~0.offset=v_~f~0.offset_103} OutVars{~x2~0=v_~x2~0_156, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_103, 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_73|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~f~0.offset=v_~f~0.offset_103, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_105|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_90, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:27,192 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:55:27,193 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6702 [2022-12-06 07:55:27,193 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 110 transitions, 1533 flow [2022-12-06 07:55:27,193 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 07:55:27,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:27,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:27,200 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 07:55:27,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:27,394 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 07:55:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:27,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1352230938, now seen corresponding path program 1 times [2022-12-06 07:55:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:27,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39479113] [2022-12-06 07:55:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:27,460 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 07:55:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:27,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39479113] [2022-12-06 07:55:27,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39479113] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:27,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656256432] [2022-12-06 07:55:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:27,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:27,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:27,462 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 07:55:27,464 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 07:55:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:27,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:55:27,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:27,894 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 07:55:27,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:27,911 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 07:55:27,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656256432] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:27,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:27,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 07:55:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562210615] [2022-12-06 07:55:27,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:27,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:55:27,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:55:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:55:27,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:55:27,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 110 transitions, 1533 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 07:55:27,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:27,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:55:27,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:28,439 INFO L130 PetriNetUnfolder]: 546/1039 cut-off events. [2022-12-06 07:55:28,439 INFO L131 PetriNetUnfolder]: For 10827/10827 co-relation queries the response was YES. [2022-12-06 07:55:28,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7477 conditions, 1039 events. 546/1039 cut-off events. For 10827/10827 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5041 event pairs, 106 based on Foata normal form. 26/1065 useless extension candidates. Maximal degree in co-relation 6869. Up to 720 conditions per place. [2022-12-06 07:55:28,443 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 71 selfloop transitions, 35 changer transitions 33/139 dead transitions. [2022-12-06 07:55:28,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 2227 flow [2022-12-06 07:55:28,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:55:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:55:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-12-06 07:55:28,444 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20261437908496732 [2022-12-06 07:55:28,444 INFO L175 Difference]: Start difference. First operand has 98 places, 110 transitions, 1533 flow. Second operand 9 states and 62 transitions. [2022-12-06 07:55:28,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 2227 flow [2022-12-06 07:55:28,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 139 transitions, 1826 flow, removed 189 selfloop flow, removed 7 redundant places. [2022-12-06 07:55:28,461 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 1074 flow [2022-12-06 07:55:28,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1074, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2022-12-06 07:55:28,461 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 81 predicate places. [2022-12-06 07:55:28,461 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:28,461 INFO L89 Accepts]: Start accepts. Operand has 102 places, 93 transitions, 1074 flow [2022-12-06 07:55:28,462 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:28,462 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:28,462 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 93 transitions, 1074 flow [2022-12-06 07:55:28,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 93 transitions, 1074 flow [2022-12-06 07:55:28,487 INFO L130 PetriNetUnfolder]: 77/301 cut-off events. [2022-12-06 07:55:28,487 INFO L131 PetriNetUnfolder]: For 2391/2397 co-relation queries the response was YES. [2022-12-06 07:55:28,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703 conditions, 301 events. 77/301 cut-off events. For 2391/2397 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1675 event pairs, 10 based on Foata normal form. 2/296 useless extension candidates. Maximal degree in co-relation 1550. Up to 79 conditions per place. [2022-12-06 07:55:28,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 93 transitions, 1074 flow [2022-12-06 07:55:28,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 07:55:29,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [797] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_469| v_~f~0.base_343))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_339 (* v_~x2~0_529 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_339 (* .cse2 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_339 (* 4 .cse4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_339 (* .cse5 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_339 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327| 0)) (= (select .cse0 (+ v_~f~0.offset_339 (* .cse1 4))) v_~x2~0_527) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_343)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_295| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_343)) 1 0)) (not (= 0 (ite (and (< .cse3 v_~size~0_343) (<= 0 .cse3)) 1 0))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_376|) (< 3 (mod (* 3 v_~n~0_333) 4294967296)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_343)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_295| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_343)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_529) (< v_~x2~0_529 v_~size~0_343)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_529, ~size~0=v_~size~0_343, ~f~0.base=v_~f~0.base_343, #memory_int=|v_#memory_int_469|, ~n~0=v_~n~0_333, ~f~0.offset=v_~f~0.offset_339} OutVars{~x2~0=v_~x2~0_527, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_287|, ~size~0=v_~size~0_343, ~f~0.base=v_~f~0.base_343, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_259|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_295|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_376|, ~f~0.offset=v_~f~0.offset_339, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_251|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_249|, #memory_int=|v_#memory_int_469|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_259|, ~n~0=v_~n~0_333, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_263|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:29,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_467| v_~f~0.base_341))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_337 (* v_~x2~0_524 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_337 (* 4 .cse2))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_407| (+ |v_thread1Thread1of1ForFork0_~i~0#1_408| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_325|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_408| 4294967296) (mod (* 3 v_~n~0_331) 4294967296)) (= v_~x1~0_579 (select .cse0 (+ v_~f~0.offset_337 (* v_~x1~0_580 4)))) (= v_~x2~0_523 (select .cse0 (+ v_~f~0.offset_337 (* .cse1 4)))) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_341)) 1 0))) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_374|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293| (ite (and (< .cse1 v_~size~0_341) (<= 0 .cse1)) 1 0)) (not (= (ite (and (<= 0 v_~x2~0_524) (< v_~x2~0_524 v_~size~0_341)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_325| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| (ite (and (<= 0 v_~x1~0_580) (< v_~x1~0_580 v_~size~0_341)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_316|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_316| 0)))))) InVars {~x2~0=v_~x2~0_524, ~size~0=v_~size~0_341, ~f~0.base=v_~f~0.base_341, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_408|, #memory_int=|v_#memory_int_467|, ~n~0=v_~n~0_331, ~x1~0=v_~x1~0_580, ~f~0.offset=v_~f~0.offset_337} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_308|, ~x2~0=v_~x2~0_523, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_285|, ~size~0=v_~size~0_341, ~f~0.base=v_~f~0.base_341, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_257|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_293|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_374|, ~x1~0=v_~x1~0_579, ~f~0.offset=v_~f~0.offset_337, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_325|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_300|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_249|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_407|, #memory_int=|v_#memory_int_467|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_316|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_247|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_257|, ~n~0=v_~n~0_331, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_318|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_261|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:55:30,123 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:55:30,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1662 [2022-12-06 07:55:30,123 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 1116 flow [2022-12-06 07:55:30,123 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 07:55:30,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:30,124 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:30,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-06 07:55:30,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 07:55:30,324 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 07:55:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2087161762, now seen corresponding path program 1 times [2022-12-06 07:55:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:30,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038018589] [2022-12-06 07:55:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:30,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 07:55:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038018589] [2022-12-06 07:55:30,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038018589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244868240] [2022-12-06 07:55:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:30,387 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 07:55:30,389 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 07:55:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:30,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:55:30,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:30,541 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 07:55:30,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:30,583 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 07:55:30,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244868240] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:30,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:30,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:55:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457509178] [2022-12-06 07:55:30,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:30,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:55:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:30,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:55:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:55:30,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:55:30,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 1116 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:30,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:30,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:55:30,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:30,898 INFO L130 PetriNetUnfolder]: 495/944 cut-off events. [2022-12-06 07:55:30,898 INFO L131 PetriNetUnfolder]: For 8692/8692 co-relation queries the response was YES. [2022-12-06 07:55:30,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6155 conditions, 944 events. 495/944 cut-off events. For 8692/8692 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4431 event pairs, 133 based on Foata normal form. 16/960 useless extension candidates. Maximal degree in co-relation 5665. Up to 766 conditions per place. [2022-12-06 07:55:30,907 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 76 selfloop transitions, 27 changer transitions 19/122 dead transitions. [2022-12-06 07:55:30,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 122 transitions, 1707 flow [2022-12-06 07:55:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:55:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:55:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-12-06 07:55:30,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24242424242424243 [2022-12-06 07:55:30,908 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 1116 flow. Second operand 7 states and 56 transitions. [2022-12-06 07:55:30,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 122 transitions, 1707 flow [2022-12-06 07:55:30,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 122 transitions, 1484 flow, removed 28 selfloop flow, removed 12 redundant places. [2022-12-06 07:55:30,923 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 960 flow [2022-12-06 07:55:30,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=960, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2022-12-06 07:55:30,924 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2022-12-06 07:55:30,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:30,924 INFO L89 Accepts]: Start accepts. Operand has 90 places, 90 transitions, 960 flow [2022-12-06 07:55:30,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:30,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:30,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 90 transitions, 960 flow [2022-12-06 07:55:30,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 960 flow [2022-12-06 07:55:30,949 INFO L130 PetriNetUnfolder]: 73/280 cut-off events. [2022-12-06 07:55:30,949 INFO L131 PetriNetUnfolder]: For 1586/1592 co-relation queries the response was YES. [2022-12-06 07:55:30,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 280 events. 73/280 cut-off events. For 1586/1592 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1482 event pairs, 10 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 1403. Up to 81 conditions per place. [2022-12-06 07:55:30,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 90 transitions, 960 flow [2022-12-06 07:55:30,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 308 [2022-12-06 07:55:30,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:55:30,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 07:55:30,953 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 960 flow [2022-12-06 07:55:30,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:30,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:30,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:30,959 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 07:55:31,159 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,SelfDestructingSolverStorable37 [2022-12-06 07:55:31,159 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 07:55:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1818186257, now seen corresponding path program 1 times [2022-12-06 07:55:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:31,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839372882] [2022-12-06 07:55:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:31,264 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 07:55:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839372882] [2022-12-06 07:55:31,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839372882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:31,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:31,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:55:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472984731] [2022-12-06 07:55:31,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:31,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:55:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:55:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:55:31,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:55:31,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 960 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 07:55:31,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:31,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:55:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:31,495 INFO L130 PetriNetUnfolder]: 483/968 cut-off events. [2022-12-06 07:55:31,495 INFO L131 PetriNetUnfolder]: For 6210/6210 co-relation queries the response was YES. [2022-12-06 07:55:31,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 968 events. 483/968 cut-off events. For 6210/6210 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5040 event pairs, 85 based on Foata normal form. 4/972 useless extension candidates. Maximal degree in co-relation 5560. Up to 416 conditions per place. [2022-12-06 07:55:31,499 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 115 selfloop transitions, 41 changer transitions 4/160 dead transitions. [2022-12-06 07:55:31,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 160 transitions, 2008 flow [2022-12-06 07:55:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:55:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:55:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-12-06 07:55:31,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24603174603174602 [2022-12-06 07:55:31,500 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 960 flow. Second operand 9 states and 62 transitions. [2022-12-06 07:55:31,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 160 transitions, 2008 flow [2022-12-06 07:55:31,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 160 transitions, 1924 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-06 07:55:31,511 INFO L231 Difference]: Finished difference. Result has 92 places, 102 transitions, 1183 flow [2022-12-06 07:55:31,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=92, PETRI_TRANSITIONS=102} [2022-12-06 07:55:31,511 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 71 predicate places. [2022-12-06 07:55:31,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:31,512 INFO L89 Accepts]: Start accepts. Operand has 92 places, 102 transitions, 1183 flow [2022-12-06 07:55:31,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:31,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:31,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 102 transitions, 1183 flow [2022-12-06 07:55:31,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 102 transitions, 1183 flow [2022-12-06 07:55:31,537 INFO L130 PetriNetUnfolder]: 75/326 cut-off events. [2022-12-06 07:55:31,537 INFO L131 PetriNetUnfolder]: For 1829/1835 co-relation queries the response was YES. [2022-12-06 07:55:31,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 326 events. 75/326 cut-off events. For 1829/1835 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1951 event pairs, 9 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 1467. Up to 92 conditions per place. [2022-12-06 07:55:31,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 102 transitions, 1183 flow [2022-12-06 07:55:31,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-06 07:55:31,544 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:31,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:31,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:31,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:31,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:31,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:33,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_479| v_~f~0.base_353))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_349 (* v_~x2~0_555 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_349 (* v_~x1~0_599 4)))) (.cse0 (mod (* 3 v_~n~0_343) 4294967296)) (.cse4 (select .cse3 (+ v_~f~0.offset_349 (* 4 .cse2))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_312| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_326| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_428| 4294967296) .cse0) (not (= (ite (and (< v_~x2~0_555 v_~size~0_353) (<= 0 v_~x2~0_555)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_353)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_310|) (not (= 0 (ite (and (< .cse2 v_~size~0_353) (<= 0 .cse2)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_310| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_326|) (not (= (ite (and (< v_~x1~0_599 v_~size~0_353) (<= 0 v_~x1~0_599)) 1 0) 0)) (= v_~x1~0_597 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_349))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_428| 1) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_312| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_353)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_426| (+ |v_thread1Thread1of1ForFork0_~i~0#1_428| 2)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_393|) (= (select .cse3 (+ v_~f~0.offset_349 (* 4 .cse4))) v_~x2~0_554))))) InVars {~x2~0=v_~x2~0_555, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_353, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_428|, #memory_int=|v_#memory_int_479|, ~n~0=v_~n~0_343, ~x1~0=v_~x1~0_599, ~f~0.offset=v_~f~0.offset_349} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_318|, ~x2~0=v_~x2~0_554, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_304|, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_353, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_276|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_312|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_393|, ~x1~0=v_~x1~0_597, ~f~0.offset=v_~f~0.offset_349, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_344|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_310|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_268|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_426|, #memory_int=|v_#memory_int_479|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_326|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_266|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_276|, ~n~0=v_~n~0_343, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_328|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_280|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:55:33,493 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:55:33,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1982 [2022-12-06 07:55:33,493 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 100 transitions, 1232 flow [2022-12-06 07:55:33,493 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 07:55:33,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:33,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:33,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 07:55:33,494 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 07:55:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash -414123811, now seen corresponding path program 1 times [2022-12-06 07:55:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:33,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452341053] [2022-12-06 07:55:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:33,540 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 07:55:33,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:33,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452341053] [2022-12-06 07:55:33,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452341053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:55:33,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:55:33,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:55:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069277687] [2022-12-06 07:55:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:55:33,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:55:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:33,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:55:33,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:55:33,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:55:33,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 100 transitions, 1232 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 07:55:33,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:33,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:55:33,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:33,728 INFO L130 PetriNetUnfolder]: 474/944 cut-off events. [2022-12-06 07:55:33,728 INFO L131 PetriNetUnfolder]: For 5940/5940 co-relation queries the response was YES. [2022-12-06 07:55:33,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5709 conditions, 944 events. 474/944 cut-off events. For 5940/5940 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4753 event pairs, 254 based on Foata normal form. 4/948 useless extension candidates. Maximal degree in co-relation 5019. Up to 868 conditions per place. [2022-12-06 07:55:33,732 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 74 selfloop transitions, 30 changer transitions 5/109 dead transitions. [2022-12-06 07:55:33,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 1530 flow [2022-12-06 07:55:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:55:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:55:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 07:55:33,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28823529411764703 [2022-12-06 07:55:33,733 INFO L175 Difference]: Start difference. First operand has 90 places, 100 transitions, 1232 flow. Second operand 5 states and 49 transitions. [2022-12-06 07:55:33,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 1530 flow [2022-12-06 07:55:33,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 1428 flow, removed 41 selfloop flow, removed 3 redundant places. [2022-12-06 07:55:33,746 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 1173 flow [2022-12-06 07:55:33,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1173, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2022-12-06 07:55:33,746 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 71 predicate places. [2022-12-06 07:55:33,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:33,747 INFO L89 Accepts]: Start accepts. Operand has 92 places, 98 transitions, 1173 flow [2022-12-06 07:55:33,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:33,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:33,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 98 transitions, 1173 flow [2022-12-06 07:55:33,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 98 transitions, 1173 flow [2022-12-06 07:55:33,772 INFO L130 PetriNetUnfolder]: 74/316 cut-off events. [2022-12-06 07:55:33,772 INFO L131 PetriNetUnfolder]: For 1681/1687 co-relation queries the response was YES. [2022-12-06 07:55:33,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 316 events. 74/316 cut-off events. For 1681/1687 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1886 event pairs, 9 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 1406. Up to 89 conditions per place. [2022-12-06 07:55:33,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 98 transitions, 1173 flow [2022-12-06 07:55:33,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 07:55:33,775 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:55:33,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 07:55:33,775 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 98 transitions, 1173 flow [2022-12-06 07:55:33,776 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 07:55:33,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:33,776 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:33,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 07:55:33,776 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 07:55:33,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash -903387197, now seen corresponding path program 1 times [2022-12-06 07:55:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:33,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754180736] [2022-12-06 07:55:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:33,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:33,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754180736] [2022-12-06 07:55:33,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754180736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:33,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935924120] [2022-12-06 07:55:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:33,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:33,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:33,855 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 07:55:33,855 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 07:55:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:34,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:55:34,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:34,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:34,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935924120] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:34,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:34,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:55:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707108727] [2022-12-06 07:55:34,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:34,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:55:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:34,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:55:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:55:34,130 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:55:34,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 98 transitions, 1173 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:55:34,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:34,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:55:34,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:34,338 INFO L130 PetriNetUnfolder]: 447/883 cut-off events. [2022-12-06 07:55:34,338 INFO L131 PetriNetUnfolder]: For 4815/4815 co-relation queries the response was YES. [2022-12-06 07:55:34,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5176 conditions, 883 events. 447/883 cut-off events. For 4815/4815 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4284 event pairs, 233 based on Foata normal form. 18/901 useless extension candidates. Maximal degree in co-relation 4663. Up to 810 conditions per place. [2022-12-06 07:55:34,341 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 87 selfloop transitions, 0 changer transitions 23/110 dead transitions. [2022-12-06 07:55:34,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 110 transitions, 1508 flow [2022-12-06 07:55:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:55:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:55:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 07:55:34,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-06 07:55:34,342 INFO L175 Difference]: Start difference. First operand has 90 places, 98 transitions, 1173 flow. Second operand 5 states and 44 transitions. [2022-12-06 07:55:34,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 110 transitions, 1508 flow [2022-12-06 07:55:34,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 110 transitions, 1446 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-06 07:55:34,351 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 939 flow [2022-12-06 07:55:34,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=939, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2022-12-06 07:55:34,352 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 69 predicate places. [2022-12-06 07:55:34,352 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:34,352 INFO L89 Accepts]: Start accepts. Operand has 90 places, 87 transitions, 939 flow [2022-12-06 07:55:34,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:34,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:34,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 87 transitions, 939 flow [2022-12-06 07:55:34,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 87 transitions, 939 flow [2022-12-06 07:55:34,382 INFO L130 PetriNetUnfolder]: 64/270 cut-off events. [2022-12-06 07:55:34,382 INFO L131 PetriNetUnfolder]: For 1228/1234 co-relation queries the response was YES. [2022-12-06 07:55:34,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 270 events. 64/270 cut-off events. For 1228/1234 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1513 event pairs, 6 based on Foata normal form. 2/265 useless extension candidates. Maximal degree in co-relation 1039. Up to 77 conditions per place. [2022-12-06 07:55:34,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 87 transitions, 939 flow [2022-12-06 07:55:34,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 07:55:34,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [799] $Ultimate##0-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_471| v_~f~0.base_345))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_341 (* v_~x2~0_536 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_341 (* .cse8 4))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_341 (* .cse3 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_341 (* .cse7 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_341 (* 4 .cse1))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_341 (* .cse0 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_341 (* 4 .cse6))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_341 (* 4 .cse2))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_345)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_345)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_381| 4294967293) 4294967296) (mod (* 3 v_~n~0_335) 4294967296)) (not (= (ite (and (< .cse2 v_~size~0_345) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_345)) 1 0) 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_381|) (= v_~x2~0_534 (select .cse4 (+ (* 4 .cse5) v_~f~0.offset_341))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332| 0)) (not (= (ite (and (< v_~x2~0_536 v_~size~0_345) (<= 0 v_~x2~0_536)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_345)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_345)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300| (ite (and (< .cse5 v_~size~0_345) (<= 0 .cse5)) 1 0)) (not (= (ite (and (< .cse8 v_~size~0_345) (<= 0 .cse8)) 1 0) 0)))))))))))) InVars {~x2~0=v_~x2~0_536, ~size~0=v_~size~0_345, ~f~0.base=v_~f~0.base_345, #memory_int=|v_#memory_int_471|, ~n~0=v_~n~0_335, ~f~0.offset=v_~f~0.offset_341} OutVars{~x2~0=v_~x2~0_534, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_292|, ~size~0=v_~size~0_345, ~f~0.base=v_~f~0.base_345, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_264|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_381|, ~f~0.offset=v_~f~0.offset_341, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_256|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_254|, #memory_int=|v_#memory_int_471|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_264|, ~n~0=v_~n~0_335, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_268|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:34,895 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:55:34,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 552 [2022-12-06 07:55:34,904 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 947 flow [2022-12-06 07:55:34,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:55:34,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:34,904 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:34,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 07:55:35,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:35,109 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 07:55:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -855423506, now seen corresponding path program 1 times [2022-12-06 07:55:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:35,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26099158] [2022-12-06 07:55:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:35,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:35,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26099158] [2022-12-06 07:55:35,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26099158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:35,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236675465] [2022-12-06 07:55:35,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:35,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:35,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:35,207 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 07:55:35,209 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 07:55:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:35,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 07:55:35,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:35,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:55:35,334 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 07:55:35,337 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 07:55:35,366 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 07:55:36,676 INFO L321 Elim1Store]: treesize reduction 793, result has 5.7 percent of original size [2022-12-06 07:55:36,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 29 new quantified variables, introduced 105 case distinctions, treesize of input 151 treesize of output 136 [2022-12-06 07:55:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:36,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:39,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236675465] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:39,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:39,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:55:39,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483954950] [2022-12-06 07:55:39,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:39,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:55:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:39,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:55:39,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=250, Unknown=2, NotChecked=0, Total=306 [2022-12-06 07:55:39,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:55:39,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 947 flow. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:39,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:39,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:55:39,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:45,302 INFO L130 PetriNetUnfolder]: 662/1302 cut-off events. [2022-12-06 07:55:45,302 INFO L131 PetriNetUnfolder]: For 7377/7377 co-relation queries the response was YES. [2022-12-06 07:55:45,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 1302 events. 662/1302 cut-off events. For 7377/7377 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7114 event pairs, 218 based on Foata normal form. 46/1348 useless extension candidates. Maximal degree in co-relation 6481. Up to 858 conditions per place. [2022-12-06 07:55:45,308 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 117 selfloop transitions, 32 changer transitions 74/223 dead transitions. [2022-12-06 07:55:45,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 223 transitions, 2784 flow [2022-12-06 07:55:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 07:55:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 07:55:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 163 transitions. [2022-12-06 07:55:45,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18735632183908046 [2022-12-06 07:55:45,309 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 947 flow. Second operand 29 states and 163 transitions. [2022-12-06 07:55:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 223 transitions, 2784 flow [2022-12-06 07:55:45,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 223 transitions, 2625 flow, removed 35 selfloop flow, removed 4 redundant places. [2022-12-06 07:55:45,326 INFO L231 Difference]: Finished difference. Result has 127 places, 113 transitions, 1412 flow [2022-12-06 07:55:45,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1412, PETRI_PLACES=127, PETRI_TRANSITIONS=113} [2022-12-06 07:55:45,326 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 106 predicate places. [2022-12-06 07:55:45,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:45,326 INFO L89 Accepts]: Start accepts. Operand has 127 places, 113 transitions, 1412 flow [2022-12-06 07:55:45,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:45,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:45,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 113 transitions, 1412 flow [2022-12-06 07:55:45,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 113 transitions, 1412 flow [2022-12-06 07:55:45,361 INFO L130 PetriNetUnfolder]: 88/369 cut-off events. [2022-12-06 07:55:45,361 INFO L131 PetriNetUnfolder]: For 3951/3958 co-relation queries the response was YES. [2022-12-06 07:55:45,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 369 events. 88/369 cut-off events. For 3951/3958 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2283 event pairs, 10 based on Foata normal form. 3/362 useless extension candidates. Maximal degree in co-relation 2047. Up to 120 conditions per place. [2022-12-06 07:55:45,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 113 transitions, 1412 flow [2022-12-06 07:55:45,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 07:55:45,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:53,110 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:55:53,111 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7785 [2022-12-06 07:55:53,111 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 1427 flow [2022-12-06 07:55:53,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:55:53,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:53,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:53,119 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 07:55:53,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:53,312 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 07:55:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash -428668659, now seen corresponding path program 1 times [2022-12-06 07:55:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:53,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424590683] [2022-12-06 07:55:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:53,419 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 07:55:53,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:53,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424590683] [2022-12-06 07:55:53,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424590683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:53,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942488739] [2022-12-06 07:55:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:53,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:53,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:53,432 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 07:55:53,463 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 07:55:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:53,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:55:53,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:53,672 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 07:55:53,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:55:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:53,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942488739] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:55:53,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:55:53,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 07:55:53,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342668133] [2022-12-06 07:55:53,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:55:53,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 07:55:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:55:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 07:55:53,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-12-06 07:55:53,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:55:53,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 1427 flow. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 07:55:53,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:55:53,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:55:53,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:55:54,484 INFO L130 PetriNetUnfolder]: 661/1372 cut-off events. [2022-12-06 07:55:54,485 INFO L131 PetriNetUnfolder]: For 15414/15414 co-relation queries the response was YES. [2022-12-06 07:55:54,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8739 conditions, 1372 events. 661/1372 cut-off events. For 15414/15414 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8011 event pairs, 137 based on Foata normal form. 36/1406 useless extension candidates. Maximal degree in co-relation 7903. Up to 724 conditions per place. [2022-12-06 07:55:54,491 INFO L137 encePairwiseOnDemand]: 15/33 looper letters, 87 selfloop transitions, 80 changer transitions 49/216 dead transitions. [2022-12-06 07:55:54,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 216 transitions, 3096 flow [2022-12-06 07:55:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:55:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:55:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 107 transitions. [2022-12-06 07:55:54,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17065390749601275 [2022-12-06 07:55:54,492 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 1427 flow. Second operand 19 states and 107 transitions. [2022-12-06 07:55:54,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 216 transitions, 3096 flow [2022-12-06 07:55:54,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 216 transitions, 2709 flow, removed 189 selfloop flow, removed 15 redundant places. [2022-12-06 07:55:54,515 INFO L231 Difference]: Finished difference. Result has 118 places, 142 transitions, 1811 flow [2022-12-06 07:55:54,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1811, PETRI_PLACES=118, PETRI_TRANSITIONS=142} [2022-12-06 07:55:54,516 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 97 predicate places. [2022-12-06 07:55:54,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:55:54,516 INFO L89 Accepts]: Start accepts. Operand has 118 places, 142 transitions, 1811 flow [2022-12-06 07:55:54,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:55:54,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:55:54,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 142 transitions, 1811 flow [2022-12-06 07:55:54,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 142 transitions, 1811 flow [2022-12-06 07:55:54,557 INFO L130 PetriNetUnfolder]: 111/476 cut-off events. [2022-12-06 07:55:54,557 INFO L131 PetriNetUnfolder]: For 3619/3626 co-relation queries the response was YES. [2022-12-06 07:55:54,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2588 conditions, 476 events. 111/476 cut-off events. For 3619/3626 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3229 event pairs, 8 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 2355. Up to 106 conditions per place. [2022-12-06 07:55:54,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 142 transitions, 1811 flow [2022-12-06 07:55:54,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 07:55:54,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:54,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:54,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:54,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:54,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,180 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,420 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:55,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,135 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,415 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [638] L59-2-->thread2EXIT: Formula: (and (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_9| 4294967296) (mod (* 3 v_~n~0_In_8) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_9|, ~n~0=v_~n~0_In_8, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:55:56,706 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:55:56,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2191 [2022-12-06 07:55:56,707 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 141 transitions, 2085 flow [2022-12-06 07:55:56,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 07:55:56,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:55:56,707 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:55:56,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 07:55:56,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:56,908 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 07:55:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:55:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 526664052, now seen corresponding path program 1 times [2022-12-06 07:55:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:55:56,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843898882] [2022-12-06 07:55:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:55:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:55:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:55:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843898882] [2022-12-06 07:55:56,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843898882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:55:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881849401] [2022-12-06 07:55:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:55:57,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:55:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:55:57,004 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 07:55:57,006 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 07:55:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:55:57,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 07:55:57,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:55:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:55:57,153 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 07:55:57,155 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 07:55:57,176 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 07:56:01,073 INFO L321 Elim1Store]: treesize reduction 1602, result has 4.7 percent of original size [2022-12-06 07:56:01,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 41 new quantified variables, introduced 210 case distinctions, treesize of input 353 treesize of output 209 [2022-12-06 07:56:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:01,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:56:08,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881849401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:08,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:08,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:56:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143410722] [2022-12-06 07:56:08,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:08,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:56:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:56:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=250, Unknown=2, NotChecked=0, Total=306 [2022-12-06 07:56:08,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:56:08,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 141 transitions, 2085 flow. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:08,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:08,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:56:08,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:19,986 INFO L130 PetriNetUnfolder]: 672/1420 cut-off events. [2022-12-06 07:56:19,986 INFO L131 PetriNetUnfolder]: For 12755/12755 co-relation queries the response was YES. [2022-12-06 07:56:19,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9608 conditions, 1420 events. 672/1420 cut-off events. For 12755/12755 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8555 event pairs, 101 based on Foata normal form. 38/1458 useless extension candidates. Maximal degree in co-relation 8982. Up to 965 conditions per place. [2022-12-06 07:56:19,993 INFO L137 encePairwiseOnDemand]: 30/50 looper letters, 148 selfloop transitions, 46 changer transitions 67/261 dead transitions. [2022-12-06 07:56:19,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 261 transitions, 4069 flow [2022-12-06 07:56:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 07:56:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 07:56:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 166 transitions. [2022-12-06 07:56:19,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1276923076923077 [2022-12-06 07:56:19,995 INFO L175 Difference]: Start difference. First operand has 106 places, 141 transitions, 2085 flow. Second operand 26 states and 166 transitions. [2022-12-06 07:56:19,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 261 transitions, 4069 flow [2022-12-06 07:56:20,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 261 transitions, 3599 flow, removed 227 selfloop flow, removed 9 redundant places. [2022-12-06 07:56:20,024 INFO L231 Difference]: Finished difference. Result has 133 places, 156 transitions, 2294 flow [2022-12-06 07:56:20,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2294, PETRI_PLACES=133, PETRI_TRANSITIONS=156} [2022-12-06 07:56:20,024 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 112 predicate places. [2022-12-06 07:56:20,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:20,025 INFO L89 Accepts]: Start accepts. Operand has 133 places, 156 transitions, 2294 flow [2022-12-06 07:56:20,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:20,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:20,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 156 transitions, 2294 flow [2022-12-06 07:56:20,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 156 transitions, 2294 flow [2022-12-06 07:56:20,074 INFO L130 PetriNetUnfolder]: 120/512 cut-off events. [2022-12-06 07:56:20,075 INFO L131 PetriNetUnfolder]: For 4987/5001 co-relation queries the response was YES. [2022-12-06 07:56:20,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3059 conditions, 512 events. 120/512 cut-off events. For 4987/5001 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3597 event pairs, 9 based on Foata normal form. 4/512 useless extension candidates. Maximal degree in co-relation 2963. Up to 94 conditions per place. [2022-12-06 07:56:20,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 156 transitions, 2294 flow [2022-12-06 07:56:20,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 07:56:20,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:56:34,979 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:56:34,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14955 [2022-12-06 07:56:34,980 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 155 transitions, 2313 flow [2022-12-06 07:56:34,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:34,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:34,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:34,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 07:56:35,187 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,SelfDestructingSolverStorable43 [2022-12-06 07:56:35,192 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 07:56:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1501617783, now seen corresponding path program 1 times [2022-12-06 07:56:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959431805] [2022-12-06 07:56:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:35,263 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 07:56:35,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:35,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959431805] [2022-12-06 07:56:35,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959431805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:35,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196740796] [2022-12-06 07:56:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:35,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:35,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:35,266 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:35,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 07:56:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:35,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:56:35,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:35,458 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 07:56:35,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:35,485 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 07:56:35,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196740796] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:35,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:35,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:56:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363666753] [2022-12-06 07:56:35,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:35,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:56:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:56:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:56:35,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 07:56:35,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 155 transitions, 2313 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:56:35,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:35,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 07:56:35,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:56:35,923 INFO L130 PetriNetUnfolder]: 610/1280 cut-off events. [2022-12-06 07:56:35,923 INFO L131 PetriNetUnfolder]: For 12890/12890 co-relation queries the response was YES. [2022-12-06 07:56:35,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8485 conditions, 1280 events. 610/1280 cut-off events. For 12890/12890 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7361 event pairs, 309 based on Foata normal form. 16/1294 useless extension candidates. Maximal degree in co-relation 8031. Up to 1202 conditions per place. [2022-12-06 07:56:35,929 INFO L137 encePairwiseOnDemand]: 48/53 looper letters, 141 selfloop transitions, 0 changer transitions 27/168 dead transitions. [2022-12-06 07:56:35,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 168 transitions, 2808 flow [2022-12-06 07:56:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:56:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:56:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 07:56:35,931 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24528301886792453 [2022-12-06 07:56:35,931 INFO L175 Difference]: Start difference. First operand has 116 places, 155 transitions, 2313 flow. Second operand 5 states and 65 transitions. [2022-12-06 07:56:35,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 168 transitions, 2808 flow [2022-12-06 07:56:35,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 168 transitions, 2670 flow, removed 65 selfloop flow, removed 11 redundant places. [2022-12-06 07:56:35,957 INFO L231 Difference]: Finished difference. Result has 112 places, 141 transitions, 2008 flow [2022-12-06 07:56:35,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2008, PETRI_PLACES=112, PETRI_TRANSITIONS=141} [2022-12-06 07:56:35,958 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-06 07:56:35,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:56:35,958 INFO L89 Accepts]: Start accepts. Operand has 112 places, 141 transitions, 2008 flow [2022-12-06 07:56:35,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:56:35,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:56:35,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 141 transitions, 2008 flow [2022-12-06 07:56:35,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 141 transitions, 2008 flow [2022-12-06 07:56:35,997 INFO L130 PetriNetUnfolder]: 111/475 cut-off events. [2022-12-06 07:56:35,997 INFO L131 PetriNetUnfolder]: For 3139/3153 co-relation queries the response was YES. [2022-12-06 07:56:35,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 475 events. 111/475 cut-off events. For 3139/3153 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3250 event pairs, 8 based on Foata normal form. 4/475 useless extension candidates. Maximal degree in co-relation 2592. Up to 85 conditions per place. [2022-12-06 07:56:36,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 141 transitions, 2008 flow [2022-12-06 07:56:36,001 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 07:56:36,001 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:56:36,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 07:56:36,001 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 141 transitions, 2008 flow [2022-12-06 07:56:36,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:56:36,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:56:36,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:56:36,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 07:56:36,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-06 07:56:36,207 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 07:56:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:56:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash -982693316, now seen corresponding path program 1 times [2022-12-06 07:56:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:56:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089395943] [2022-12-06 07:56:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:56:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:36,303 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 07:56:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:56:36,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089395943] [2022-12-06 07:56:36,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089395943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:56:36,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531308841] [2022-12-06 07:56:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:56:36,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:56:36,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:56:36,316 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:56:36,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 07:56:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:56:36,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 07:56:36,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:56:36,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:56:36,485 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 07:56:36,487 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 07:56:36,533 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 07:56:44,352 INFO L321 Elim1Store]: treesize reduction 2712, result has 3.5 percent of original size [2022-12-06 07:56:44,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 27 select indices, 27 select index equivalence classes, 0 disjoint index pairs (out of 351 index pairs), introduced 53 new quantified variables, introduced 351 case distinctions, treesize of input 418 treesize of output 254 [2022-12-06 07:56:44,520 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 07:56:44,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:56:58,825 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 07:56:58,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531308841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:56:58,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:56:58,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:56:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738914201] [2022-12-06 07:56:58,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:56:58,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:56:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:56:58,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:56:58,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=249, Unknown=2, NotChecked=0, Total=306 [2022-12-06 07:56:58,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:56:58,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 141 transitions, 2008 flow. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:56:58,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:56:58,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:56:58,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:57:22,810 INFO L130 PetriNetUnfolder]: 706/1510 cut-off events. [2022-12-06 07:57:22,811 INFO L131 PetriNetUnfolder]: For 11224/11224 co-relation queries the response was YES. [2022-12-06 07:57:22,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9792 conditions, 1510 events. 706/1510 cut-off events. For 11224/11224 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9416 event pairs, 109 based on Foata normal form. 34/1544 useless extension candidates. Maximal degree in co-relation 8820. Up to 979 conditions per place. [2022-12-06 07:57:22,819 INFO L137 encePairwiseOnDemand]: 29/50 looper letters, 163 selfloop transitions, 56 changer transitions 47/266 dead transitions. [2022-12-06 07:57:22,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 266 transitions, 3892 flow [2022-12-06 07:57:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 07:57:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 07:57:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 166 transitions. [2022-12-06 07:57:22,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1509090909090909 [2022-12-06 07:57:22,821 INFO L175 Difference]: Start difference. First operand has 107 places, 141 transitions, 2008 flow. Second operand 22 states and 166 transitions. [2022-12-06 07:57:22,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 266 transitions, 3892 flow [2022-12-06 07:57:22,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 266 transitions, 3675 flow, removed 83 selfloop flow, removed 8 redundant places. [2022-12-06 07:57:22,847 INFO L231 Difference]: Finished difference. Result has 130 places, 166 transitions, 2481 flow [2022-12-06 07:57:22,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2481, PETRI_PLACES=130, PETRI_TRANSITIONS=166} [2022-12-06 07:57:22,848 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2022-12-06 07:57:22,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:57:22,848 INFO L89 Accepts]: Start accepts. Operand has 130 places, 166 transitions, 2481 flow [2022-12-06 07:57:22,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:57:22,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:57:22,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 166 transitions, 2481 flow [2022-12-06 07:57:22,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 166 transitions, 2481 flow [2022-12-06 07:57:22,905 INFO L130 PetriNetUnfolder]: 129/569 cut-off events. [2022-12-06 07:57:22,905 INFO L131 PetriNetUnfolder]: For 5644/5658 co-relation queries the response was YES. [2022-12-06 07:57:22,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 569 events. 129/569 cut-off events. For 5644/5658 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4205 event pairs, 13 based on Foata normal form. 4/569 useless extension candidates. Maximal degree in co-relation 2955. Up to 107 conditions per place. [2022-12-06 07:57:22,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 166 transitions, 2481 flow [2022-12-06 07:57:22,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 07:57:22,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:57:23,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:57:53,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [862] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_581| v_~f~0.base_447))) (let ((.cse10 (select .cse7 (+ v_~f~0.offset_443 (* v_~x2~0_652 4))))) (let ((.cse17 (select .cse7 (+ v_~f~0.offset_443 (* .cse10 4))))) (let ((.cse18 (select .cse7 (+ v_~f~0.offset_443 (* .cse17 4))))) (let ((.cse23 (select .cse7 (+ v_~f~0.offset_443 (* .cse18 4))))) (let ((.cse1 (select .cse7 (+ v_~f~0.offset_443 (* .cse23 4))))) (let ((.cse12 (select .cse7 (+ v_~f~0.offset_443 (* .cse1 4))))) (let ((.cse24 (select .cse7 (+ v_~f~0.offset_443 (* .cse12 4))))) (let ((.cse26 (select .cse7 (+ v_~f~0.offset_443 (* .cse24 4))))) (let ((.cse19 (select .cse7 (+ v_~f~0.offset_443 (* .cse26 4))))) (let ((.cse14 (select .cse7 (+ v_~f~0.offset_443 (* .cse19 4))))) (let ((.cse4 (select .cse7 (+ (* .cse14 4) v_~f~0.offset_443)))) (let ((.cse22 (select .cse7 (+ v_~f~0.offset_443 (* .cse4 4))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_443 (* .cse22 4))))) (let ((.cse16 (select .cse7 (+ v_~f~0.offset_443 (* .cse0 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_443 (* .cse16 4))))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_443 (* 4 .cse5))))) (let ((.cse20 (select .cse7 (+ v_~f~0.offset_443 (* .cse9 4))))) (let ((.cse13 (select .cse7 (+ v_~f~0.offset_443 (* 4 .cse20))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_443 (* .cse13 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_443 (* .cse2 4))))) (let ((.cse15 (select .cse7 (+ v_~f~0.offset_443 (* .cse3 4))))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_443 (* .cse15 4))))) (let ((.cse11 (select .cse7 (+ v_~f~0.offset_443 (* 4 .cse6))))) (let ((.cse25 (select .cse7 (+ v_~f~0.offset_443 (* 4 .cse11))))) (let ((.cse21 (select .cse7 (+ v_~f~0.offset_443 (* .cse25 4))))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_443 (* .cse21 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_447) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_652) (< v_~x2~0_652 v_~size~0_447)) 1 0) 0)) (not (= 0 (ite (and (< .cse2 v_~size~0_447) (<= 0 .cse2)) 1 0))) (not (= (ite (and (< .cse3 v_~size~0_447) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_447)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_529| 4294967293) 4294967296) (mod (* 3 v_~n~0_437) 4294967296)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_447)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|) (= (select .cse7 (+ v_~f~0.offset_443 (* .cse8 4))) v_~x2~0_650) (not (= (ite (and (< .cse9 v_~size~0_447) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_447)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| (ite (and (< .cse8 v_~size~0_447) (<= 0 .cse8)) 1 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_447) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_447)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_447)) 1 0))) (not (= (ite (and (< .cse17 v_~size~0_447) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_447)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408| 0)) (not (= (ite (and (< .cse19 v_~size~0_447) (<= 0 .cse19)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_447) (<= 0 .cse20)) 1 0) 0)) (not (= (ite (and (< .cse21 v_~size~0_447) (<= 0 .cse21)) 1 0) 0)) (not (= (ite (and (< .cse22 v_~size~0_447) (<= 0 .cse22)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_529| 27) (not (= (ite (and (<= 0 .cse23) (< .cse23 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_447)) 1 0) 0)) (not (= (ite (and (< .cse26 v_~size~0_447) (<= 0 .cse26)) 1 0) 0)))))))))))))))))))))))))))))) InVars {~x2~0=v_~x2~0_652, ~size~0=v_~size~0_447, ~f~0.base=v_~f~0.base_447, #memory_int=|v_#memory_int_581|, ~n~0=v_~n~0_437, ~f~0.offset=v_~f~0.offset_443} OutVars{~x2~0=v_~x2~0_650, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_368|, ~size~0=v_~size~0_447, ~f~0.base=v_~f~0.base_447, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_340|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_529|, ~f~0.offset=v_~f~0.offset_443, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_332|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_330|, #memory_int=|v_#memory_int_581|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_340|, ~n~0=v_~n~0_437, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_344|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:57:57,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [876] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_602| v_~f~0.base_465))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_461 (* v_~x2~0_702 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_461 (* 4 .cse1))))) (let ((.cse26 (select .cse4 (+ v_~f~0.offset_461 (* .cse3 4))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_461 (* .cse26 4))))) (let ((.cse23 (select .cse4 (+ (* .cse7 4) v_~f~0.offset_461)))) (let ((.cse18 (select .cse4 (+ (* .cse23 4) v_~f~0.offset_461)))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_461 (* .cse18 4))))) (let ((.cse20 (select .cse4 (+ v_~f~0.offset_461 (* .cse11 4))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_461 (* 4 .cse20))))) (let ((.cse25 (select .cse4 (+ v_~f~0.offset_461 (* .cse14 4))))) (let ((.cse24 (select .cse4 (+ v_~f~0.offset_461 (* .cse25 4))))) (let ((.cse19 (select .cse4 (+ v_~f~0.offset_461 (* .cse24 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_461 (* .cse19 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_461 (* 4 .cse2))))) (let ((.cse15 (select .cse4 (+ v_~f~0.offset_461 (* .cse10 4))))) (let ((.cse13 (select .cse4 (+ v_~f~0.offset_461 (* .cse15 4))))) (let ((.cse21 (select .cse4 (+ v_~f~0.offset_461 (* .cse13 4))))) (let ((.cse17 (select .cse4 (+ v_~f~0.offset_461 (* .cse21 4))))) (let ((.cse12 (select .cse4 (+ v_~f~0.offset_461 (* .cse17 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_461 (* .cse12 4))))) (let ((.cse16 (select .cse4 (+ v_~f~0.offset_461 (* .cse6 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_461 (* .cse16 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_461 (* .cse8 4))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_461 (* .cse0 4))))) (let ((.cse22 (select .cse4 (+ v_~f~0.offset_461 (* .cse9 4))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_461 (* 4 .cse22))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_465) (<= 0 .cse1)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_441| 0)) (not (= (ite (and (< .cse2 v_~size~0_465) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_465) (<= 0 .cse3)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_461 (* .cse5 4))) v_~x2~0_701) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_465) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_465)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_616| 1) (not (= (ite (and (< .cse9 v_~size~0_465) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_465)) 1 0) 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_465)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409|) (not (= (ite (and (< v_~x2~0_702 v_~size~0_465) (<= 0 v_~x2~0_702)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_465) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_465)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_446| 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_465)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_570| 27) (= (select .cse4 (+ v_~f~0.offset_461 (* v_~x1~0_818 4))) v_~x1~0_817) (not (= (ite (and (< .cse15 v_~size~0_465) (<= 0 .cse15)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_430| (ite (and (< v_~x1~0_818 v_~size~0_465) (<= 0 v_~x1~0_818)) 1 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_465)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_441|) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_465)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_570| 4294967293) 4294967296) (mod (* 3 v_~n~0_455) 4294967296)) (not (= (ite (and (<= 0 .cse19) (< .cse19 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (<= 0 .cse20) (< .cse20 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (<= 0 .cse21) (< .cse21 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (<= 0 .cse23) (< .cse23 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (< .cse24 v_~size~0_465) (<= 0 .cse24)) 1 0) 0)) (not (= (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_465)) 1 0) 0)) (not (= (ite (and (<= 0 .cse26) (< .cse26 v_~size~0_465)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_430| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_446|))))))))))))))))))))))))))))) InVars {~x2~0=v_~x2~0_702, ~size~0=v_~size~0_465, ~f~0.base=v_~f~0.base_465, #memory_int=|v_#memory_int_602|, ~n~0=v_~n~0_455, ~x1~0=v_~x1~0_818, ~f~0.offset=v_~f~0.offset_461} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_438|, ~x2~0=v_~x2~0_701, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_401|, ~size~0=v_~size~0_465, ~f~0.base=v_~f~0.base_465, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_373|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_409|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_570|, ~x1~0=v_~x1~0_817, ~f~0.offset=v_~f~0.offset_461, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_441|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_430|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_365|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_616|, #memory_int=|v_#memory_int_602|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_446|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_363|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_373|, ~n~0=v_~n~0_455, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_448|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_377|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#1, thread2Thread1of1ForFork1_#t~post6#1] and [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 07:58:03,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [878] $Ultimate##0-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_604| v_~f~0.base_467))) (let ((.cse28 (select .cse7 (+ v_~f~0.offset_463 (* v_~x2~0_707 4))))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_463 (* .cse28 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_463 (* .cse9 4))))) (let ((.cse27 (select .cse7 (+ v_~f~0.offset_463 (* .cse3 4))))) (let ((.cse29 (select .cse7 (+ v_~f~0.offset_463 (* .cse27 4))))) (let ((.cse23 (select .cse7 (+ v_~f~0.offset_463 (* .cse29 4))))) (let ((.cse14 (select .cse7 (+ v_~f~0.offset_463 (* .cse23 4))))) (let ((.cse25 (select .cse7 (+ v_~f~0.offset_463 (* .cse14 4))))) (let ((.cse18 (select .cse7 (+ v_~f~0.offset_463 (* .cse25 4))))) (let ((.cse16 (select .cse7 (+ v_~f~0.offset_463 (* .cse18 4))))) (let ((.cse24 (select .cse7 (+ (* .cse16 4) v_~f~0.offset_463)))) (let ((.cse12 (select .cse7 (+ v_~f~0.offset_463 (* .cse24 4))))) (let ((.cse17 (select .cse7 (+ v_~f~0.offset_463 (* .cse12 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_463 (* 4 .cse17))))) (let ((.cse26 (select .cse7 (+ v_~f~0.offset_463 (* .cse5 4))))) (let ((.cse21 (select .cse7 (+ v_~f~0.offset_463 (* .cse26 4))))) (let ((.cse15 (select .cse7 (+ v_~f~0.offset_463 (* .cse21 4))))) (let ((.cse10 (select .cse7 (+ v_~f~0.offset_463 (* .cse15 4))))) (let ((.cse13 (select .cse7 (+ v_~f~0.offset_463 (* 4 .cse10))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_463 (* .cse13 4))))) (let ((.cse0 (select .cse7 (+ v_~f~0.offset_463 (* .cse2 4))))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_463 (* .cse0 4))))) (let ((.cse4 (select .cse7 (+ v_~f~0.offset_463 (* .cse8 4))))) (let ((.cse19 (select .cse7 (+ v_~f~0.offset_463 (* 4 .cse4))))) (let ((.cse1 (select .cse7 (+ v_~f~0.offset_463 (* .cse19 4))))) (let ((.cse20 (select .cse7 (+ v_~f~0.offset_463 (* .cse1 4))))) (let ((.cse6 (select .cse7 (+ v_~f~0.offset_463 (* .cse20 4))))) (let ((.cse11 (select .cse7 (+ v_~f~0.offset_463 (* .cse6 4))))) (let ((.cse22 (select .cse7 (+ v_~f~0.offset_463 (* .cse11 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_467) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_467) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_467) (<= 0 .cse5)) 1 0) 0)) (= 30 |v_thread2Thread1of1ForFork1_~i~1#1_572|) (not (= 0 (ite (and (< .cse6 v_~size~0_467) (<= 0 .cse6)) 1 0))) (= v_~x1~0_821 (select .cse7 (+ v_~f~0.offset_463 (* v_~x1~0_822 4)))) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_467) (<= 0 .cse10)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_618| 1) (= (ite (and (< v_~x1~0_822 v_~size~0_467) (<= 0 v_~x1~0_822)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_432|) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_467)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_432| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448|) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_467) (<= 0 .cse16)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_572| 4294967293) 4294967296) (mod (* 3 v_~n~0_457) 4294967296)) (not (= (ite (and (< .cse17 v_~size~0_467) (<= 0 .cse17)) 1 0) 0)) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_467)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_411| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|) (not (= (ite (and (< .cse19 v_~size~0_467) (<= 0 .cse19)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_467) (<= 0 .cse20)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_707) (< v_~x2~0_707 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (< .cse21 v_~size~0_467) (<= 0 .cse21)) 1 0) 0)) (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_467)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_411|) (not (= (ite (and (< .cse23 v_~size~0_467) (<= 0 .cse23)) 1 0) 0)) (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (<= 0 .cse25) (< .cse25 v_~size~0_467)) 1 0) 0)) (not (= (ite (and (<= 0 .cse26) (< .cse26 v_~size~0_467)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443| 0)) (= (select .cse7 (+ v_~f~0.offset_463 (* .cse22 4))) v_~x2~0_705) (not (= (ite (and (< .cse27 v_~size~0_467) (<= 0 .cse27)) 1 0) 0)) (not (= (ite (and (< .cse28 v_~size~0_467) (<= 0 .cse28)) 1 0) 0)) (not (= (ite (and (< .cse29 v_~size~0_467) (<= 0 .cse29)) 1 0) 0))))))))))))))))))))))))))))))))) InVars {~x2~0=v_~x2~0_707, ~size~0=v_~size~0_467, ~f~0.base=v_~f~0.base_467, #memory_int=|v_#memory_int_604|, ~n~0=v_~n~0_457, ~x1~0=v_~x1~0_822, ~f~0.offset=v_~f~0.offset_463} OutVars{~x2~0=v_~x2~0_705, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_440|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_403|, ~size~0=v_~size~0_467, ~f~0.base=v_~f~0.base_467, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_375|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_411|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_572|, ~x1~0=v_~x1~0_821, ~f~0.offset=v_~f~0.offset_463, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_443|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_432|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_367|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_618|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_365|, #memory_int=|v_#memory_int_604|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_448|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_375|, ~n~0=v_~n~0_457, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_379|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_450|} 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, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [630] L49-2-->L49-2: Formula: (and (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 3 v_~n~0_In_4) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (= v_~x1~0_Out_16 (select (select |v_#memory_int_In_23| v_~f~0.base_In_9) (+ v_~f~0.offset_In_9 (* v_~x1~0_In_5 4)))) (= (ite (and (<= 0 v_~x1~0_In_5) (< v_~x1~0_In_5 v_~size~0_In_12)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_10| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 1))) InVars {~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, #memory_int=|v_#memory_int_In_23|, ~n~0=v_~n~0_In_4, ~x1~0=v_~x1~0_In_5, ~f~0.offset=v_~f~0.offset_In_9} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_12, ~f~0.base=v_~f~0.base_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_23|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_4, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~x1~0=v_~x1~0_Out_16, ~f~0.offset=v_~f~0.offset_In_9} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 07:58:20,972 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:58:20,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58125 [2022-12-06 07:58:20,973 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 165 transitions, 2555 flow [2022-12-06 07:58:20,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:58:20,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:20,973 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:20,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:21,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:21,179 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 07:58:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1966139162, now seen corresponding path program 1 times [2022-12-06 07:58:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:21,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394643708] [2022-12-06 07:58:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:21,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:21,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394643708] [2022-12-06 07:58:21,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394643708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:21,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852090846] [2022-12-06 07:58:21,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:21,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:21,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:21,288 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:21,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 07:58:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:21,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:58:21,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:21,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:58:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:21,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852090846] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:58:21,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:58:21,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 07:58:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405029112] [2022-12-06 07:58:21,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:58:21,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:58:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:58:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:58:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:58:21,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 07:58:21,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 165 transitions, 2555 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:58:21,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:58:21,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 07:58:21,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:58:21,992 INFO L130 PetriNetUnfolder]: 632/1334 cut-off events. [2022-12-06 07:58:21,992 INFO L131 PetriNetUnfolder]: For 13480/13480 co-relation queries the response was YES. [2022-12-06 07:58:21,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8964 conditions, 1334 events. 632/1334 cut-off events. For 13480/13480 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7662 event pairs, 311 based on Foata normal form. 32/1362 useless extension candidates. Maximal degree in co-relation 8229. Up to 1208 conditions per place. [2022-12-06 07:58:21,999 INFO L137 encePairwiseOnDemand]: 49/58 looper letters, 141 selfloop transitions, 0 changer transitions 39/180 dead transitions. [2022-12-06 07:58:21,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 180 transitions, 3115 flow [2022-12-06 07:58:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:58:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:58:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-06 07:58:22,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2413793103448276 [2022-12-06 07:58:22,000 INFO L175 Difference]: Start difference. First operand has 121 places, 165 transitions, 2555 flow. Second operand 5 states and 70 transitions. [2022-12-06 07:58:22,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 180 transitions, 3115 flow [2022-12-06 07:58:22,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 180 transitions, 2855 flow, removed 121 selfloop flow, removed 8 redundant places. [2022-12-06 07:58:22,028 INFO L231 Difference]: Finished difference. Result has 120 places, 141 transitions, 2034 flow [2022-12-06 07:58:22,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=2328, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2034, PETRI_PLACES=120, PETRI_TRANSITIONS=141} [2022-12-06 07:58:22,028 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2022-12-06 07:58:22,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:58:22,028 INFO L89 Accepts]: Start accepts. Operand has 120 places, 141 transitions, 2034 flow [2022-12-06 07:58:22,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:58:22,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:58:22,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 141 transitions, 2034 flow [2022-12-06 07:58:22,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 141 transitions, 2034 flow [2022-12-06 07:58:22,070 INFO L130 PetriNetUnfolder]: 111/475 cut-off events. [2022-12-06 07:58:22,071 INFO L131 PetriNetUnfolder]: For 3148/3162 co-relation queries the response was YES. [2022-12-06 07:58:22,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 475 events. 111/475 cut-off events. For 3148/3162 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3215 event pairs, 8 based on Foata normal form. 4/475 useless extension candidates. Maximal degree in co-relation 2606. Up to 85 conditions per place. [2022-12-06 07:58:22,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 141 transitions, 2034 flow [2022-12-06 07:58:22,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 07:58:22,075 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:58:22,075 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 07:58:22,075 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 141 transitions, 2034 flow [2022-12-06 07:58:22,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 07:58:22,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:58:22,075 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:58:22,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-06 07:58:22,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:22,281 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 07:58:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:58:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2139258715, now seen corresponding path program 1 times [2022-12-06 07:58:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:58:22,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978044980] [2022-12-06 07:58:22,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:58:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:58:22,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978044980] [2022-12-06 07:58:22,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978044980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:58:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218112773] [2022-12-06 07:58:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:58:22,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:58:22,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:58:22,413 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:58:22,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 07:58:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:58:22,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-06 07:58:22,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:58:22,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:58:22,626 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 07:58:22,629 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 07:58:22,662 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 07:58:36,417 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 2179 DAG size of output: 71 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-06 07:58:36,418 INFO L321 Elim1Store]: treesize reduction 4123, result has 2.4 percent of original size [2022-12-06 07:58:36,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 33 select indices, 33 select index equivalence classes, 0 disjoint index pairs (out of 528 index pairs), introduced 65 new quantified variables, introduced 528 case distinctions, treesize of input 454 treesize of output 289 [2022-12-06 07:58:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:58:36,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:59:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:59:18,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218112773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:59:18,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:59:18,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:59:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800126218] [2022-12-06 07:59:18,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:59:18,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:59:18,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:59:18,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:59:18,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=250, Unknown=2, NotChecked=0, Total=306 [2022-12-06 07:59:18,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:59:18,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 141 transitions, 2034 flow. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:59:18,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:59:18,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:59:18,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:59:42,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 08:00:00,784 WARN L233 SmtUtils]: Spent 17.74s on a formula simplification. DAG size of input: 511 DAG size of output: 280 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 08:00:14,863 INFO L130 PetriNetUnfolder]: 672/1420 cut-off events. [2022-12-06 08:00:14,864 INFO L131 PetriNetUnfolder]: For 10345/10345 co-relation queries the response was YES. [2022-12-06 08:00:14,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9234 conditions, 1420 events. 672/1420 cut-off events. For 10345/10345 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8466 event pairs, 101 based on Foata normal form. 38/1458 useless extension candidates. Maximal degree in co-relation 8947. Up to 965 conditions per place. [2022-12-06 08:00:14,869 INFO L137 encePairwiseOnDemand]: 30/50 looper letters, 148 selfloop transitions, 46 changer transitions 67/261 dead transitions. [2022-12-06 08:00:14,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 261 transitions, 3868 flow [2022-12-06 08:00:14,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 08:00:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 08:00:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 166 transitions. [2022-12-06 08:00:14,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1276923076923077 [2022-12-06 08:00:14,874 INFO L175 Difference]: Start difference. First operand has 111 places, 141 transitions, 2034 flow. Second operand 26 states and 166 transitions. [2022-12-06 08:00:14,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 261 transitions, 3868 flow [2022-12-06 08:00:14,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 261 transitions, 3717 flow, removed 47 selfloop flow, removed 11 redundant places. [2022-12-06 08:00:14,898 INFO L231 Difference]: Finished difference. Result has 136 places, 156 transitions, 2356 flow [2022-12-06 08:00:14,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2356, PETRI_PLACES=136, PETRI_TRANSITIONS=156} [2022-12-06 08:00:14,898 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 115 predicate places. [2022-12-06 08:00:14,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:00:14,898 INFO L89 Accepts]: Start accepts. Operand has 136 places, 156 transitions, 2356 flow [2022-12-06 08:00:14,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:00:14,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:00:14,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 156 transitions, 2356 flow [2022-12-06 08:00:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 156 transitions, 2356 flow [2022-12-06 08:00:14,947 INFO L130 PetriNetUnfolder]: 120/512 cut-off events. [2022-12-06 08:00:14,947 INFO L131 PetriNetUnfolder]: For 5284/5298 co-relation queries the response was YES. [2022-12-06 08:00:14,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3129 conditions, 512 events. 120/512 cut-off events. For 5284/5298 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3561 event pairs, 9 based on Foata normal form. 4/512 useless extension candidates. Maximal degree in co-relation 2990. Up to 94 conditions per place. [2022-12-06 08:00:14,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 156 transitions, 2356 flow [2022-12-06 08:00:14,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 08:00:15,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_131| v_~f~0.base_91))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_91 (* v_~x2~0_144 4))))) (let ((.cse1 (select .cse2 (+ (* .cse0 4) v_~f~0.offset_91)))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_89| 4294967296) (mod (* v_~n~0_74 3) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_97)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_97)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_89|) |v_thread2Thread1of1ForFork1_~i~1#1_87|) (not (= (ite (and (< v_~x2~0_144 v_~size~0_97) (<= 0 v_~x2~0_144)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101| 0)) (= (select .cse2 (+ v_~f~0.offset_91 (* .cse1 4))) v_~x2~0_142))))) InVars {~x2~0=v_~x2~0_144, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_89|, ~n~0=v_~n~0_74, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_142, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_61|, ~size~0=v_~size~0_97, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_101|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_25|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_131|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_33|, ~n~0=v_~n~0_74, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_37|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 08:00:23,965 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 363 DAG size of output: 359 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:39,681 WARN L233 SmtUtils]: Spent 9.92s on a formula simplification. DAG size of input: 394 DAG size of output: 389 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:49,571 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 511 DAG size of output: 506 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:00:54,688 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 496 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:01:18,543 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 08:01:18,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63646 [2022-12-06 08:01:18,544 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 155 transitions, 2372 flow [2022-12-06 08:01:18,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:01:18,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:18,544 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:18,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:18,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-06 08:01:18,745 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 08:01:18,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1082486131, now seen corresponding path program 1 times [2022-12-06 08:01:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:18,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597620331] [2022-12-06 08:01:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:18,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597620331] [2022-12-06 08:01:18,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597620331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:18,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930365000] [2022-12-06 08:01:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:18,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:18,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:18,832 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:18,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 08:01:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:19,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 08:01:19,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:19,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:01:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:19,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930365000] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:01:19,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:01:19,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 08:01:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925936569] [2022-12-06 08:01:19,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:01:19,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 08:01:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:01:19,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 08:01:19,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-06 08:01:19,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 08:01:19,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 155 transitions, 2372 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 08:01:19,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:01:19,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 08:01:19,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:01:19,611 INFO L130 PetriNetUnfolder]: 610/1280 cut-off events. [2022-12-06 08:01:19,612 INFO L131 PetriNetUnfolder]: For 13386/13386 co-relation queries the response was YES. [2022-12-06 08:01:19,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8662 conditions, 1280 events. 610/1280 cut-off events. For 13386/13386 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7332 event pairs, 309 based on Foata normal form. 16/1294 useless extension candidates. Maximal degree in co-relation 8191. Up to 1202 conditions per place. [2022-12-06 08:01:19,617 INFO L137 encePairwiseOnDemand]: 48/53 looper letters, 141 selfloop transitions, 0 changer transitions 27/168 dead transitions. [2022-12-06 08:01:19,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 168 transitions, 2877 flow [2022-12-06 08:01:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:01:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:01:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 08:01:19,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24528301886792453 [2022-12-06 08:01:19,618 INFO L175 Difference]: Start difference. First operand has 119 places, 155 transitions, 2372 flow. Second operand 5 states and 65 transitions. [2022-12-06 08:01:19,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 168 transitions, 2877 flow [2022-12-06 08:01:19,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 168 transitions, 2739 flow, removed 65 selfloop flow, removed 11 redundant places. [2022-12-06 08:01:19,642 INFO L231 Difference]: Finished difference. Result has 115 places, 141 transitions, 2048 flow [2022-12-06 08:01:19,642 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2048, PETRI_PLACES=115, PETRI_TRANSITIONS=141} [2022-12-06 08:01:19,643 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 08:01:19,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:01:19,643 INFO L89 Accepts]: Start accepts. Operand has 115 places, 141 transitions, 2048 flow [2022-12-06 08:01:19,643 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:01:19,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:01:19,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 141 transitions, 2048 flow [2022-12-06 08:01:19,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 141 transitions, 2048 flow [2022-12-06 08:01:19,682 INFO L130 PetriNetUnfolder]: 111/475 cut-off events. [2022-12-06 08:01:19,682 INFO L131 PetriNetUnfolder]: For 3275/3289 co-relation queries the response was YES. [2022-12-06 08:01:19,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 475 events. 111/475 cut-off events. For 3275/3289 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3257 event pairs, 8 based on Foata normal form. 4/475 useless extension candidates. Maximal degree in co-relation 2647. Up to 85 conditions per place. [2022-12-06 08:01:19,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 141 transitions, 2048 flow [2022-12-06 08:01:19,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 08:01:19,686 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:01:19,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 08:01:19,686 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 141 transitions, 2048 flow [2022-12-06 08:01:19,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 08:01:19,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:01:19,686 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:01:19,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 08:01:19,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-06 08:01:19,892 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 08:01:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:01:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2147143504, now seen corresponding path program 1 times [2022-12-06 08:01:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:01:19,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753984309] [2022-12-06 08:01:19,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:19,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:01:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:01:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753984309] [2022-12-06 08:01:20,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753984309] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:01:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467383217] [2022-12-06 08:01:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:01:20,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:01:20,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:01:20,009 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:01:20,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 08:01:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:01:20,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 102 conjunts are in the unsatisfiable core [2022-12-06 08:01:20,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:01:20,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:01:20,235 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 08:01:20,237 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 08:01:20,264 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 08:01:46,493 WARN L233 SmtUtils]: Spent 11.44s on a formula simplification. DAG size of input: 3043 DAG size of output: 93 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-06 08:01:46,494 INFO L321 Elim1Store]: treesize reduction 5796, result has 2.2 percent of original size [2022-12-06 08:01:46,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 39 select indices, 39 select index equivalence classes, 0 disjoint index pairs (out of 741 index pairs), introduced 77 new quantified variables, introduced 741 case distinctions, treesize of input 490 treesize of output 350 [2022-12-06 08:01:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:01:46,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:02:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 08:02:30,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467383217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:02:30,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:02:30,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 08:02:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230079298] [2022-12-06 08:02:30,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:02:30,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 08:02:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:02:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 08:02:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=251, Unknown=1, NotChecked=0, Total=306 [2022-12-06 08:02:30,295 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 08:02:30,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 141 transitions, 2048 flow. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:02:30,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:02:30,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 08:02:30,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:02:32,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 08:02:50,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 08:02:57,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:03:09,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:03:31,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 08:03:32,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 08:03:36,235 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 08:03:36,799 INFO L130 PetriNetUnfolder]: 670/1414 cut-off events. [2022-12-06 08:03:36,799 INFO L131 PetriNetUnfolder]: For 10758/10758 co-relation queries the response was YES. [2022-12-06 08:03:36,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9367 conditions, 1414 events. 670/1414 cut-off events. For 10758/10758 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8504 event pairs, 101 based on Foata normal form. 34/1448 useless extension candidates. Maximal degree in co-relation 9140. Up to 965 conditions per place. [2022-12-06 08:03:36,806 INFO L137 encePairwiseOnDemand]: 30/50 looper letters, 148 selfloop transitions, 46 changer transitions 64/258 dead transitions. [2022-12-06 08:03:36,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 258 transitions, 3906 flow [2022-12-06 08:03:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 08:03:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 08:03:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 162 transitions. [2022-12-06 08:03:36,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1296 [2022-12-06 08:03:36,808 INFO L175 Difference]: Start difference. First operand has 110 places, 141 transitions, 2048 flow. Second operand 25 states and 162 transitions. [2022-12-06 08:03:36,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 258 transitions, 3906 flow [2022-12-06 08:03:36,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 258 transitions, 3675 flow, removed 81 selfloop flow, removed 10 redundant places. [2022-12-06 08:03:36,833 INFO L231 Difference]: Finished difference. Result has 134 places, 156 transitions, 2354 flow [2022-12-06 08:03:36,834 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2354, PETRI_PLACES=134, PETRI_TRANSITIONS=156} [2022-12-06 08:03:36,834 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 113 predicate places. [2022-12-06 08:03:36,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:03:36,860 INFO L89 Accepts]: Start accepts. Operand has 134 places, 156 transitions, 2354 flow [2022-12-06 08:03:36,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:03:36,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:03:36,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 156 transitions, 2354 flow [2022-12-06 08:03:36,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 156 transitions, 2354 flow [2022-12-06 08:03:36,908 INFO L130 PetriNetUnfolder]: 120/512 cut-off events. [2022-12-06 08:03:36,908 INFO L131 PetriNetUnfolder]: For 4839/4853 co-relation queries the response was YES. [2022-12-06 08:03:36,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 512 events. 120/512 cut-off events. For 4839/4853 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3602 event pairs, 9 based on Foata normal form. 4/512 useless extension candidates. Maximal degree in co-relation 2962. Up to 94 conditions per place. [2022-12-06 08:03:36,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 156 transitions, 2354 flow [2022-12-06 08:03:36,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 08:03:42,706 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 417 DAG size of output: 413 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:03:53,302 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 543 DAG size of output: 539 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:14,058 WARN L233 SmtUtils]: Spent 17.95s on a formula simplification. DAG size of input: 442 DAG size of output: 440 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:24,108 WARN L233 SmtUtils]: Spent 8.81s on a formula simplification. DAG size of input: 577 DAG size of output: 575 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:29,216 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 566 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:29,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [894] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_630| v_~f~0.base_487))) (let ((.cse32 (select .cse3 (+ v_~f~0.offset_483 (* v_~x2~0_765 4))))) (let ((.cse24 (select .cse3 (+ v_~f~0.offset_483 (* .cse32 4))))) (let ((.cse19 (select .cse3 (+ v_~f~0.offset_483 (* .cse24 4))))) (let ((.cse15 (select .cse3 (+ v_~f~0.offset_483 (* .cse19 4))))) (let ((.cse18 (select .cse3 (+ v_~f~0.offset_483 (* .cse15 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_483 (* 4 .cse18))))) (let ((.cse16 (select .cse3 (+ v_~f~0.offset_483 (* .cse2 4))))) (let ((.cse39 (select .cse3 (+ v_~f~0.offset_483 (* .cse16 4))))) (let ((.cse33 (select .cse3 (+ v_~f~0.offset_483 (* .cse39 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_483 (* .cse33 4))))) (let ((.cse28 (select .cse3 (+ v_~f~0.offset_483 (* .cse10 4))))) (let ((.cse20 (select .cse3 (+ v_~f~0.offset_483 (* .cse28 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_483 (* 4 .cse20))))) (let ((.cse25 (select .cse3 (+ v_~f~0.offset_483 (* .cse1 4))))) (let ((.cse27 (select .cse3 (+ v_~f~0.offset_483 (* 4 .cse25))))) (let ((.cse38 (select .cse3 (+ v_~f~0.offset_483 (* .cse27 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_483 (* .cse38 4))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_483 (* .cse7 4))))) (let ((.cse40 (select .cse3 (+ v_~f~0.offset_483 (* .cse11 4))))) (let ((.cse17 (select .cse3 (+ v_~f~0.offset_483 (* .cse40 4))))) (let ((.cse26 (select .cse3 (+ v_~f~0.offset_483 (* .cse17 4))))) (let ((.cse37 (select .cse3 (+ v_~f~0.offset_483 (* .cse26 4))))) (let ((.cse21 (select .cse3 (+ v_~f~0.offset_483 (* .cse37 4))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_483 (* 4 .cse21))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_483 (* .cse14 4))))) (let ((.cse31 (select .cse3 (+ v_~f~0.offset_483 (* .cse9 4))))) (let ((.cse36 (select .cse3 (+ v_~f~0.offset_483 (* .cse31 4))))) (let ((.cse30 (select .cse3 (+ (* .cse36 4) v_~f~0.offset_483)))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_483 (* .cse30 4))))) (let ((.cse29 (select .cse3 (+ v_~f~0.offset_483 (* 4 .cse13))))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_483 (* .cse29 4))))) (let ((.cse34 (select .cse3 (+ v_~f~0.offset_483 (* .cse12 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_483 (* .cse34 4))))) (let ((.cse22 (select .cse3 (+ v_~f~0.offset_483 (* 4 .cse0))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_483 (* .cse22 4))))) (let ((.cse41 (select .cse3 (+ v_~f~0.offset_483 (* .cse8 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_483 (* .cse41 4))))) (let ((.cse23 (select .cse3 (+ v_~f~0.offset_483 (* .cse5 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_483 (* .cse23 4))))) (let ((.cse35 (select .cse3 (+ v_~f~0.offset_483 (* .cse6 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_483 (* 4 .cse35))))) (and (not (= (ite (and (< .cse0 v_~size~0_487) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_487) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_487)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_483 (* .cse4 4))) v_~x2~0_763) (not (= (ite (and (< .cse5 v_~size~0_487) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_487) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_487) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_487) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_487) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_487) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_487) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_487) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse18 v_~size~0_487) (<= 0 .cse18)) 1 0) 0)) (not (= (ite (and (< .cse19 v_~size~0_487) (<= 0 .cse19)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_487) (<= 0 .cse20)) 1 0) 0)) (not (= (ite (and (< .cse21 v_~size~0_487) (<= 0 .cse21)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481| 0)) (not (= (ite (and (<= 0 .cse22) (< .cse22 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse23 v_~size~0_487) (<= 0 .cse23)) 1 0) 0)) (not (= (ite (and (<= 0 .cse24) (< .cse24 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse25 v_~size~0_487) (<= 0 .cse25)) 1 0) 0)) (not (= (ite (and (< .cse26 v_~size~0_487) (<= 0 .cse26)) 1 0) 0)) (not (= (ite (and (< .cse27 v_~size~0_487) (<= 0 .cse27)) 1 0) 0)) (not (= (ite (and (< .cse28 v_~size~0_487) (<= 0 .cse28)) 1 0) 0)) (not (= (ite (and (<= 0 .cse29) (< .cse29 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (<= 0 .cse30) (< .cse30 v_~size~0_487)) 1 0) 0)) (< 39 (mod (* 3 v_~n~0_477) 4294967296)) (not (= (ite (and (<= 0 .cse31) (< .cse31 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse32 v_~size~0_487) (<= 0 .cse32)) 1 0) 0)) (not (= (ite (and (<= 0 .cse33) (< .cse33 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (<= 0 .cse34) (< .cse34 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_765 v_~size~0_487) (<= 0 v_~x2~0_765)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449| (ite (and (< .cse4 v_~size~0_487) (<= 0 .cse4)) 1 0)) (not (= (ite (and (<= 0 .cse35) (< .cse35 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse36 v_~size~0_487) (<= 0 .cse36)) 1 0) 0)) (not (= (ite (and (< .cse37 v_~size~0_487) (<= 0 .cse37)) 1 0) 0)) (not (= (ite (and (<= 0 .cse38) (< .cse38 v_~size~0_487)) 1 0) 0)) (not (= (ite (and (< .cse39 v_~size~0_487) (<= 0 .cse39)) 1 0) 0)) (not (= (ite (and (< .cse40 v_~size~0_487) (<= 0 .cse40)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|) (= 42 |v_thread2Thread1of1ForFork1_~i~1#1_616|) (not (= (ite (and (< .cse41 v_~size~0_487) (<= 0 .cse41)) 1 0) 0))))))))))))))))))))))))))))))))))))))))))))) InVars {~x2~0=v_~x2~0_765, ~size~0=v_~size~0_487, ~f~0.base=v_~f~0.base_487, #memory_int=|v_#memory_int_630|, ~n~0=v_~n~0_477, ~f~0.offset=v_~f~0.offset_483} OutVars{~x2~0=v_~x2~0_763, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_441|, ~size~0=v_~size~0_487, ~f~0.base=v_~f~0.base_487, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_413|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_449|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_616|, ~f~0.offset=v_~f~0.offset_483, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_405|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_403|, #memory_int=|v_#memory_int_630|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_413|, ~n~0=v_~n~0_477, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_417|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [649] $Ultimate##0-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_89 v_~size~0_105) (<= 0 v_~x1~0_89)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread1Thread1of1ForFork0_~i~0#1_53| 1) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_53| 4294967295) 4294967296) (mod (* v_~n~0_84 3) 4294967296)) (= (select (select |v_#memory_int_141| v_~f~0.base_99) (+ v_~f~0.offset_99 (* v_~x1~0_89 4))) v_~x1~0_88)) InVars {~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, #memory_int=|v_#memory_int_141|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_89, ~f~0.offset=v_~f~0.offset_99} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_99, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_53|, #memory_int=|v_#memory_int_141|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~n~0=v_~n~0_84, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_39|, ~x1~0=v_~x1~0_88, ~f~0.offset=v_~f~0.offset_99} 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, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] [2022-12-06 08:04:34,658 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 426 DAG size of output: 422 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:04:44,325 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 555 DAG size of output: 551 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:05:00,241 WARN L233 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 433 DAG size of output: 429 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:05:08,163 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 565 DAG size of output: 561 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 08:05:12,117 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 08:05:12,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95258 [2022-12-06 08:05:12,118 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 155 transitions, 2370 flow [2022-12-06 08:05:12,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 08:05:12,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:05:12,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:05:12,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 08:05:12,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-06 08:05:12,324 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 08:05:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:05:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2043475842, now seen corresponding path program 1 times [2022-12-06 08:05:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:05:12,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302776378] [2022-12-06 08:05:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:05:12,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:05:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:05:12,431 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 08:05:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:05:12,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302776378] [2022-12-06 08:05:12,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302776378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:05:12,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803999709] [2022-12-06 08:05:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:05:12,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:05:12,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:05:12,434 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:05:12,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 08:05:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:05:12,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 08:05:12,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:05:12,799 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 08:05:12,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 08:05:12,826 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 08:05:12,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803999709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 08:05:12,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 08:05:12,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 08:05:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641669179] [2022-12-06 08:05:12,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 08:05:12,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 08:05:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 08:05:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 08:05:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-12-06 08:05:12,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 08:05:12,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 155 transitions, 2370 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 08:05:12,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 08:05:12,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 08:05:12,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 08:05:13,253 INFO L130 PetriNetUnfolder]: 610/1280 cut-off events. [2022-12-06 08:05:13,253 INFO L131 PetriNetUnfolder]: For 12504/12504 co-relation queries the response was YES. [2022-12-06 08:05:13,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8608 conditions, 1280 events. 610/1280 cut-off events. For 12504/12504 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7347 event pairs, 309 based on Foata normal form. 16/1294 useless extension candidates. Maximal degree in co-relation 8138. Up to 1202 conditions per place. [2022-12-06 08:05:13,259 INFO L137 encePairwiseOnDemand]: 48/53 looper letters, 141 selfloop transitions, 0 changer transitions 27/168 dead transitions. [2022-12-06 08:05:13,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 168 transitions, 2875 flow [2022-12-06 08:05:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 08:05:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 08:05:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 08:05:13,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24528301886792453 [2022-12-06 08:05:13,261 INFO L175 Difference]: Start difference. First operand has 118 places, 155 transitions, 2370 flow. Second operand 5 states and 65 transitions. [2022-12-06 08:05:13,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 168 transitions, 2875 flow [2022-12-06 08:05:13,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 168 transitions, 2739 flow, removed 64 selfloop flow, removed 10 redundant places. [2022-12-06 08:05:13,284 INFO L231 Difference]: Finished difference. Result has 115 places, 141 transitions, 2048 flow [2022-12-06 08:05:13,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2048, PETRI_PLACES=115, PETRI_TRANSITIONS=141} [2022-12-06 08:05:13,285 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 08:05:13,285 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 08:05:13,285 INFO L89 Accepts]: Start accepts. Operand has 115 places, 141 transitions, 2048 flow [2022-12-06 08:05:13,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 08:05:13,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 08:05:13,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 141 transitions, 2048 flow [2022-12-06 08:05:13,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 141 transitions, 2048 flow [2022-12-06 08:05:13,324 INFO L130 PetriNetUnfolder]: 111/475 cut-off events. [2022-12-06 08:05:13,324 INFO L131 PetriNetUnfolder]: For 3275/3289 co-relation queries the response was YES. [2022-12-06 08:05:13,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 475 events. 111/475 cut-off events. For 3275/3289 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3255 event pairs, 8 based on Foata normal form. 4/475 useless extension candidates. Maximal degree in co-relation 2647. Up to 85 conditions per place. [2022-12-06 08:05:13,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 141 transitions, 2048 flow [2022-12-06 08:05:13,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 08:05:13,328 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 08:05:13,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 08:05:13,328 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 141 transitions, 2048 flow [2022-12-06 08:05:13,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 08:05:13,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 08:05:13,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:05:13,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-06 08:05:13,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:05:13,534 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 08:05:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 08:05:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 925782106, now seen corresponding path program 1 times [2022-12-06 08:05:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 08:05:13,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418152066] [2022-12-06 08:05:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:05:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 08:05:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:05:13,658 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 08:05:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 08:05:13,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418152066] [2022-12-06 08:05:13,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418152066] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 08:05:13,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475854219] [2022-12-06 08:05:13,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 08:05:13,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:05:13,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 08:05:13,660 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 08:05:13,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 08:05:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 08:05:13,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-06 08:05:13,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 08:05:13,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 08:05:13,954 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 08:05:13,957 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 08:05:13,984 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 08:06:28,121 WARN L233 SmtUtils]: Spent 30.38s on a formula simplification. DAG size of input: 4051 DAG size of output: 95 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-06 08:06:28,122 INFO L321 Elim1Store]: treesize reduction 7783, result has 1.7 percent of original size [2022-12-06 08:06:28,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 45 select indices, 45 select index equivalence classes, 0 disjoint index pairs (out of 990 index pairs), introduced 89 new quantified variables, introduced 990 case distinctions, treesize of input 1115 treesize of output 388 [2022-12-06 08:06:28,807 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 08:06:28,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-12-06 08:08:07,931 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 08:08:07,931 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 08:08:08,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 08:08:08,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 08:08:08,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 08:08:08,857 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 17 known predicates. [2022-12-06 08:08:08,858 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 08:08:08,858 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 08:08:08,858 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 08:08:08,860 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 08:08:08,860 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 08:08:08,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:08:08 BasicIcfg [2022-12-06 08:08:08,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 08:08:08,862 INFO L158 Benchmark]: Toolchain (without parser) took 862742.01ms. Allocated memory was 227.5MB in the beginning and 887.1MB in the end (delta: 659.6MB). Free memory was 201.9MB in the beginning and 754.6MB in the end (delta: -552.7MB). Peak memory consumption was 107.9MB. Max. memory is 8.0GB. [2022-12-06 08:08:08,862 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 227.5MB. Free memory is still 204.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 08:08:08,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.62ms. Allocated memory is still 227.5MB. Free memory was 201.9MB in the beginning and 190.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 08:08:08,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.40ms. Allocated memory is still 227.5MB. Free memory was 190.3MB in the beginning and 188.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 08:08:08,862 INFO L158 Benchmark]: Boogie Preprocessor took 26.74ms. Allocated memory is still 227.5MB. Free memory was 188.3MB in the beginning and 186.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 08:08:08,863 INFO L158 Benchmark]: RCFGBuilder took 408.65ms. Allocated memory is still 227.5MB. Free memory was 186.7MB in the beginning and 170.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 08:08:08,863 INFO L158 Benchmark]: TraceAbstraction took 862021.02ms. Allocated memory was 227.5MB in the beginning and 887.1MB in the end (delta: 659.6MB). Free memory was 169.4MB in the beginning and 754.6MB in the end (delta: -585.2MB). Peak memory consumption was 75.4MB. Max. memory is 8.0GB. [2022-12-06 08:08:08,863 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 227.5MB. Free memory is still 204.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.62ms. Allocated memory is still 227.5MB. Free memory was 201.9MB in the beginning and 190.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.40ms. Allocated memory is still 227.5MB. Free memory was 190.3MB in the beginning and 188.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.74ms. Allocated memory is still 227.5MB. Free memory was 188.3MB in the beginning and 186.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 408.65ms. Allocated memory is still 227.5MB. Free memory was 186.7MB in the beginning and 170.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 862021.02ms. Allocated memory was 227.5MB in the beginning and 887.1MB in the end (delta: 659.6MB). Free memory was 169.4MB in the beginning and 754.6MB in the end (delta: -585.2MB). Peak memory consumption was 75.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 149 PlacesBefore, 21 PlacesAfterwards, 157 TransitionsBefore, 17 TransitionsAfterwards, 2592 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 59 ConcurrentYvCompositions, 12 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 1609, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1612, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1538, unknown conditional: 0, unknown unconditional: 1538] , Statistics on independence cache: Total cache size (in pairs): 3041, Positive cache size: 3038, Positive conditional cache size: 0, Positive unconditional cache size: 3038, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 56 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): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -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): 15, Positive cache size: 15, Positive conditional cache size: 1, 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): 15, Positive cache size: 15, Positive conditional cache size: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, 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): 16, Positive cache size: 15, Positive conditional cache size: 1, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 1, 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.1s, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 9, dependent conditional: 9, 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): 20, Positive cache size: 18, Positive conditional cache size: 4, 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: 0.4s, 37 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, 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: 13, independent: 9, independent conditional: 9, 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: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 5, Negative conditional cache size: 5, 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, 28 TransitionsBefore, 28 TransitionsAfterwards, 88 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): 29, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, Negative cache size: 5, Negative conditional cache size: 5, 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, 43 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 32, Positive conditional cache size: 17, Positive unconditional cache size: 15, Negative cache size: 5, Negative conditional cache size: 5, 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.3s, 57 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 41 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 54, Positive conditional cache size: 39, Positive unconditional cache size: 15, Negative cache size: 8, Negative conditional cache size: 8, 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, 49 PlacesBefore, 49 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 54, Positive conditional cache size: 39, Positive unconditional cache size: 15, Negative cache size: 8, Negative conditional cache size: 8, 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.8s, 58 PlacesBefore, 56 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 58, Positive conditional cache size: 43, Positive unconditional cache size: 15, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 68 PlacesBefore, 68 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 71, Positive conditional cache size: 55, Positive unconditional cache size: 16, Negative cache size: 8, Negative conditional cache size: 8, 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, 69 PlacesBefore, 69 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 318 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): 94, Positive cache size: 86, Positive conditional cache size: 69, Positive unconditional cache size: 17, Negative cache size: 8, Negative conditional cache size: 8, 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.1s, 76 PlacesBefore, 76 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 376 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): 97, Positive cache size: 89, Positive conditional cache size: 72, Positive unconditional cache size: 17, Negative cache size: 8, Negative conditional cache size: 8, 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, 82 PlacesBefore, 81 PlacesAfterwards, 113 TransitionsBefore, 112 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 92, Positive conditional cache size: 74, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 87 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 412 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): 101, Positive cache size: 93, Positive conditional cache size: 75, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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, 100 PlacesBefore, 100 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 12, independent: 9, independent conditional: 9, 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): 104, Positive cache size: 96, Positive conditional cache size: 78, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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, 109 PlacesBefore, 109 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 448 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: 96, Positive conditional cache size: 78, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, 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.8s, 105 PlacesBefore, 105 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 103, Positive conditional cache size: 85, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 106 PlacesBefore, 106 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 404 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): 112, Positive cache size: 104, Positive conditional cache size: 86, Positive unconditional cache size: 18, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 103 PlacesBefore, 103 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 113, Positive conditional cache size: 93, Positive unconditional cache size: 20, Negative cache size: 8, Negative conditional cache size: 8, 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, 97 PlacesBefore, 97 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 362 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): 121, Positive cache size: 113, Positive conditional cache size: 93, Positive unconditional cache size: 20, Negative cache size: 8, Negative conditional cache size: 8, 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, 102 PlacesBefore, 102 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 368 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): 121, Positive cache size: 113, Positive conditional cache size: 93, Positive unconditional cache size: 20, Negative cache size: 8, Negative conditional cache size: 8, 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: 5.6s, 114 PlacesBefore, 114 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 131, Positive cache size: 123, Positive conditional cache size: 102, Positive unconditional cache size: 21, Negative cache size: 8, Negative conditional cache size: 8, 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, 115 PlacesBefore, 114 PlacesAfterwards, 129 TransitionsBefore, 128 TransitionsAfterwards, 380 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: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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): 131, Positive cache size: 123, Positive conditional cache size: 102, Positive unconditional cache size: 21, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 116 PlacesBefore, 116 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 344 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): 134, Positive cache size: 126, Positive conditional cache size: 104, Positive unconditional cache size: 22, Negative cache size: 8, Negative conditional cache size: 8, 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.7s, 118 PlacesBefore, 117 PlacesAfterwards, 112 TransitionsBefore, 111 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 135, Positive conditional cache size: 111, Positive unconditional cache size: 24, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 114 PlacesBefore, 113 PlacesAfterwards, 107 TransitionsBefore, 106 TransitionsAfterwards, 330 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: 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: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 145, Positive conditional cache size: 120, Positive unconditional cache size: 25, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 95 PlacesBefore, 95 PlacesAfterwards, 78 TransitionsBefore, 79 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 201, Positive conditional cache size: 172, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 8, 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, 91 PlacesBefore, 91 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 266 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): 215, Positive cache size: 207, Positive conditional cache size: 177, Positive unconditional cache size: 30, Negative cache size: 8, Negative conditional cache size: 8, 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, 94 PlacesBefore, 92 PlacesAfterwards, 84 TransitionsBefore, 82 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 10, independent: 5, independent conditional: 4, independent unconditional: 1, 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): 220, Positive cache size: 212, Positive conditional cache size: 182, Positive unconditional cache size: 30, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 97 PlacesBefore, 95 PlacesAfterwards, 74 TransitionsBefore, 72 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 213, Positive conditional cache size: 183, Positive unconditional cache size: 30, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 98 PlacesBefore, 98 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 352 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): 227, Positive cache size: 219, Positive conditional cache size: 187, Positive unconditional cache size: 32, Negative cache size: 8, Negative conditional cache size: 8, 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, 94 PlacesBefore, 94 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 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): 234, Positive cache size: 226, Positive conditional cache size: 193, Positive unconditional cache size: 33, Negative cache size: 8, Negative conditional cache size: 8, 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, 86 PlacesBefore, 86 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 308 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): 234, Positive cache size: 226, Positive conditional cache size: 193, Positive unconditional cache size: 33, Negative cache size: 8, Negative conditional cache size: 8, 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: 2.0s, 92 PlacesBefore, 90 PlacesAfterwards, 102 TransitionsBefore, 100 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 89, independent conditional: 89, 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: 89, independent: 89, independent conditional: 80, independent unconditional: 9, 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: 89, independent: 89, independent conditional: 77, independent unconditional: 12, 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: 89, independent: 89, independent conditional: 77, independent unconditional: 12, 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: 16, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, independent: 73, independent conditional: 63, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 14, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 242, Positive conditional cache size: 207, Positive unconditional cache size: 35, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 312 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): 250, Positive cache size: 242, Positive conditional cache size: 207, Positive unconditional cache size: 35, Negative cache size: 8, Negative conditional cache size: 8, 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, 85 PlacesBefore, 85 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 286 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: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 243, Positive conditional cache size: 207, Positive unconditional cache size: 36, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 108 PlacesBefore, 107 PlacesAfterwards, 113 TransitionsBefore, 112 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 5, independent conditional: 5, 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): 279, Positive cache size: 271, Positive conditional cache size: 232, Positive unconditional cache size: 39, Negative cache size: 8, Negative conditional cache size: 8, 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.1s, 107 PlacesBefore, 106 PlacesAfterwards, 142 TransitionsBefore, 141 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 93, independent conditional: 93, 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: 93, independent: 93, independent conditional: 24, independent unconditional: 69, 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: 93, independent: 93, independent conditional: 24, independent unconditional: 69, 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: 93, independent: 93, independent conditional: 24, independent unconditional: 69, 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: 93, independent: 93, independent conditional: 24, independent unconditional: 69, 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): 279, Positive cache size: 271, Positive conditional cache size: 232, Positive unconditional cache size: 39, Negative cache size: 8, Negative conditional cache size: 8, 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: 14.9s, 117 PlacesBefore, 116 PlacesAfterwards, 156 TransitionsBefore, 155 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 5, independent conditional: 5, 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): 308, Positive cache size: 300, Positive conditional cache size: 258, Positive unconditional cache size: 42, Negative cache size: 8, Negative conditional cache size: 8, 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, 107 PlacesBefore, 107 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 376 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): 308, Positive cache size: 300, Positive conditional cache size: 258, Positive unconditional cache size: 42, Negative cache size: 8, Negative conditional cache size: 8, 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: 58.1s, 122 PlacesBefore, 121 PlacesAfterwards, 166 TransitionsBefore, 165 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 338, Positive conditional cache size: 293, Positive unconditional cache size: 45, Negative cache size: 8, Negative conditional cache size: 8, 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, 111 PlacesBefore, 111 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 376 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): 346, Positive cache size: 338, Positive conditional cache size: 293, Positive unconditional cache size: 45, Negative cache size: 8, Negative conditional cache size: 8, 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: 63.6s, 120 PlacesBefore, 119 PlacesAfterwards, 156 TransitionsBefore, 155 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 5, independent conditional: 5, 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): 380, Positive cache size: 372, Positive conditional cache size: 324, Positive unconditional cache size: 48, Negative cache size: 8, Negative conditional cache size: 8, 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, 110 PlacesBefore, 110 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 376 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): 380, Positive cache size: 372, Positive conditional cache size: 324, Positive unconditional cache size: 48, Negative cache size: 8, Negative conditional cache size: 8, 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: 95.2s, 119 PlacesBefore, 118 PlacesAfterwards, 156 TransitionsBefore, 155 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 376, Positive conditional cache size: 326, Positive unconditional cache size: 50, Negative cache size: 8, Negative conditional cache size: 8, 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, 110 PlacesBefore, 110 PlacesAfterwards, 141 TransitionsBefore, 141 TransitionsAfterwards, 376 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): 384, Positive cache size: 376, Positive conditional cache size: 326, Positive unconditional cache size: 50, Negative cache size: 8, Negative conditional cache size: 8, 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: 91]: 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 17 known predicates. - TimeoutResultAtElement [Line: 86]: 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 17 known predicates. - TimeoutResultAtElement [Line: 85]: 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 17 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 213 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: 861.9s, OverallIterations: 52, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 188.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 2118 SdHoareTripleChecker+Valid, 120.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2118 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 117.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 39 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 1038 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15677 IncrementalHoareTripleChecker+Invalid, 16767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1038 mSolverCounterUnsat, 5 mSDtfsCounter, 15677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1134 GetRequests, 578 SyntacticMatches, 14 SemanticMatches, 542 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 103.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2555occurred in iteration=46, InterpolantAutomatonStates: 477, 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, 3.1s SatisfiabilityAnalysisTime, 191.0s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 1290 ConstructedInterpolants, 48 QuantifiedInterpolants, 201113 SizeOfPredicates, 269 NumberOfNonLiveVariables, 5444 ConjunctsInSsa, 861 ConjunctsInUnsatCore, 105 InterpolantComputations, 24 PerfectInterpolantSequences, 9/146 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